Abstract
We introduce the notion of robust transformations of interactive proof systems. A robust transformation takes an interactive proof system (P, V), and produces a new interactive proof system, (P*, V*), such that the power of P* is within a polynomial factor of that of P. We show that, given an ideal protocol for secure circuit evaluation, there exists a robust transformation that converts interactive proof systems to zero-knowledge interactive proof systems.
Supported by an NSF Postdoctoral Fellowship. Some of the writing up of these results supported by Bell Communications.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. Chaum, I. Damgard, and J. van de Graaf. Multiparty Computations Ensuring Secrecy of Each Party’s Input and Correctness of the Output, Proc. CRYPTO85, Springer-Verlag, 1986, 477–488.
O. Goldreich, Y. Mansour, and M. Sipser. Interactive Proof Systems: Provers that never fail and random selection. Proc. FOCS87.
S. Goldwasser and M. Sipser. On public versus private coins in interactive proof systems. Proc. STOC86.
R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random Generation from One-Way Functions, Proc. STOC89
R. Impagliazzo and M. Yung. Direct Minimum-Knowledge Computation, Proc. of CRYPTO87.
J. Kilian. Founding Cryptography on Oblivious Transfer, Proc. of STOC88. Personal Communication.
M. Naor Pseudorandomness and Bit Commitment, Proc. of Crypto89.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kilian, J. (1991). Achieving Zero-Knowledge Robustly. In: Menezes, A.J., Vanstone, S.A. (eds) Advances in Cryptology-CRYPTO’ 90. CRYPTO 1990. Lecture Notes in Computer Science, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-38424-3_23
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54508-8
Online ISBN: 978-3-540-38424-3
eBook Packages: Springer Book Archive