Modular lattice signatures, revisited
From MaRDI portal
Publication:2302153
DOI10.1007/S10623-019-00694-XzbMATH Open1448.94239OpenAlexW2983029985WikidataQ126800224 ScholiaQ126800224MaRDI QIDQ2302153FDOQ2302153
Authors: Dipayan Das, Jeff Hoffstein, Jill Pipher, William Whyte, Zhenfei Zhang 
Publication date: 25 February 2020
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-019-00694-x
Recommendations
Cites Work
- BKZ 2.0: Better lattice security estimates
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice signatures without trapdoors
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Predicting Lattice Reduction
- Lattice signatures and bimodal Gaussians
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Title not available (Why is that?)
- Lattice enumeration using extreme pruning
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Efficient identity-based encryption over NTRU lattices
- Lattice cryptography for the internet
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Transcript secure signatures based on modular lattices
- Hardness of SIS and LWE with small parameters
- Tuple lattice sieving
- A hybrid lattice basis reduction and quantum search attack on LWE
- Authenticated key exchange from ideal lattices
- Choosing parameters for NTRUEncrypt
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
Cited In (8)
- Lattice-based linearly homomorphic signatures in the standard model
- Modular forms for the even modular lattice of signature (2,10)
- Shorter hash-and-sign lattice-based signatures
- Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction
- Transcript secure signatures based on modular lattices
- Lattice signatures and bimodal Gaussians
- On modular decompositions of system signatures
- Using Freivalds' algorithm to accelerate lattice-based signature verifications
Uses Software
This page was built for publication: Modular lattice signatures, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302153)
