Resettable zero-knowledge (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Concurrent Zero Knowledge with Logarithmic Round-Complexity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Soundness in the Public-Key Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Min-round Resettable Zero-Knowledge in the Public-Key Model
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Resettably-Sound Zero-Knowledge and its Applications
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
How to Go Beyond the Black-Box Simulation Barrier
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Lower Bounds for Non-Black-Box Zero Knowledge
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the (Im)possibility of Cryptography with Imperfect Randomness
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Information Security and Cryptology
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
On the concurrent composition of zero-knowledge proofs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Resettable zero-knowledge in the weak public-key model
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Simultaneously resettable arguments of knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On round-optimal zero knowledge in the bare public-key model
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Public-Coin concurrent zero-knowledge in the global hash model
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Implementing resettable UC-Functionalities with untrusted tamper-proof hardware-tokens
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
On the impossibility of approximate obfuscation and applications to resettable cryptography
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line of works was initiated by Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) who introduced the notion of resettable zero-knowledge, 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 setting where the verifier uses a fixed random tape in multiple interactions. Subsequent to these works, a number of papers studied the notion of resettable protocols in the setting where only one of the participating parties uses a fixed random tape multiple times. The notion of resettable security has been studied in two main models: the plain model and the bare public key model (also introduced in the above paper by Canetti et. al.). In a recent work, Deng, Goyal and Sahai (FOCS 2009) gave the first construction of a simultaneous resettable zero-knowledge protocol where both participants of the protocol can reuse a fixed random tape in any (polynomial) number of executions. Their construction however required O(nε) rounds of interaction between the prover and the verifier. Both in the plain as well as the BPK model, this construction remain the only known simultaneous resettable zero-knowledge protocols. In this work, we study the question of round complexity of simultaneous resettable zero-knowledge in the BPK model. We present a constant round protocol in such a setting based on standard cryptographic assumptions. Our techniques are significantly different from the ones used by Deng, Goyal and Sahai.