Sciweavers

98
Voted
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
15 years 17 days ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan