Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On the Achievability of Simulation-Based Security for Functional Encryption

Angelo De, Vincenzo Iovino, Abhishek Jain, Adam O’Neill, Omer Paneth, Giuseppe Persiano

Published Jan 1, 2013• 117 citations
Publisher
DOI
10.1007/978-3-642-40084-1_29

Related papers

Simulation-Based Secure Functional Encryption in the Random Oracle Model

Vincenzo Iovino, Karol Żebroski

Lecture notes in computer science•Jan 1, 2015•11 citations

Impossibility of Simulation Secure Functional Encryption Even with Random Oracles

Shashank Agrawal, Venkata Koppula, Brent R. Waters

Lecture notes in computer science•Jan 1, 2018•10 citations

Adaptive Simulation Security for Inner Product Functional Encryption

Shweta Agrawal, Benoît Libert, Monosij Maitra +1 more

Lecture notes in computer science•Jan 1, 2020•61 citations

Simulation Secure Multi-input Quadratic Functional Encryption

Ferran Alborch Escobar, Sébastien Canard, Fabien Laguillaumie

Lecture notes in computer science•Jan 1, 2025•2 citations

Simulation-based security of function-hiding inner product encryption

Qingsong Zhao, Qingkai Zeng, Ximeng Liu +1 more

Science China Information Sciences•Jan 19, 2018•10 citations

Simulation-Based Secure Functional Encryption in the Random Oracle Model.

Vincenzo Iovino, Karol Żebrowski

One of the main lines of research in functional encryption (FE) has consisted in studying the security notions for FE and their achievability. This study was initiated by [Boneh et al. { TCC’11, O’Neill { ePrint’10] where it was rst shown that for FE the indistinguishabilitybased (IND) security notion is not sucient in the sense that there are FE schemes that are provably IND-Secure but concretely insecure. For this reason, researchers investigated the achievability of Simulation-based (SIM) security, a stronger notion of security. Unfortunately, the above-mentioned works and others [e.g., Agrawal et al. { CRYPTO’13] have shown strong impossibility results for SIM-Security. One way to overcome these impossibility results was rst

•Jan 1, 2014•6 citations
One of the main lines of research in functional encryption (FE) has consisted in studying the security notions for FE and their achievability. This study was initiated by [Boneh et al. { TCC’11, O’Neill { ePrint’10] where it was rst shown that for FE the indistinguishabilitybased (IND) security notion is not sucient in the sense that there are FE schemes that are provably IND-Secure but concretely insecure. For this reason, researchers investigated the achievability of Simulation-based (SIM) security, a stronger notion of security. Unfortunately, the above-mentioned works and others [e.g., Agrawal et al. { CRYPTO’13] have shown strong impossibility results for SIM-Security. One way to overcome these impossibility results was rst