Zero-Knowledge Interactive Proof Systems for New Lattice Problems
From MaRDI portal
Publication:3460104
DOI10.1007/978-3-319-27239-9_9zbMath1376.94030OpenAlexW2398403423MaRDI QIDQ3460104
Claude Crépeau, Raza Ali Kazmi
Publication date: 12 January 2016
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-27239-9_9
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational points on the unit sphere
- Fast computation of Hermite normal forms of random integer matrices
- Does co-NP have short interactive proofs ?
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Bonsai Trees, or How to Delegate a Lattice Basis
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- The Knowledge Complexity of Interactive Proof Systems
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- The Generation of All Rational Orthogonal Matrices
- Foundations of Cryptography
- Is code equivalence easy to decide?
- The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
- Advances in Cryptology - CRYPTO 2003
- Choosing a Point from the Surface of a Sphere
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Zero-Knowledge Interactive Proof Systems for New Lattice Problems
