Delerue Arriaga, Afonso[University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Iovino, Vincenzo[University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Tang, Qiang[University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)]
Dec-2016
Paradigms in Cryptology - Mycrypt 2016. Malicious and Exploratory Cryptology, Second International Conference, Mycrypt 2016, Kuala Lumpur, Malaysia, December 1-2, 2016, Revised Selected Papers
Springer
Lecture Notes in Computer Science 10311
347-363
Yes
No
International
978-3-319-61272-0
International Conference on Cryptology in Malaysia 2016 (Mycrypt 2016)
[en] Functional encryption (FE) allows an authority to issue tokens associated with various functions, allowing the holder of some token for function f to learn only f(D) from a ciphertext that encrypts D. The standard approach is to model f as a circuit, which yields inefficient evaluations over large inputs. Here, we propose a new primitive that we call updatable functional encryption (UFE), where instead of circuits we deal with RAM programs, which are closer to how programs are expressed in von Neumann architecture. We impose strict efficiency constrains in that the run-time of a token P' on ciphertext CT is proportional to the run-time of its clear-form counterpart (program P on memory D) up to a polylogarithmic factor in the size of D, and we envision tokens that are capable to update the ciphertext, over which other tokens can be subsequently executed. We define a security notion for our primitive and propose a candidate construction from obfuscation, which serves as a starting point towards the realization of other schemes and contributes to the study on how to compute RAM programs over public-key encrypted data.
[University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
