(One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
From MaRDI portal
Publication:2055644
DOI10.1007/978-3-030-45727-3_1zbMath1479.94152OpenAlexW3021345027MaRDI QIDQ2055644
Mélissa Rossi, Jan-Pieter D'Anvers, Fernando Virdia
Publication date: 1 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-45727-3_1
Related Items (9)
SoK: how (not) to design and implement post-quantum cryptography ⋮ How to meet ternary LWE keys ⋮ More accurate geometric analysis on the impact of successful decryptions for IND-CCA secure Ring/Mod-LWE/LWR based schemes ⋮ Multitarget Decryption Failure Attacks and Their Application to Saber and Kyber ⋮ \texttt{POLKA}: towards leakage-resistant post-quantum CCA-secure public key encryption ⋮ Exploring decryption failures of BIKE: new class of weak keys and key recovery attacks ⋮ Failing gracefully: decryption failures and the Fujisaki-Okamoto transform ⋮ Revisiting security estimation for LWE with hints from a geometric perspective ⋮ A new decryption failure attack against HQC
Cites Work
- On the concrete hardness of learning with errors
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Tightly-secure key-encapsulation mechanism in the quantum random oracle model
- Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
- A modular analysis of the Fujisaki-Okamoto transformation
- Secure integration of asymmetric and symmetric encryption schemes
- Decryption failure attacks on IND-CCA secure lattice-based schemes
- Misuse attacks on post-quantum cryptosystems
- The impact of error dependencies on Ring/Mod-LWE/LWR based schemes
- Worst-case to average-case reductions for module lattices
- Revisiting the expected cost of solving uSVP and applications to LWE
- Distributions of Angles in Random Packing on Spheres
- BKZ 2.0: Better Lattice Security Estimates
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- On Ideal Lattices and Learning with Errors over Rings
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- Efficient Public Key Encryption Based on Ideal Lattices
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - CRYPTO 2003
- Cryptography and Coding
- New Chosen-Ciphertext Attacks on NTRU
- On lattices, learning with errors, random linear codes, and cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
