Barak, B.
Lindell, Y.
Vadhan, S.
Dept. of Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel;
This paper appears in: Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on
Publication Date: 11-14 Oct. 2003
On page(s): 384- 393
ISSN: 0272-5428
ISBN: 0-7695-2040-5
INSPEC Accession Number: 7847064
Posted online: 2003-10-20 13:57:51.0
Abstract
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; 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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
