Paper published in a book (Scientific congresses, symposiums and conference proceedings)
On the Achievability of Simulation-Based Security for Functional Encryption
De caro, Angelo; Iovino, Vincenzo; Jain, Abhishek et al.
2013In Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II
Peer reviewed
 

Files


Full Text
main.pdf
Publisher postprint (604.99 kB)
Extended version
Download

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Functional Encryption; Hidden-Vector Encryption; Simulation-Security
Abstract :
[en] This work attempts to clarify to what extent simulation-based security (SIM-security) is achievable for functional encryption (FE) and its relation to the weaker indistinguishability-based security (IND-security). Our main result is a compiler that transforms any FE scheme for the general circuit functionality (which we denote by Circuit-FE) meeting indistinguishability-based security (IND-security) to a Circuit-FE scheme meeting SIM-security, where: In the random oracle model, the resulting scheme is secure for an unbounded number of encryption and key queries, which is the strongest security level one can ask for. In the standard model, the resulting scheme is secure for a bounded number of encryption and non-adaptive key queries, but an unbounded number of adaptive key queries. This matches known impossibility results and improves upon Gorbunov et al. [CRYPTO’12] (which is only secure for non-adaptive key queries). Our compiler is inspired by the celebrated Fiat-Lapidot-Shamir paradigm [FOCS’90] for obtaining zero-knowledge proof systems from witness-indistinguishable proof systems. As it is currently unknown whether Circuit-FE meeting IND-security exists, the purpose of this result is to establish that it remains a good target for future research despite known deficiencies of IND-security [Boneh et al. – TCC’11, O’Neill – ePrint ’10]. We also give a tailored construction of SIM-secure hidden vector encryption (HVE) in composite-order bilinear groups. Finally, we revisit the known negative results for SIM-secure FE, extending them to natural weakenings of the security definition and thus providing essentially a full picture of the (in)achievability of SIM-secure FE.
Disciplines :
Computer science
Author, co-author :
De caro, Angelo
Iovino, Vincenzo ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Jain, Abhishek;  Johns Hopkins University
O'Neill, Adam;  Georgetown University
Paneth, Omer;  Boston University
Persiano, Giuseppe;  University of Salerno
External co-authors :
yes
Language :
English
Title :
On the Achievability of Simulation-Based Security for Functional Encryption
Publication date :
2013
Event name :
CRYPTO 2013
Event organizer :
IACR
Event place :
Santa Barbara, United States - California
Event date :
from 18-08-2013 to 22-08-2013
Audience :
International
Main work title :
Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part II
Publisher :
Springer
ISBN/EAN :
978-3-642-40083-4
Collection name :
Lecture Notes in Computer Science 8043
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
Available on ORBilu :
since 21 February 2016

Statistics


Number of views
94 (8 by Unilu)
Number of downloads
152 (2 by Unilu)

Scopus citations®
 
61
Scopus citations®
without self-citations
46
WoS citations
 
54

Bibliography


Similar publications



Contact ORBilu