(One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
type: Item
instance of: scholarly article
title: (One) failure is not an option: bootstrapping the search for failures in lattice-based encryption schemes
zbMATH Open document ID: 1479.94152
DOI: 10.1007/978-3-030-45727-3_1
author: Jan-Pieter D'Anvers
author: Mélissa Rossi
author: Fernando Virdia
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436939
zbMATH Keywords: cryptanalysis
zbMATH Keywords: lattice-based cryptography
zbMATH Keywords: reaction attacks
zbMATH Keywords: decryption errors
MaRDI profile type: Publication
full work available at URL: 978-3-030-45727-3 1
OpenAlex ID: W3021345027
cites work: Revisiting the expected cost of solving uSVP and applications to LWE
cites work: On the concrete hardness of learning with errors
cites work: Misuse attacks on post-quantum cryptosystems
cites work: An Improved Compression Technique for Signatures Based on Learning with Errors
cites work: Distributions of Angles in Random Packing on Spheres
cites work: BKZ 2.0: Better Lattice Security Estimates
cites work: Decryption failure attacks on IND-CCA secure lattice-based schemes
cites work: Saber: module-LWR based key exchange, CPA-secure encryption and CCA-secure KEM
cites work: The impact of error dependencies on Ring/Mod-LWE/LWR based schemes
cites work: Cryptography and Coding
cites work: New directions in cryptography
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Secure integration of asymmetric and symmetric encryption schemes
cites work: New Chosen-Ciphertext Attacks on NTRU
cites work: Q4228473
cites work: A modular analysis of the Fujisaki-Okamoto transformation
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q4536792
cites work: Q4315010
cites work: Q5310362
cites work: Worst-case to average-case reductions for module lattices
cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: Q3997653
cites work: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Tightly-secure key-encapsulation mechanism in the quantum random oracle model
cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems
cites work: Efficient Public Key Encryption Based on Ideal Lattices
cites work: Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
description: scientific article; zbMATH DE number 7436939