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

Secure Identity-Based Encryption in the Quantum Random Oracle Model

Mark Zhandry

Published Jan 1, 2012• 154 citations
Publisher
DOI
10.1007/978-3-642-32009-5_44

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

Tightly Secure Lattice Identity-Based Signature in the Quantum Random Oracle Model

Ernest Foo, Qinyi Li

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

Identity-Based Encryption Resilient to Continual Leakage Without Random Oracles

Yuyan Guo, Mingming Jiang, Shimin Wei +2 more

Communications in computer and information science•Jan 1, 2019•0 citations

Identity-Based Matchmaking Encryption Without Random Oracles

Danilo Francati, Alessio Guidi, Luigi Russo +1 more

Lecture notes in computer science•Jan 1, 2021•59 citations

Secure Identity-Based Encryption in the Quantum Random Oracle Model

Mark Zhandry

We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that requires no additional assumptions. Our techniques are quite general and we use them to obtain security proofs for two random oracle hierarchical identity-based encryption schemes and a random oracle signature scheme, all of which have previously resisted quantum security proofs, even using additional assumptions. We also explain how to remove the extra assumptions from prior quantum random oracle model proofs. We accomplish these results by developing new tools for arguing that quantum algorithms cannot distinguish between two oracle distributions. Using a particular class of oracle distributions, so called semi-constant distributions, we argue that the aforementioned cryptosystems are secure against quantum adversaries.

•Jan 1, 2012•95 citations
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model that requires no additional assumptions. Our techniques are quite general and we use them to obtain security proofs for two random oracle hierarchical identity-based encryption schemes and a random oracle signature scheme, all of which have previously resisted quantum security proofs, even using additional assumptions. We also explain how to remove the extra assumptions from prior quantum random oracle model proofs. We accomplish these results by developing new tools for arguing that quantum algorithms cannot distinguish between two oracle distributions. Using a particular class of oracle distributions, so called semi-constant distributions, we argue that the aforementioned cryptosystems are secure against quantum adversaries.