Next: Lower Bounds for Linear
Up: Back at Weizmann (1998-2003)
Previous: On interactive proofs with
This work introduces resettably-sound proofs and arguments,
which are protocols that maintain their soundness
even when the prover can reset the verifier to use
the same random coins in repeated executions of the protocol.
It shows that resettably-sound zero-knowledge arguments for NP
exist if collision-free hashing functions exist,
whereas resettably-sound zero-knowledge proofs
are possible only for languages in P/poly.
Comments:
Authored by B. Barak, O. Goldreich, S. Goldwasser and Y. Lindell. Appeared in
- Proceedings of 42nd FOCS, pages 116-125, 2001.
Oded Goldreich
2003-07-30