Asymptotically efficient lattice-based digital signatures
From MaRDI portal
Publication:2413615
DOI10.1007/S00145-017-9270-ZzbMATH Open1400.94165OpenAlexW2765992405MaRDI QIDQ2413615FDOQ2413615
Authors: Vadim Lyubashevsky, Daniele Micciancio 
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
Recommendations
- Asymptotically Efficient Lattice-Based Digital Signatures
- Efficient lattice-based signature scheme
- An efficient lattice-based signature scheme with provably secure instantiation
- Efficient lattice-based certificateless signature scheme
- Improvement and efficient implementation of a lattice-based signature scheme
- Application of the lattice theory to the analysis of digital signature schemes
- Lattice-Based Signatures: Optimization and Implementation on Reconfigurable Hardware
- Lattice-based signatures with tight adaptive corruptions and more
- Lattice attacks on digital signature schemes
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
Cites Work
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- On ideal lattices and learning with errors over rings
- Trapdoors for hard lattices and new cryptographic constructions
- New directions in cryptography
- Title not available (Why is that?)
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Lattice signatures without trapdoors
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Bounds on the Efficiency of Generic Cryptographic Constructions
- On-line/off-line digital signatures
- An Improved Compression Technique for Signatures Based on Learning with Errors
- Lattice Signatures and Bimodal Gaussians
- Lattice-based blind signatures
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Asymptotically Efficient Lattice-Based Digital Signatures
- Efficient cryptographic schemes provably as secure as subset sum
- Generalized Compact Knapsacks Are Collision Resistant
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Theory of Cryptography
- Noise-tolerant learning, the parity problem, and the statistical query model
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
- Title not available (Why is that?)
- A Toolkit for Ring-LWE Cryptography
- Advances in Cryptology - EUROCRYPT 2004
- Title not available (Why is that?)
- Hardness of SIS and LWE with Small Parameters
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Title not available (Why is that?)
- Adapting Lyubashevsky’s Signature Schemes to the Ring Signature Setting
Cited In (23)
- Cryptanalysis of a code-based one-time signature
- Adaptive-ID secure hierarchical ID-based authenticated key exchange under standard assumptions without random oracles
- A framework for practical anonymous credentials from lattices
- Title not available (Why is that?)
- SETLA: Signature and Encryption from Lattices
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Title not available (Why is that?)
- Linkable ring signature scheme with stronger security guarantees
- Lattice attacks on digital signature schemes
- Efficient lattice-based signature scheme
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- Efficient lattice-based blind signatures via Gaussian one-time signatures
- Asymptotically Efficient Lattice-Based Digital Signatures
- Discriminants of number fields
- Lattice-based signatures with tight adaptive corruptions and more
- Lattice signatures without trapdoors
- Fully dynamic attribute-based signatures for circuits from codes
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model
- Post-quantum cryptography: lattice signatures
- Lattice-based public-key encryption with equality test supporting flexible authorization in standard model
Uses Software
This page was built for publication: Asymptotically efficient lattice-based digital signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2413615)
