Skip to main content
SpringerLink
Log in

On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations

  • Conference paper
Book cover Progress in Cryptology – LATINCRYPT 2010 (LATINCRYPT 2010)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6212))

Abstract

We consider the following problem: can we construct constant-round zero-knowledge proofs (with negligible soundness) for NP assuming only the existence of one-way permutations? We answer the question in the negative for fully black-box constructions (using only black-box access to both the underlying primitive and the cheating verifier) that satisfy a natural restriction on the “adaptivity” of the simulator’s queries. Specifically, we show that only languages in coAM have constant-round zero-knowledge proofs of this kind. We also give strong evidence that we are unlikely to find fully black-box constructions of constant-round zero knowledge proofs for NP, even without this restriction on adaptivity.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aiello, W., Hastad, J.: Statistical zero-knowledge languages can be recognized in two rounds. JCSS 42, 327–345 (1991)

    MATH  MathSciNet  Google Scholar 

  2. Barak, B.: How to go beyond the black-box simulation barrier. In: Proc. 42nd FOCS, pp. 106–115. IEEE, Los Alamitos (2001)

    Google Scholar 

  3. Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. In: STOC, pp. 484–493 (2002)

    Google Scholar 

  4. Barak, B., Lindell, Y., Vadhan, S.: Lower bounds for non-black-box zero knowledge. JCSS 72(2), 321–391 (2006)

    MATH  MathSciNet  Google Scholar 

  5. Bellare, M., Jakobsson, M., Yung, M.: Round-optimal zero-knowledge arguments based on any one-way function. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 280–305. Springer, Heidelberg (1997)

    Google Scholar 

  6. Bellare, M., Micali, S., Ostrovsky, R.: Perfect zero-knowledge in constant rounds. In: STOC, pp. 482–493 (1990)

    Google Scholar 

  7. Blum, M.: How to prove a theorem so no one else can claim it. In: Proc. ICM (1986)

    Google Scholar 

  8. Brassard, G., Crépeau, C., Yung, M.: Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 192–195. Springer, Heidelberg (1990)

    Google Scholar 

  9. Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 526–545. Springer, Heidelberg (1990)

    Google Scholar 

  10. Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 526–544. Springer, Heidelberg (1990)

    Google Scholar 

  11. Fortnow, L.: The complexity of perfect zero-knowledge. In: STOC ’87, pp. 204–209 (1987)

    Google Scholar 

  12. Gennaro, R., Gertner, Y., Katz, J., Trevisan, L.: Bounds on the efficiency of generic cryptographic constructions. SIAM J. Comput. 35(1), 217–246 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  13. Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, New York (2004)

    MATH  Google Scholar 

  14. Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for NP. J. Cryptology 9(3), 167–190 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM J. Comput. 25(1), 169–192 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  16. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691–729 (1991) (prelim. version in FOCS ’86)

    Article  MATH  MathSciNet  Google Scholar 

  17. Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems 7(1), 1–32 (Winter 1994) (preliminary version in FOCS’ 87)

    MATH  MathSciNet  Google Scholar 

  18. Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186–208 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  19. Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. Advances in Computing Research: Randomness and Computation 5, 73–90 (1989)

    Google Scholar 

  20. Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 408–423. Springer, Heidelberg (1998)

    Google Scholar 

  21. Haitner, I., Hoch, J.J., Reingold, O., Segev, G.: Finding collisions in interactive protocols - a tight lower bound on the round complexity of statistically-hiding commitments. In: Proc. FOCS ’07, pp. 669–679 (2007)

    Google Scholar 

  22. Haitner, I., Mahmoody-Ghidary, M., Xiao, D.: A new sampling protocol and applications to basing cryptography on NP-hardnss. In: Proc. CCC 2010 (to appear, 2010), Full version available as ECCC TR-867-09

    Google Scholar 

  23. Haitner, I., Reingold, O., Vadhan, S., Wee, H.: Inaccessible entropy. In: STOC, pp. 611–620 (2009)

    Google Scholar 

  24. Håstad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. of Com. 28(4), 1364–1396 (1999) (preliminary versions appeared in STOC’ 89 and STOC’ 90)

    Article  MATH  Google Scholar 

  25. Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: STOC, pp. 44–61 (1989)

    Google Scholar 

  26. Katz, J.: Which languages have 4-round zero-knowledge proofs? In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 73–88. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  27. Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. In: FOCS, pp. 2–10 (1990)

    Google Scholar 

  28. Naor, M.: Bit commitment using pseudorandomness 4(2), 151–158 (1991) (preliminary version in CRYPTO’ 89)

    Google Scholar 

  29. Ostrovsky, R., Wigderson, A.: One-way functions are essential for non-trivial zero-knowledge. In: ISTCS ’93, pp. 3–17 (1993)

    Google Scholar 

  30. Pass, R.: Parallel repetition of zero-knowledge proofs and the possibility of basing cryptography on np-hardness. In: IEEE Conference on Computational Complexity, pp. 96–110 (2006)

    Google Scholar 

  31. Pass, R., Venkitasubramaniam, M.: Private coins versus public coins in zero-knowledge proof systems. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 588–605. Springer, Heidelberg (2010)

    Google Scholar 

  32. Pass, R., Wee, H.: Black-box constructions of two-party protocols from one-way functions. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 403–418. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  33. Pavan, A., Selman, A.L., Sengupta, S., Vinodchandran, N.V.: Polylogarithmic-round interactive proofs for conp collapse the exponential hierarchy. Theor. Comput. Sci. 385(1-3), 167–178 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  34. Reingold, O., Trevisan, L., Vadhan, S.: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 1–20. Springer, Heidelberg (2004)

    Google Scholar 

  35. Rosen, A.: A note on constant-round zero-knowledge proofs for np. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 191–202. Springer, Heidelberg (2004)

    Google Scholar 

  36. Simon, D.R.: Finding collisions on a one-way street: Can secure hash functions be based on general assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 334–345. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  37. Wee, H.: One-way permutations, interactive hashing and statistically hiding commitments. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 419–433. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Maryland, College Park, MD, 20742, USA

    S. Dov Gordon & Arkady Yerukhimovich

  2. Dept. of Computer Science, Queens College, CUNY, Flushing, NY, 11367, USA

    Hoeteck Wee

  3. LRI, Université Paris-Sud, 91405, Orsay Cedex, France

    David Xiao

Authors
  1. S. Dov Gordon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hoeteck Wee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Arkady Yerukhimovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, École Normale Supérieure, 45 Rue d’Ulm, 75230, Paris Cedex 05, France

    Michel Abdalla

  2. Computer Architecture and Networking Laboratory (LARC), Universidade de Sáo Paulo, Av. Prof. Luciano Gualberto, trav.3, n.158, 05508-900, Sáo Paulo (SP), Brazil

    Paulo S. L. M. Barreto

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gordon, S.D., Wee, H., Xiao, D., Yerukhimovich, A. (2010). On the Round Complexity of Zero-Knowledge Proofs Based on One-Way Permutations. In: Abdalla, M., Barreto, P.S.L.M. (eds) Progress in Cryptology – LATINCRYPT 2010. LATINCRYPT 2010. Lecture Notes in Computer Science, vol 6212. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14712-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14712-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14711-1

  • Online ISBN: 978-3-642-14712-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation