Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More

@inproceedings{Micciancio2003StatisticalZP,
title={Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More},
author={Daniele Micciancio and Salil P. Vadhan},
booktitle={CRYPTO},
year={2003}
}

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… CONTINUE READING