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
Black-box concurrent zero-knowledge requires \tilde {Ω} (logn) rounds
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
2-round zero knowledge and proof auditors
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Concurrent zero-knowledge with timing, revisited
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Adaptively secure distributed public-key systems
Theoretical Computer Science
More Efficient Password-Authenticated Key Exchange
CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
On Concurrent Zero-Knowledge with Pre-processing
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Adaptive Security for Threshold Cryptosystems
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
A Note on the Round-Complexity of Concurrent Zero-Knowledge
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Two-Party Generation of DSA Signatures
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
Never Trust Victor: An Alternative Resettable Zero-Knowledge Proof System
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Responsive Round Complexity and Concurrent Zero-Knowledge
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Adaptively-Secure Distributed Public-Key Systems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Bounded-concurrent secure two-party computation without setup assumptions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
On the concurrent composition of zero-knowledge proofs
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Simulatable commitments and efficient concurrent zero-knowledge
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
The round-complexity of black-box zero-knowledge: a combinatorial characterization
TCC'08 Proceedings of the 5th conference on Theory of cryptography
On constant-round concurrent zero-knowledge
TCC'08 Proceedings of the 5th conference on Theory of cryptography
An efficient compiler from Σ-protocol to 2-move deniable zero-knowledge
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Eye for an eye: efficient concurrent zero-knowledge in the timing model
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Impossibility and feasibility results for zero knowledge with public keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Concurrent zero-knowledge with timing, revisited
Theoretical Computer Science
Concurrent zero knowledge without complexity assumptions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
The knowledge tightness of parallel zero-knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Simultaneously resettable arguments of knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
On the Composition of Public-Coin Zero-Knowledge Protocols
SIAM Journal on Computing
| Hi-index | 0.00 |
We consider zero knowledge interactive proofs in a richer, more realistic communication environment. In this setting, one may simultaneously engage in many interactive proofs, and these proofs may take place in an asynchronous fashion. It is known that zero-knowledge is not necessarily preserved in such an environment; we show that for a large class of protocols, it cannot be preserved. Any 4 round (computational) zero-knowledge interactive proof (or argument) for a non-trivial language L is not black-box simulatable in the asynchronous setting.