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.
Chapter PDF
Similar content being viewed by others
References
M. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, 1979.
O. Goldreich, S. Micali, and A. Widgerson. Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. J. ACM Vol. 38, pp. 691–729, 1991.
Harry R. Lewis and Christos H. Papadimitriou. Elements of the theory of Computation. Prentice-Hall, 1981.
K. R. Reischuk. Einführung in die Komplexitätstheorie. Teubner, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biehl, I., Buchmann, J., Meyer, B., Thiel, C., Thiel, C. (1993). Tools for Proving Zero Knowledge. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_29
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive