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

Impossibility of Simulation Secure Functional Encryption Even with Random Oracles

Shashank Agrawal, Venkata Koppula, Brent R. Waters

Published Jan 1, 2018• 9 citations
Publisher
DOI
10.1007/978-3-030-03807-6_24

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

Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security

Juliane Krämer, Patrick Struck

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

Secure Identity-Based Encryption in the Quantum Random Oracle Model

Mark Zhandry

Lecture notes in computer science•Jan 1, 2012•140 citations

On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles

Alexandra Boldyreva, Serge Fehr, Adam O’Neill

Lecture notes in computer science•Aug 20, 2008•233 citations

Multi-Client Inner-Product Functional Encryption in the Random-Oracle Model

Michel Ferreira Abdalla, Florian Bourse, Hugo Marival +3 more

Lecture notes in computer science•Jan 1, 2020•33 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•7 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