Decryption failure is more likely after success

DOI10.1007/978-3-030-44223-1_12MaRDI QIDQ5041221zbMATH OpenOpenAlexFDO

Authors Nina Bindel, John M. Schanck

Publication date 13 October 2022

Published in Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-44223-1_12

zbMATH Keywords

decryption failurelattice-based cryptographypublic-key cryptography

Mathematics Subject Classification ID

Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• Decryption failure attacks on IND-CCA secure lattice-based schemes
• (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
• 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
• Tight Analysis of Decryption Failure Probability of Kyber in Reality

Cites work

• A modular analysis of the Fujisaki-Okamoto transformation
• Better key sizes (and attacks) for LWE-based encryption
• Cryptography and Coding
• Decryption failure attacks on IND-CCA secure lattice-based schemes
• New directions in nearest neighbor searching with applications to lattice sieving
• On constant-time QC-MDPC decoders with negligible failure rate
• On lattices, learning with errors, random linear codes, and cryptography
• Secure integration of asymmetric and symmetric encryption schemes
• Secure integration of asymmetric and symmetric encryption schemes
• Trapdoors for hard lattices and new cryptographic constructions

Cited in

(15)

• (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
• More accurate geometric analysis on the impact of successful decryptions for IND-CCA secure Ring/Mod-LWE/LWR based schemes
• Decryption failure attacks on IND-CCA secure lattice-based schemes
• CCA-secure (puncturable) KEMs from encryption with non-negligible decryption errors
• On symmetric encryption with distinguishable decryption failures
• Multitarget decryption failure attacks and their application to Saber and Kyber
• Efficient computation of tight approximations to Chernoff bounds
• 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
• Tight Analysis of Decryption Failure Probability of Kyber in Reality
• Do Not Bound to a Single Position: Near-Optimal Multi-positional Mismatch Attacks Against Kyber and Saber
• Provable security against decryption failure attacks from LWE
• A note on \textit{failing gracefully}: completing the picture for explicitly rejecting Fujisaki-Okamoto transforms using worst-case correctness
• Optimizing variance for reliability decryption in NTRUEncrypt

Describes a project that uses

Uses Software

• Backflip

This page was built for publication: Decryption failure is more likely after success

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041221)