Modular lattice signatures, revisited

DOI10.1007/S10623-019-00694-XMaRDI QIDQ2302153zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

NTRUlattice based signaturesmodular lattice signature

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Lattice signatures and bimodal Gaussians
• Transcript secure signatures based on modular lattices
• Shorter hash-and-sign lattice-based signatures
• Lattice signatures without trapdoors
• Sealing the leak on classical NTRU signatures

Cites work

• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1256737 (Why is no real title available?)
• scientific article; zbMATH DE number 1088230 (Why is no real title available?)
• scientific article; zbMATH DE number 1962147 (Why is no real title available?)
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• A Subfield Lattice Attack on Overstretched NTRU Assumptions
• A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
• A hybrid lattice basis reduction and quantum search attack on LWE
• Authenticated key exchange from ideal lattices
• BKZ 2.0: Better lattice security estimates
• Choosing parameters for NTRUEncrypt
• Efficient identity-based encryption over NTRU lattices
• Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
• Hardness of SIS and LWE with small parameters
• Lattice cryptography for the internet
• Lattice enumeration using extreme pruning
• Lattice signatures and bimodal Gaussians
• Lattice signatures without trapdoors
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
• Predicting Lattice Reduction
• Transcript secure signatures based on modular lattices
• Trapdoors for hard lattices and new cryptographic constructions
• Tuple lattice sieving
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

Cited in

(10)

• On modular decompositions of system signatures
• Modular forms for the even modular lattice of signature (2,10)
• Transcript secure signatures based on modular lattices
• Lattice-based linearly homomorphic signatures in the standard model
• Lattice signatures and bimodal Gaussians
• Fiat-Shamir signatures based on module-NTRU
• Using Freivalds' algorithm to accelerate lattice-based signature verifications
• Batch signatures, revisited
• Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction
• Shorter hash-and-sign lattice-based signatures

Describes a project that uses

Uses Software

• BLISS
• BKZ
• NTRU
• NTRUSign
• Falcon
• GitHub

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)