Reference : Updatable Functional Encryption
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/29145
Updatable Functional Encryption
English
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)]
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
Yes
No
International
978-3-319-61272-0
Mycrypt 2016: Paradigm-shifting Crypto
1-12-2016 to 2-12-2016
Kuala Lumpur
Malaysia
[en] Updatable functional encryption ; RAM model ; Persistent memory
[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.
Researchers
http://hdl.handle.net/10993/29145
FnR ; FNR5107187 > Afonso Delerue Arriaga > RAPID > Practical Searchable Encryption Design through Computation Delegation > 15/01/2013 > 14/01/2017 > 2012; FNR7884937 > Vincenzo Iovino > CRYPTOCHESS > Cryptography for Cloud Homomorphic Encrypted Secure Systems > 01/12/2014 > 30/11/2016 > 2014

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
main.pdfPublisher postprint386.56 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.