Abstract
We construct a proof system for any NP statement, in which the proof is a single message sent from the prover to the verifier. No other interaction is required, neither before nor after this single message is sent. In the “envelope” model, the prover sends a sequence of envelopes to the verifier, where each envelope contains one bit of the prover’s proof. It suffices for the verifier to open a constant number of envelopes in order to verify the correctness of the proof (in a probabilistic sense). Even if the verifier opens polynomially many envelopes, the proof remains perfectly zero knowledge.
We transform this proof system to the “known-space verifier” model of De-Santis et al. [7]. In this model it suffices for the verifier to have space S min in order to verify proof, and the proof should remain statistically zero knowledge with respect to verifiers that use space at most S max. We resolve an open question of [7], showing that arbitrary ratios S max/S min are achievable. However, we question the extent to which these proof systems (that of [7] and ours) are really zero knowledge. We do show that our proof system is witness indistinguishable, and hence has applications in cryptographic scenarios such as identification schemes.
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
S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, “Proof Verification and Hardness of Approximation Problems”, 33rd FOCS, 1992, 14–23.
D. Barrington, “Bounded width polynomial size branching programs recognize exactly those languages in NC 1”, 18th STOC, 1986, 1–5.
M. Blum, A. De Santis, S. Micali, G. Persiano, Noninteractive Zero-Knowledge, SIAM Jour. on Computing, Vol. 20, No. 6, December 1991, pp. 1084–1118.
G. Brassard, D. Chaum, C. Crepeau, “Minimum disclosure proofs of knowledge”, JCSS, 37, 1988, 156–189.
A. Condon, “Computational models of games”, MIT Press.
B. Chor, O. Goldreich, “Unbiased bits from sources of weak randomness and probabilistic communication complexity”, SIAM J. of Computing, 1988.
A. De-Santis, G. Persiano, M. Yung, “One-message statistical zero-knowledge proofs with space-bounded verifier”, 19th ICALP, 1992.
C. Dwork, L. Stockmeyer, “Finite state verifiers II: zero knowledge” JACM, 39,4, 1992, 829–858.
U. Feige, A. Fiat, A. Shamir, “Zero Knowledge Proofs of Identity”, Journal of Cryptology, 1988, Vol. 1, pp. 77–94.
U. Feige, A. Shamir, “Zero Knowledge Proofs of Knowledge in Two Rounds”, Advances in Cryptology — CRYPTO’ 89 Proceedings, Lecture Notes in Computer Science, Springer-Verlag 435, pp. 526–544.
U. Feige, A. Shamir, Witness Indistinguishable and Witness Hiding Protocols, Proc. of 22nd ACM Symposium on Theory of Computing, 1990, pp. 416–426.
U. Feige, D. Lapidot, A. Shamir, “Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String” Proc. of 31st FOCS, 1990, pp. 308–317.
O. Goldreich, S. Micali, A. Wigderson, “Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems, Journal of ACM, Vol. 38, No. 1, July 1991, pp. 691–729.
S. Goldwasser, S. Micali, C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, SIAM J. Comput. Vol. 18, No. 1, pp. 186–208, February 1989.
O. Goldreich, H. Krawczyk, “On the composition of zero knowledge proof systems”, 17th ICALP, 1990, 268–282.
J. Kilian, “Uses of randomness in algorithms and protocols”, MIT Press, 1990.
J. Kilian, “Zero knowledge with log space verifiers” 29th FOCS, 1988, 25–35.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aumann, Y., Feige, U. (1994). One Message Proof Systems with Known Space Verifiers. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_8
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive