Asymptotically Efficient Lattice-Based Digital Signatures
From MaRDI portal
Recommendations
Cites work
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A sieve algorithm for the shortest lattice vector problem
- Advances in Cryptology - EUROCRYPT 2004
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- Bounds on the Efficiency of Generic Cryptographic Constructions
- Fail-Stop Signatures
- Generalized Compact Knapsacks Are Collision Resistant
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- scientific article; zbMATH DE number 5485483 (Why is no real title available?)
- scientific article; zbMATH DE number 708796 (Why is no real title available?)
- scientific article; zbMATH DE number 1759322 (Why is no real title available?)
- scientific article; zbMATH DE number 2196508 (Why is no real title available?)
- Lattice problems in NP ∩ coNP
- New directions in cryptography
- On Polynomial-Factor Approximations to the Shortest Lattice Vector Length
- On the limits of nonapproximability of lattice problems
- On-line/off-line digital signatures
- Optimal tree-based one-time digital signature schemes
- Secure Hash-and-Sign Signatures Without the Random Oracle
- SWIFFT: A Modest Proposal for FFT Hashing
- The Provable Security of Graph-Based One-Time Signatures and Extensions to Algebraic Signature Schemes
- Theory of Cryptography
Cited in
(48)- Efficient lattice-based signature scheme
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- An efficient homomorphic aggregate signature scheme based on lattice
- Security analysis of cryptosystems using short generators over ideal lattices
- Bonsai trees, or how to delegate a lattice basis
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Implementation of lattice trapdoors on modules and applications
- On the higher-bit version of approximate inhomogeneous short integer solution problem
- Cryptanalysis of a code-based one-time signature
- PCPs and the hardness of generating synthetic data
- Efficient public-key encryption with equality test from lattices
- Post-quantum cryptography: lattice signatures
- Asymptotically efficient lattice-based digital signatures
- Lattice-based completely non-malleable public-key encryption in the standard model
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption
- Post-quantum forward-secure onion routing (future anonymity in today's budget)
- An efficient post-quantum one-time signature scheme
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Lattice signatures and bimodal Gaussians
- Improved short lattice signatures in the standard model
- Lattice signatures without trapdoors
- Lattice Point Enumeration on Block Reduced Bases
- Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings
- Identity-based blind signature from lattices in standard model
- Policy-based signature scheme from lattices
- One-time signatures and chameleon hash functions
- The geometry of lattice cryptography
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Programmable hash functions and their applications
- On ideal lattices, Gröbner bases and generalized hash functions
- Identity-based blind signature from lattices
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Improved Zero-Knowledge Identification with Lattices
- LLL for ideal lattices: re-evaluation of the security of Gentry-Halevi's FHE scheme
- Lattice-based linearly homomorphic signature scheme over binary field
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- scientific article; zbMATH DE number 7407285 (Why is no real title available?)
- Cryptographic functions from worst-case complexity assumptions
- scientific article; zbMATH DE number 7108581 (Why is no real title available?)
- A Digital Signature Scheme Based on CVP ∞
- Lattice attacks on digital signature schemes
- SETLA: Signature and Encryption from Lattices
- Lattice-based programmable hash functions and applications
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- A new R-LWE based digital signature scheme
- \textsf{ABBA}: lattice-based commitments from commutators
- Hash-based multi-signatures for post-quantum Ethereum
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 Q5445497)
