Abstract
Nearly all of the work on constructing zero-knowledge proof systems relies on very strong complexity theoretic assumptions. We consider a form of “no use” zero-knowledge, and show that every language in PSPACE has an interactive proof system that provably achieves “no-use” zero-knowledge against honest verifiers.
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
B. Aeillo and J. Håstad. Perfect zero-knowledge languages can be recognized in two rounds. Proc. FOCS87.
D. Beaver and J. Feigenbaum. Hiding Instances in Multioracle Queries, Proc. of the 7th STACS (1990), Springer Verlag LNCS 415, 37–48.
D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Cryptographic Applications of Locally Random Reductions, AT&T Bell Laboratories Technical Memorandum, November 15, 1989.
M. Ben-Or, O. Goldreich, S. Goldwasser, J. Hastad, J. Kilian, S. Micali, and P. Rogaway. Everything Provable is Provable in Zero-Knowledge, Proc. of CRYPTO88.
R. Boppana, J. Håstad, and S. Zachos. Does CoNP Have Short Interactive Proofs? IPL, 25, May 1987, P′. 127–132.
C. Dwork and L. Stockmeyer, Interactive Proof Systems with Finite-State Verifiers, Proc. CRYPTO88.
L. Fortnow. The Complexity of Perfect Zero-Knowledge. Proc. STOC87.
O. Goldreich and L. Levin, Hardcore predicates from all one-way functions. Proc. STOC89
S. Goldwasser and S. Micali. Probabilistic Encryption, J. Comput. System Sci. 28 (1984), 270–299.
S. Goldwasser, S. Micali, and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. 18 (1989), 186–208.
O. Goldreich, Y. Mansour, and M. Sipser. Interactive Proof Systems: Provers that never fail and random selection. Proc. FOCS87.
O. Goldreich, S. Micali, and A. Wigderson. Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design, Proc. of FOCS86.
Johan Håstad. Manuscript.
R. Impagliazzo, L. Levin, and M. Luby. Pseudo-random Generation from One-Way Fynctions, Proc. STOC89
R. Impagliazzo and M. Yung. Direct Minimum-Knowledge Computation, Proc. of CRYPTO87.
R. Lipton. New Directions in Testing, manuscript, October, 1989.
M. Naor Pseudorandomness and Bit Commitment, Proc. of Crypto89.
R. Ostrovsky, Venkatesan and M. Yung. Manuscript (Submitted to STOC91)
A. Shamir. IP = PSPACE, manuscript, December 26, 1989.
A. Shamir. CRYPTO Rump Session.
A. C. Yao. Protocols for Secure Computations, Proc. of FOCS82.
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). Interactive Proofs with Provable Security against Honest Verifiers. 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_28
Download citation
DOI: https://doi.org/10.1007/3-540-38424-3_28
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