Concrete security from worst-case to average-case lattice reductions
From MaRDI portal
Publication:6186360
DOI10.1007/978-3-031-37679-5_15MaRDI QIDQ6186360
Publication date: 2 February 2024
Published in: Progress in Cryptology - AFRICACRYPT 2023 (Search for Journal in Brave)
provable securitypublic key cryptographylattice-based cryptographypost-quantum cryptographylearning with errors
Quantum computation (81P68) Cryptography (94A60) Lattices and convex bodies (number-theoretic aspects) (11H06)
Cites Work
- On the Poisson distribution of lengths of lattice vectors in a random lattice
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- New bounds in some transference theorems in the geometry of numbers
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- A modular analysis of the Fujisaki-Okamoto transformation
- Estimate all the {LWE, NTRU} schemes!
- Secure integration of asymmetric and symmetric encryption schemes
- Verifying solutions to LWE with implications for concrete security
- Worst-case to average-case reductions for module lattices
- Another look at tightness. II: Practical issues in cryptography
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- The Number of Lattice Points in a Set
- On Ideal Lattices and Learning with Errors over Rings
- Lattice-based Cryptography
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
- On lattices, learning with errors, random linear codes, and cryptography
- Lattice Sieving via Quantum Random Walks
This page was built for publication: Concrete security from worst-case to average-case lattice reductions
