Skip to main content
Conference ProceedingsOPEN ACCESS

Tools for proving zero knowledge

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 658 LNCS 356-365
DOI: 10.1007/3-540-47555-9_29
1Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We develop general techniques that can be used to prove the zero knowledge property of most of the known zero knowledge protocols. Those techniques consist in reducing the circuit indistinguishability of the output distributions of two probabilistic Turing machines to the indistinguishability of the output distributions of certain subroutines.

Cite

CITATION STYLE

APA

Biehl, I., Buchmann, J., Meyer, B., Thiel, C., & Thiel, C. (1993). Tools for proving zero knowledge. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 658 LNCS, pp. 356–365). Springer Verlag. https://doi.org/10.1007/3-540-47555-9_29

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