Reference : Private Functional Encryption: Indistinguishability-Based Definitions and Constructio...
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation
Delerue Arriaga, Afonso mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Barbosa, Manuel mailto [University of Porto > HASLab - INESC TEC, DCC FC]
Farshim, Pooya mailto [PSL Research University > ENS, CNRS & INRIA]
Progress in Cryptology -- INDOCRYPT 2016: 17th International Conference on Cryptology in India, Kolkata, India, December 11-14, 2016, Proceedings
Dunkelman, Orr
Sanadhya, Somitra Kumar
LNCS; 10095
Progress in Cryptology – INDOCRYPT 2016
11-12-2016 to 14-12-2016
[en] Function privacy ; functional encryption ; obfuscation ; keyword search ; inner-product encryption
[en] Private functional encryption guarantees that not only the information in ciphertexts is hidden but also the circuits in decryption tokens are protected. A notable use case of this notion is query privacy in searchable encryption. Prior privacy models in the literature were fine-tuned for specific functionalities (namely, identity-based encryption and inner-product encryption), did not model correlations between ciphertexts and decryption tokens, or fell under strong uninstantiability results. We develop a new indistinguishability-based privacy notion that overcomes these limitations and give constructions supporting different circuit classes and meeting varying degrees of security. Obfuscation is a common building block that these constructions share, albeit the obfuscators necessary for each construction are based on different assumptions. In particular, we develop a composable and distributionally secure hyperplane membership obfuscator and use it to build an inner-product encryption scheme that achieves an unprecedented level of privacy, positively answering a question left open by Boneh, Raghunathan and Segev (ASIACRYPT 2013) concerning the extension and realization of enhanced security for schemes supporting this functionality.
FnR ; FNR5107187 > Afonso Delerue Arriaga > RAPID > Practical Searchable Encryption Design through Computation Delegation > 15/01/2013 > 14/01/2017 > 2012

File(s) associated to this reference

Fulltext file(s):

Limited access
main.pdfPublisher postprint468 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.