Tighter proofs of CCA security in the quantum random oracle model
From MaRDI portal
Publication:2175932
Recommendations
- QCCA-secure generic key encapsulation mechanism with tighter security in the quantum random oracle model
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- (Tightly) QCCA-secure key-encapsulation mechanism in the quantum random oracle model
- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
- Tighter security proofs for generic key encapsulation mechanism 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 2003
- 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?)
- 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
- On the bit security of cryptographic primitives
- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Quantum security proofs using semi-classical oracles
- Random oracles in a quantum world
- Revocable Quantum Timed-Release Encryption
- Secure integration of asymmetric and symmetric encryption schemes
- 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
Cited in
(63)- 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
- Generic authenticated key exchange in the quantum random oracle model
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- QCCA-secure generic key encapsulation mechanism with tighter security in the quantum random oracle model
- On the integer polynomial learning with errors problem
- On tight quantum security of HMAC and NMAC in the quantum random oracle model
- 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
- Online-extractability in the quantum random-oracle model
- SO-CCA secure PKE in the quantum random oracle model or the quantum ideal cipher 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
- 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
- Iterated random oracle: a universal approach for finding loss in security reduction
- Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security
- Tighter security proofs for GPV-IBE in the quantum random oracle model
- 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
- Chosen-ciphertext secure code-based threshold public key encryptions with short ciphertext
- Group action key encapsulation and non-interactive key exchange in the QROM
- IND-CCA security of Kyber in the quantum random oracle model, revisited
- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model
- 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
- Watermarking PRFs and PKE against quantum adversaries
- Two-message authenticated key exchange from public-key encryption
- Power of randomness recovery: tighter CCA-secure KEM in the QROM
- NEV: faster and smaller NTRU encryption using vector decoding
- Post-quantum security of key encapsulation mechanism against CCA attacks with a single decapsulation query
- \textsf{SMAUG}: pushing lattice-based key encapsulation mechanisms to the limits
- Probabilistic hash-and-sign with retry in the quantum random oracle model
- The NISQ complexity of collision finding
- Formally verifying Kyber. Episode V: machine-checked IND-CCA security and correctness of ML-KEM in Easycrypt
- Provable security against decryption failure attacks from LWE
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
- The security of ML-DSA against fault-injection attacks
- Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
- Verifiable decapsulation: recognizing faulty implementations of post-quantum KEMs
- Hybrid password authentication key exchange in the UC framework
- (Un)breakable curses -- re-encryption in the Fujisaki-Okamoto transform
- Kleptographic attacks against implicit rejection
- 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
- CPA-secure KEMS are also sufficient for post-quantum TLS 1.3
- Treating dishonest ciphertexts in post-quantum KEMs -- explicit vs. implicit rejection in the FO transform
- QCCA security of Fujisaki-Okamoto transformation in the quantum random oracle model
- A note on \textit{failing gracefully}: completing the picture for explicitly rejecting Fujisaki-Okamoto transforms using worst-case correctness
- Higher-genus McEliece
- Nonadaptive one-way to hiding implies adaptive quantum reprogramming
- On the -spreadness of average-case to worst-case transformations
- Post-quantum TLS 1.3 handshake from CPA-secure KEMs with tighter reductions
- Non-adaptive one-way to hiding not only implies adaptive quantum reprogramming, but also does better
This page was built for publication: Tighter proofs of CCA security 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 Q2175932)
