Classical vs quantum random oracles
From MaRDI portal
Publication:2056754
DOI10.1007/978-3-030-77886-6_20zbMath1479.94349OpenAlexW3097091928MaRDI QIDQ2056754
Takashi Yamakawa, Mark Zhandry
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77886-6_20
Related Items (7)
On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model ⋮ Redeeming reset indifferentiability and applications to post-quantum security ⋮ Tight adaptive reprogramming in the QROM ⋮ Constructive post-quantum reductions ⋮ Sponge-based authenticated encryption: security against quantum attackers ⋮ Post-quantum insecurity from LWE ⋮ Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- Secure integration of asymmetric and symmetric encryption schemes
- Complexity limitations on quantum computation
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- How to record quantum queries, and applications to quantum indifferentiability
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- BQP and the polynomial hierarchy
- Security Proofs for Signature Schemes
- The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- A Note on Quantum Security for Post-Quantum Cryptography
- Random Oracles in a Quantum World
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Lossy trapdoor functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security
- One-shot signatures and applications to hybrid quantum/classical authentication
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Quantum lower bounds by polynomials
- On lattices, learning with errors, random linear codes, and cryptography
- Tighter security proofs for GPV-IBE in the quantum random oracle model
This page was built for publication: Classical vs quantum random oracles
