Asymptotically Efficient Lattice-Based Digital Signatures
From MaRDI portal
Publication:5445497
DOI10.1007/978-3-540-78524-8_3zbMath1162.94389OpenAlexW2106121141MaRDI QIDQ5445497
Vadim Lyubashevsky, Daniele Micciancio
Publication date: 5 March 2008
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_3
Related Items
An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption, Policy-based signature scheme from lattices, On the higher-bit version of approximate inhomogeneous short integer solution problem, Post-quantum cryptography: lattice signatures, On ideal lattices, Gröbner bases and generalized hash functions, Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography, Asymptotically efficient lattice-based digital signatures, Bonsai trees, or how to delegate a lattice basis, Lattice Point Enumeration on Block Reduced Bases, Lattice-based programmable hash functions and applications, Programmable hash functions and their applications, PCPs and the hardness of generating synthetic data, Identity-Based Blind Signature from Lattices in Standard Model, An efficient homomorphic aggregate signature scheme based on lattice, Lattice-based completely non-malleable public-key encryption in the standard model, Efficient public-key encryption with equality test from lattices, LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme, Identity-based blind signature from lattices, Security analysis of cryptosystems using short generators over ideal lattices, Improved Zero-Knowledge Identification with Lattices, Cryptographic Functions from Worst-Case Complexity Assumptions, Rigorous and Efficient Short Lattice Vectors Enumeration, Post-Quantum Forward-Secure Onion Routing, An Efficient Post-Quantum One-Time Signature Scheme, One-Time Signatures and Chameleon Hash Functions, Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures, The Geometry of Lattice Cryptography, Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes, A non-PCP approach to succinct quantum-safe zero-knowledge, Lattice-based linearly homomorphic signature scheme over binary field, Implementation of lattice trapdoors on modules and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the limits of nonapproximability of lattice problems
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- On-line/off-line digital signatures
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- SWIFFT: A Modest Proposal for FFT Hashing
- Lattice problems in NP ∩ coNP
- Generalized Compact Knapsacks Are Collision Resistant
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- New directions in cryptography
- Secure Hash-and-Sign Signatures Without the Random Oracle
- Fail-Stop Signatures
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
- On Polynomial-Factor Approximations to the Shortest Lattice Vector Length
- Optimal tree-based one-time digital signature schemes
- A sieve algorithm for the shortest lattice vector problem
- Advances in Cryptology - EUROCRYPT 2004
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Theory of Cryptography
