Abstract
We study perfect zero-knowledge proofs (). Unlike statistical zero-knowledge, where many fundamental questions have been answered, virtually nothing is known about these proofs.
We consider reductions that yield hard and complete problems in the statistical setting. The issue with these reductions is that they introduce errors into the simulation, and therefore they do not yield analogous problems in the perfect setting. We overcome this issue using an error shifting technique. This technique allows us to remove the error from the simulation. Consequently, we obtain the first complete problem for the class of problems possessing non-interactive perfect zero-knowledge proofs (), and the first hard problem for the class of problems possessing public-coin proofs.
We get the following applications. Using the error shifting technique, we show that the notion of zero-knowledge where the simulator is allowed to fail is equivalent to the one where it is not allowed to fail. Using our complete problem, we show that under certain restrictions is closed under the OR operator. Using our hard problem, we show how a constant-round, perfectly hiding instance-dependent commitment may be obtained (this would collapse the round complexity of public-coin proofs to a constant).
Chapter PDF
Similar content being viewed by others
Keywords
References
Aiello, W., Håstad, J.: Statistical zero-knowledge languages can be recognized in two rounds. J. of Computer and System Sciences 42(3), 327–345 (1991)
Babai, L., Moran, S.: Arthur-merlin games: A randomized proof system and a hierarchy of complexity classes. J. of Computer and System Sciences 36, 254–276 (1988)
Bellare, M., Rogaway, P.: Noninteractive perfect zero-knowledge. Unpublished manuscript (June 1990)
Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the ICM, pp. 1444–1451 (1986)
Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge proofs and their applications. In: Proceedings of the 20th STOC, ACM, New York (1988)
Blum, M., Santis, A.D., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM J. Comput. 20(6), 1084–1118 (1991)
Brassard, G., Crépeau, C., Yung, M.: Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds (extended abstract). In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 192–195. Springer, Heidelberg (1990)
Damgård, I.: Interactive hashing can simplify zero-knowledge protocol design without computational assumptions (extended abstract). In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol. 1440, pp. 100–109. Springer, Heidelberg (1999)
Damgård, I., Wigderson, O.G.A.: Hashing functions can simplify zeroknowledge protocol design (too). Technical Report RS-94-39, BRICS (November 1994)
Even, S., Selman, A.L., Yacobi, Y.: The complexity of promise problems with applications to public-key cryptography. Information and Control 61(2), 159–173 (1984)
Fortnow, L.: The complexity of perfect zero-knowledge. In: Micali, S. (ed.) Advances in Computing Research, vol. 5, pp. 327–343. JAC Press, Inc (1989)
Goldreich, O.: Foundations of Cryptography, vol. 1. Cambridge University Press, Cambridge (2001)
Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691–729 (1991)
Goldreich, O., Sahai, A., Vadhan, S.P.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: STOC, pp. 399–408 (1998)
Goldreich, O., Sahai, A., Vadhan, S.P.: Can statistical zero knowledge be made non-interactive? or on the relationship of SZK and NISZK. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, Springer, Heidelberg (1999)
Goldreich, O., Vadhan, S.P.: Comparing entropies in statistical zero-knowledge with applications to the structure of SZK. In: IEEE Conference on Computational Complexity, pp. 54–73 (1999)
Goldwasser, S., Sipser, M.: Private-coins versus public-coins in interactive proof systems. In: Micali, S. (ed.) Advances in Computing Research, vol. 5, pp. 73–90. JAC Press, Inc (1989)
Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186–208 (1989)
Groth, J., Ostrovsky, R., Sahai, A.: Perfect non-interactive zero knowledge for NP. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 339–358. Springer, Heidelberg (2006)
Itoh, T., Ohta, Y., Shizuya, H.: A language-dependent cryptographic primitive. J. Cryptology 10(1), 37–50 (1997)
Kapron, B., Malka, L., Srinivasan, V.: Characterizing non-interactive instance-dependent commitment-schemes (NIC). In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 328–339. Springer, Heidelberg (2007)
Nguyen, M.-H., Ong, S.J., Vadhan, S.: Statistical zero-knowledge arguments for NP from any one-way function. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), Berkeley, CA, October 2006, pp. 3–14 (2006)
Nguyen, M.-H., Vadhan, S.: Zero knowledge with efficient provers. In: STOC 2006: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 287–295. ACM Press, New York, USA (2006)
Okamoto, T.: On relationships between statistical zero-knowledge proofs. J. Comput. Syst. Sci. 60(1), 47–108 (2000)
Petrank, E., Tardos, G.: On the knowledge complexity of NP. In: FOCS, pp. 494–503 (1996)
Sahai, A., Vadhan, S.P.: A complete problem for statistical zero-knowledge. J. ACM 50(2), 196–249 (2003)
De Santis, A., Di Crescenzo, G., Persiano, G.: The knowledge complexity of quadratic residuosity languages. Theor. Comput. Sci. 132(1-2), 291–317 (1994)
De Santis, A., Di Crescenzo, G., Persiano, G.: Randomness-efficient non-interactive zero-knowledge (extended abstract). In: Automata, Languages and Programming, pp. 716–726 (1997)
De Santis, A., Di Crescenzo, G., Persiano, G.: On NC1 boolean circuitcomposition of non-interactive perfect zero-knowledge. In: Fiala, J., Koubek, V., KratochvÃl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 356–367. Springer, Heidelberg (2004)
De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: Image densityis complete for non-interactive-SZK (extended abstract). In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 784–795. Springer, Heidelberg (1998)
Tompa, M., Woll, H.: Random self-reducibility and zero-knowledge interactive proofs of possession of information. In: 28th FOCS, pp. 472–482 (1987)
Vadhan, S.P.: A study of statistical zero-knowledge proofs. PhD thesis, MIT (1999)
Vadhan, S.P.: An unconditional study of computational zero knowledge. In: FOCS, pp. 176–185 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malka, L. (2008). How to Achieve Perfect Simulation and A Complete Problem for Non-interactive Perfect Zero-Knowledge. In: Canetti, R. (eds) Theory of Cryptography. TCC 2008. Lecture Notes in Computer Science, vol 4948. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78524-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-78524-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78523-1
Online ISBN: 978-3-540-78524-8
eBook Packages: Computer ScienceComputer Science (R0)