Skip to main content
Conference Proceedings

The complexity of zero knowledge

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4855 LNCS 52-70
DOI: 10.1007/978-3-540-77050-3_5
4Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give an informal introduction to zero-knowledge proofs, and survey their role both in the interface between complexity theory and cryptography and as objects of complexity-theoretic study in their own right. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Vadhan, S. (2007). The complexity of zero knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4855 LNCS, pp. 52–70). Springer Verlag. https://doi.org/10.1007/978-3-540-77050-3_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