Lower bounds for non-black-box zero knowledge

B. Barak; Y. Lindell; S. Vadhan

doi:10.1109/sfcs.2003.1238212

Lower bounds for non-black-box zero knowledge

B. Barak, Y. Lindell, S. Vadhan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

10 Scopus citations

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.

Original language	English
Title of host publication	Proceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003
Publisher	IEEE Computer Society
Pages	384-393
Number of pages	10
ISBN (Electronic)	0769520405
DOIs	https://doi.org/10.1109/sfcs.2003.1238212
State	Published - 2003
Externally published	Yes
Event	44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003 - Cambridge, United States Duration: 11 Oct 2003 → 14 Oct 2003

Publication series

Name	Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Volume	2003-January
ISSN (Print)	0272-5428

Conference

Conference	44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003
Country/Territory	United States
City	Cambridge
Period	11/10/03 → 14/10/03

Bibliographical note

Publisher Copyright:
© 2003 IEEE.

Funding

Funders	Funder number
National Science Foundation	CCR-0133096, CCR-0205423

Keywords

Access protocols
Computer science
Cryptography

Access to Document

10.1109/sfcs.2003.1238212

Cite this

Barak, B., Lindell, Y., & Vadhan, S. (2003). Lower bounds for non-black-box zero knowledge. In Proceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003 (pp. 384-393). Article 1238212 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 2003-January). IEEE Computer Society. https://doi.org/10.1109/sfcs.2003.1238212

@inproceedings{a840ad9d5ec443c0baad561bf89533a0,

title = "Lower bounds for non-black-box zero knowledge",

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.",

keywords = "Access protocols, Computer science, Cryptography",

author = "B. Barak and Y. Lindell and S. Vadhan",

note = "Publisher Copyright: {\textcopyright} 2003 IEEE.; 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003 ; Conference date: 11-10-2003 Through 14-10-2003",

year = "2003",

doi = "10.1109/sfcs.2003.1238212",

language = "אנגלית",

series = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

publisher = "IEEE Computer Society",

pages = "384--393",

booktitle = "Proceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003",

address = "ארצות הברית",

}

Barak, B, Lindell, Y & Vadhan, S 2003, Lower bounds for non-black-box zero knowledge. in Proceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003., 1238212, Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, vol. 2003-January, IEEE Computer Society, pp. 384-393, 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003, Cambridge, United States, 11/10/03. https://doi.org/10.1109/sfcs.2003.1238212

Lower bounds for non-black-box zero knowledge. / Barak, B.; Lindell, Y.; Vadhan, S.
Proceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003. IEEE Computer Society, 2003. p. 384-393 1238212 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 2003-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Lower bounds for non-black-box zero knowledge

AU - Barak, B.

AU - Lindell, Y.

AU - Vadhan, S.

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - Access protocols

KW - Computer science

KW - Cryptography

UR - http://www.scopus.com/inward/record.url?scp=36549018406&partnerID=8YFLogxK

U2 - 10.1109/sfcs.2003.1238212

DO - 10.1109/sfcs.2003.1238212

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:36549018406

T3 - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

SP - 384

EP - 393

BT - Proceedings - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003

PB - IEEE Computer Society

T2 - 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2003

Y2 - 11 October 2003 through 14 October 2003

ER -

Lower bounds for non-black-box zero knowledge

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this