Asymptotically efficient lattice-based digital signatures

DOI10.1007/s00145-017-9270-zzbMath1400.94165OpenAlexW2765992405MaRDI QIDQ2413615

Daniele Micciancio, Vadim Lyubashevsky

Publication date: 14 September 2018

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00145-017-9270-z

zbMATH Keywords

digital signatureslattice cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

Lattice-based public-key encryption with equality test supporting flexible authorization in standard model ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ A framework for practical anonymous credentials from lattices ⋮ Chosen-ciphertext lattice-based public key encryption with equality test in standard model ⋮ Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles

Uses Software

• BLISS
• ring-LWE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line/off-line digital signatures
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Efficient cryptographic schemes provably as secure as subset sum
• Hardness of SIS and LWE with Small Parameters
• Lattice Signatures and Bimodal Gaussians
• Lattice Signatures without Trapdoors
• Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
• Lattice-Based Blind Signatures
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• Trapdoors for hard lattices and new cryptographic constructions
• On Ideal Lattices and Learning with Errors over Rings
• Generalized Compact Knapsacks Are Collision Resistant
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• New directions in cryptography
• The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
• A Toolkit for Ring-LWE Cryptography
• Adapting Lyubashevsky’s Signature Schemes to the Ring Signature Setting
• Advances in Cryptology - EUROCRYPT 2004
• An Improved Compression Technique for Signatures Based on Learning with Errors
• Lattice-Based Identification Schemes Secure Under Active Attacks
• Asymptotically Efficient Lattice-Based Digital Signatures
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Theory of Cryptography
• Noise-tolerant learning, the parity problem, and the statistical query model

This page was built for publication: Asymptotically efficient lattice-based digital signatures