Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy

Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating verifier can reset the prover and have several interactions in which the prover uses the same random tape. Soon afterwards, Barak, Goldreich, Goldwasser, and Lindell (FOCS 2001) studied the closely related notion of resettable soundness, where the soundness condition of the protocol must hold even if the cheating prover can reset the verifier to have multiple interactions with the same verifier’s random tape. The main problem left open by this work was whether it is possible to have a single protocol that is simultaneously resettable zero knowledge and resettably sound. We resolve this question by constructing such a protocol. At the heart of our construction is a new non-black-box simulation strategy, which we believe to be of independent interest. This new strategy allows for simulators which “marry” re...

• Type: Conference
• Year: 2009
• Where: FOCS
• Authors: Yi Deng, Vipul Goyal, Amit Sahai
• Keywords: FOCS 2009, Non-black-box Simulation, Prover, Random Tape, Theoretical Computer Science