A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
From MaRDI portal
Publication:2168799
Recommendations
- An improvement of a ring signature scheme based on lattices
- Practical implementation of Ring-SIS/LWE based signature and IBE
- Applied Cryptography and Network Security
- A lattice-based threshold ring signature scheme
- A Provably Secure Ring Signature Scheme in Certificateless Cryptography
- An efficient ring signature scheme from pairings
- Towards practical lattice-based one-time linkable ring signatures
- Leakage-resilient ring signature schemes
Cites work
- A decade of lattice cryptography
- An improved compression technique for signatures based on learning with errors
- Better key sizes (and attacks) for LWE-based encryption
- BKZ 2.0: Better lattice security estimates
- Bonsai trees, or how to delegate a lattice basis
- Does Fiat-Shamir require a cryptographic hash function?
- Estimate all the \(\{\)LWE, NTRU\(\}\) schemes!
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1942427 (Why is no real title available?)
- scientific article; zbMATH DE number 1962147 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- Lattice signatures and bimodal Gaussians
- Lattice signatures without trapdoors
- Lattice-based Cryptography
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- New Algorithms for Learning in Presence of Errors
- Noise-tolerant learning, the parity problem, and the statistical query model
- On ideal lattices and learning with errors over rings
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- Post-quantum cryptography. 5th international workshop, PQCrypto 2013, Limoges, France, June 4--7, 2013. Proceedings
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- Security proofs for signature schemes
- Short Stickelberger class relations and application to Ideal-SVP
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(5)- Digital signatures from the middle-product LWE
- An improved compression technique for signatures based on learning with errors
- scientific article; zbMATH DE number 2230905 (Why is no real title available?)
- A Compact Digital Signature Scheme Based on the Module-LWR Problem
- A new R-LWE based digital signature scheme
This page was built for publication: A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168799)