Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography
From MaRDI portal
Publication:5041172
DOI10.1007/978-3-030-45374-9_21zbMath1501.94042OpenAlexW3023978173MaRDI QIDQ5041172
Daniele Micciancio, Chris Peikert, Michael Walter, Nicholas Genise
Publication date: 13 October 2022
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_21
Related Items
Gadget-based iNTRU lattice trapdoors ⋮ Batch-OT with optimal rate ⋮ Towards a Simpler Lattice Gadget Toolkit ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ ABE for DFA from LWE against bounded collusions, revisited ⋮ A \(2^{n/2}\)-time algorithm for \(\sqrt{n} \)-SVP and \(\sqrt{n} \)-Hermite SVP, and an improved time-approximation tradeoff for (H)SVP ⋮ A new post-quantum multivariate polynomial public key encapsulation algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- On the bit security of cryptographic primitives
- Shortest vector from lattice sieving: a few dimensions for free
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Gaussian sampling over the integers: efficient, generic, constant-time
- Estimate all the {LWE, NTRU} schemes!
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Approximate trapdoors for lattices and smaller hash-and-sign signatures
- The general sieve kernel and new records in lattice reduction
- FHE Circuit Privacy Almost for Free
- Hardness of SIS and LWE with Small Parameters
- Lattice Signatures and Bimodal Gaussians
- Discrete Gaussian Leftover Hash Lemma over Infinite Domains
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Efficient Identity-Based Encryption over NTRU Lattices
- Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- A Note on Discrete Gaussian Combinations of Lattice Vectors
- Trapdoors for hard lattices and new cryptographic constructions
- An Efficient and Parallel Gaussian Sampler for Lattices
- New directions in nearest neighbor searching with applications to lattice sieving
- High-Dimensional Probability
- A Toolkit for Ring-LWE Cryptography
- Fully homomorphic encryption using ideal lattices
- Generating Shorter Bases for Hard Random Lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- On lattices, learning with errors, random linear codes, and cryptography
