Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
From MaRDI portal
Publication:2055676
DOI10.1007/978-3-030-45727-3_24zbMath1479.94202OpenAlexW3021149946MaRDI QIDQ2055676
Veronika Kuchta, Amin Sakzad, Damien Stehlé, Ron Steinfeld, Shi-Feng Sun
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_24
Related Items (25)
FO-like combiners and hybrid post-quantum cryptography ⋮ Post-quantum security of the Even-Mansour cipher ⋮ On IND-qCCA security in the ROM and its applications. CPA security is sufficient for TLS 1.3 ⋮ Post-quantum anonymity of Kyber ⋮ QCCA-secure generic transformations in the quantum random oracle model ⋮ A lightweight identification protocol based on lattices ⋮ An injectivity analysis of Crystals-Kyber and implications on quantum security ⋮ Implicit rejection in Fujisaki-Okamoto: framework and a novel realization ⋮ KDM security for the Fujisaki-Okamoto transformations in the QROM ⋮ Group action key encapsulation and non-interactive key exchange in the QROM ⋮ IND-CCA security of Kyber in the quantum random oracle model, revisited ⋮ The power of undirected rewindings for adaptive security ⋮ 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 ⋮ Fault-injection attacks against NIST's post-quantum cryptography round 3 KEM candidates ⋮ Sponge-based authenticated encryption: security against quantum attackers ⋮ Failing gracefully: decryption failures and the Fujisaki-Okamoto transform ⋮ Tighter QCCA-secure key encapsulation mechanism with explicit rejection in the quantum random oracle model ⋮ CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors ⋮ Scalable ciphertext compression techniques for post-quantum KEMs and their applications ⋮ Quantum key-length extension ⋮ 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 ⋮ On the integer polynomial learning with errors problem
Cites Work
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- On the bit security of cryptographic primitives
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- A modular analysis of the Fujisaki-Okamoto transformation
- NTRU prime: reducing attack surface at low cost
- Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
- Tighter proofs of CCA security 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
- (Tightly) QCCA-secure key-encapsulation mechanism in the quantum random oracle model
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- Quantum Proofs of Knowledge
- Zero-knowledge against quantum attacks
- Random Oracles in a Quantum World
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Secure integration of asymmetric and symmetric encryption schemes
- Revocable Quantum Timed-Release Encryption
- Cryptography and Coding
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Measure-rewind-measure: tighter quantum random oracle model proofs for one-way to hiding and CCA security
