On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
From MaRDI portal
(Redirected from Publication:6157502)
Recommendations
- QCCA-secure generic key encapsulation mechanism with tighter security in the quantum random oracle model
- Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- Tighter proofs of CCA security in the quantum random oracle model
Cites work
- (Tightly) QCCA-secure key-encapsulation mechanism in the quantum random oracle model
- A modular analysis of the Fujisaki-Okamoto transformation
- Advances in Cryptology – CRYPTO 2004
- Another look at provable security. (Abstract)
- Black-box constructions of protocols for secure computation
- Black-box reductions and separations in cryptography
- Breaking RSA may not be equivalent to factoring
- Classical vs quantum random oracles
- Cryptography and Coding
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Generic authenticated key exchange in the quantum random oracle model
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1617924 (Why is no real title available?)
- scientific article; zbMATH DE number 1617925 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 2079933 (Why is no real title available?)
- scientific article; zbMATH DE number 2086712 (Why is no real title available?)
- scientific article; zbMATH DE number 1842496 (Why is no real title available?)
- Improved Bounds on Security Reductions for Discrete Log Based Signatures
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- Key encapsulation mechanism with explicit rejection in the quantum random oracle model
- Leighton-Micali hash-based signatures in the quantum random-oracle model
- Limitations of the meta-reduction technique: the case of Schnorr signatures
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- Notions of black-box reductions, revisited
- On the exact security of Schnorr-type signatures in the random oracle model
- On the Generic Insecurity of the Full Domain Hash
- On the impossibility of tight cryptographic reductions
- On tight security proofs for Schnorr signatures
- Optimal security proofs for full domain hash. Revisited
- Optimal security reductions for unique signatures: bypassing impossibilities with a counterexample
- Post-quantum security of Fiat-Shamir
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Quantum position verification in the random oracle model
- Quantum security of NMAC and related constructions. PRF domain extension against quantum attacks
- Quantum security proofs using semi-classical oracles
- Quantum state discrimination and its applications
- Random oracles in a quantum world
- Revocable Quantum Timed-Release Encryption
- Scalable ciphertext compression techniques for post-quantum KEMs and their applications
- Secure integration of asymmetric and symmetric encryption schemes
- Secure integration of asymmetric and symmetric encryption schemes
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- The Fiat-Shamir transformation in a quantum world
- Tighter proofs of CCA security in the quantum random oracle model
- Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- Towards non-black-box lower bounds in cryptography
- Why Proving HIBE Systems Secure Is Difficult
Cited in
(13)- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
- QCCA-secure generic key encapsulation mechanism with tighter security in the quantum random oracle model
- Tighter proofs of CCA security in the quantum random oracle model
- On the security of NTS-KEM in the quantum random oracle model
- Key encapsulation mechanism with explicit rejection in the quantum random oracle model
- Tighter security proofs for generic key encapsulation mechanism in the quantum random oracle model
- Iterated random oracle: a universal approach for finding loss in security reduction
- Tighter security proofs for post-quantum key encapsulation mechanism in the multi-challenge setting
- KDM security for the Fujisaki-Okamoto transformations in the QROM
- Tighter QCCA-secure key encapsulation mechanism with explicit rejection in the quantum random oracle model
- Tighter proofs for PKE-to-KEM transformation in the quantum random oracle model
- Measure-rewind-extract: tighter proofs of one-way to hiding and CCA security in the quantum random oracle model
This page was built for publication: On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157502)
