Conference Proceedings

Which languages have 4-round zero-knowledge proofs?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 4948 LNCS 73-88
DOI: 10.1007/978-3-540-78524-8_5
20Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show that if a language L has a 4-round, black-box, computational zero-knowledge proof system with negligible soundness error, then . Assuming the polynomial hierarchy does not collapse, this means in particular that NP-complete languages do not have 4-round zero-knowledge proofs (at least with respect to black-box simulation). © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Katz, J. (2008). Which languages have 4-round zero-knowledge proofs? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4948 LNCS, pp. 73–88). Springer Verlag. https://doi.org/10.1007/978-3-540-78524-8_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free