Concurrent general composition of secure protocols in the timing model
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
An improved semantically-secure identity-based signcryption scheme in the standard model
Computers and Electrical Engineering
Short 2-move undeniable signatures
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
On round-efficient argument systems
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient signcryption without random oracles
ATC'06 Proceedings of the Third international conference on Autonomic and Trusted Computing
Composition of zero-knowledge proofs with efficient provers
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Resettable cryptography in constant rounds --- the case of zero knowledge
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Resettable statistical zero knowledge
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Communication efficient shuffle for mental poker protocols
Information Sciences: an International Journal
Trapdoor permutation polynomials of Z/nZ and public key cryptosystems
ISC'07 Proceedings of the 10th international conference on Information Security
A note on constant-round concurrent zero-knowledge arguments of knowledge for NP
IDCS'12 Proceedings of the 5th international conference on Internet and Distributed Computing Systems
Why “fiat-shamir for proofs” lacks a proof
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
| Hi-index | 0.00 |
We show new lower bounds and impossibility results for general (possibly non-black-box) zero-knowledge proofs and arguments. Our main results are that, under reasonable complexity assumptions:1. There does not exist a constant-round zero-knowledge strong proof (or argument) of knowledge (as defined by Goldreich (2001)) for a nontrivial language.2. There does not exist a two-round zero-knowledge proof system with perfect completeness for an NP-complete language.The previous impossibility result for two-round zero knowledge, by Goldreich and Oren (J. Cryptology, 1994) was only for the case of auxiliary-input zero-knowledge proofs and arguments.3. There does not exist a constant-round public-coin proof system for a nontrivial language that is resettable zero knowledge. This result also extends to bounded resettable zero knowledge.In contrast, we show that under reasonable assumptions, there does exist such a (computationally sound) argument system that is bounded-resettable zero knowledge.The complexity assumptions we use are not commonly used in cryptography. However, in all cases, we show that assumptions like ours are necessary for the above results.Most previously known lower bounds, such as those of Goldreich and Krawczyk (SIAM J. Computing, 1996), were only for black-box zero knowledge. However, a result of Barak (FOCS 2001) shows that many (or even most) of these black-box lower bounds do not extend to the case of general zero knowledge.