Classical vs quantum random oracles
From MaRDI portal
Publication:2056754
Recommendations
- A Note on the Instantiability of the Quantum Random Oracle
- Random oracles in a quantum world
- Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security
- Quantum random oracle model with auxiliary input
- How to record quantum queries, and applications to quantum indifferentiability
Cites work
- A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model
- A note on quantum security for post-quantum cryptography
- BQP and the polynomial hierarchy
- Complexity limitations on quantum computation
- Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1842496 (Why is no real title available?)
- scientific article; zbMATH DE number 7651035 (Why is no real title available?)
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation
- Lossy trapdoor functions and their applications
- On lattices, learning with errors, random linear codes, and cryptography
- One-shot signatures and applications to hybrid quantum/classical authentication
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Quantum lower bounds by polynomials
- Random oracles in a quantum world
- Revisiting post-quantum Fiat-Shamir
- Secure identity-based encryption in the quantum random oracle model
- Secure integration of asymmetric and symmetric encryption schemes
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Security proofs for signature schemes
- Separating succinct non-interactive arguments from all falsifiable assumptions
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- The need for structure in quantum speedups
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(36)- Quantum cryptanalysis of the full AES-256-based Davies-Meyer, Hirose and MJH hash functions
- Separate your domains: NIST PQC KEMs, oracle cloning and read-only indifferentiability
- Online-extractability in the quantum random-oracle model
- Quantum random oracle model with auxiliary input
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- Random oracles in a quantum world
- RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
- On the impossibility of key agreements from quantum random oracles
- Non-uniformity and quantum advice in the quantum random oracle model
- 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
- scientific article; zbMATH DE number 7701522 (Why is no real title available?)
- Constructive post-quantum reductions
- Sponge-based authenticated encryption: security against quantum attackers
- Post-quantum insecurity from LWE
- Non-Observable Quantum Random Oracle Model
- Certified randomness from quantum supremacy
- Quantum depth in the random oracle model
- Quantum advantage from any non-local game
- Quantum-access security of hash-based signature schemes
- Post-quantum security of key encapsulation mechanism against CCA attacks with a single decapsulation query
- Probabilistic hash-and-sign with retry in the quantum random oracle model
- Selective opening security in the quantum random oracle model, revisited
- Quantum lifting for invertible permutations and ideal ciphers
- Tight adaptive simulation security for identity-based inner-product FE in the (quantum) random oracle model
- Tighter proofs for PKE-to-KEM transformation in the quantum random oracle model
- Improved quantum lifting by coherent measure-and-reprogram
- Generalized hybrid search with applications to blockchains and hash function security
- Verifiable quantum advantage without structure
- On digital signatures based on group actions: QROM security and ring signatures
- A Fiat-Shamir transformation from duplex sponges
- NISQ security and complexity via simple classical reasoning
- The black-box simulation barrier persists in a fully quantum world
- On post-quantum signature with message recovery from hash-and-sign in QROM
This page was built for publication: Classical vs quantum random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056754)
