A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More
[chapter]

2003
*
Lecture Notes in Computer Science
*

We construct several new statistical zero-knowledge proofs with efficient provers, i.e. ones where the prover strategy runs in probabilistic polynomial time given an NP witness for the input string. Our first proof systems are for approximate versions of the Shortest Vector Problem (SVP) and Closest Vector Problem (CVP), where the witness is simply a short vector in the lattice or a lattice vector close to the target, respectively. Our proof systems are in fact proofs of knowledge, and as a

doi:10.1007/978-3-540-45146-4_17
fatcat:wkzbwwspgzfflhwq7vdvuxxzyy