Skip to main content
Springer Nature Link
Log in

Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds

  • Conference paper
Automata, Languages and Programming (ICALP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3580))

Included in the following conference series:

  • 3188 Accesses

Abstract

In this paper we study the round complexity of concurrent zero-knowledge arguments and show that, for any function β(n)=ω(1), there exists an unbounded concurrent zero-knowledge argument system with β(n) rounds. Our result assumes that the same prover is engaged in several concurrent sessions and that the prover has a counter whose value is shared across concurrent executions of the argument. Previous constructions for concurrent zero knowledge required a (almost) logarithmic number of rounds [Prabhakaran et al. – FOCS 2002] in the plain model or seemingly stronger set-up assumptions.

Moreover, we construct two β(n)-round unbounded concurrent zero-knowledge arguments that are mutually concurrent simulation sound for any β(n)=ω(1). Here we assume that each party has access to a counter and that the two protocols are used by the same two parties to play several concurrent sessions of the two protocols.

Work supported by Network of Excellence ECRYPT under contract IST-2002-507932.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent Zero-Knowledge with Logarithmic Round Complexity. In: Proc. of FOCS 2002, pp. 366–375. IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  2. Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: Proc. of STOC 1998, pp. 409–418. ACM, New York (1998)

    Google Scholar 

  3. Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-Box Concurrent Zero-Knowledge Requires ω(logn) Rounds. In: Proc. of STOC 2001, pp. 570–579. ACM, New York (2001)

    Google Scholar 

  4. Richardson, R., Kilian, J.: On the Concurrent Composition of Zero-Knowledge Proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 415–431. Springer, Heidelberg (1999)

    Google Scholar 

  5. Kilian, J., Petrank, E.: Concurrent and Resettable Zero-Knowledge in Poly-Logarithmic Rounds. In: Proc. of STOC 2001, pp. 560–569. ACM, New York (2001)

    Google Scholar 

  6. Dwork, C., Sahai, A.: Concurrent Zero-Knowledge: Reducing the Need for Timing Constraints. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 442–457. Springer, Heidelberg (1998)

    Google Scholar 

  7. Goldreich, O.: Concurrent Zero-Knowledge with Timing, Revisited. In: Proc. of STOC 2002, pp. 332–340. ACM, New York (2002)

    Google Scholar 

  8. Damgård, I.B.: Efficient concurrent zero-knowledge in the auxiliary string model. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 418–430. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Blum, M., De Santis, A., Micali, S., Persiano, G.: Non-Interactive Zero-Knowledge. SIAM J. on Computing 20, 1084–1118 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Di Crescenzo, G., Persiano, G., Visconti, I.: Constant-Round Resettable Zero Knowledge with Concurrent Soundness in the Bare Public-Key Model. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 237–253. Springer, Heidelberg (2004)

    Google Scholar 

  11. Pass, R., Rosen, A.: Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds. In: Proc. of FOCS 2003. IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  12. Pass, R.: Simulation in Quasi-Polynomial Time and Its Applications to Protocol Composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 160–176. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: Proc. of FOCS 2001, pp. 106–115. IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  14. Sahai, A.: Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security. In: Proc. of FOCS 1999, pp. 543–553. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  15. Dolev, D., Dwork, C., Naor, M.: Non-Malleable Cryptography. SIAM J. on Computing 30, 391–437 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  16. Feige, U., Lapidot, D., Shamir, A.: Multiple Non-Interactive Zero Knowledge Proofs Under General Assumptions. SIAM J. on Computing 29, 1–28 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  17. Barak, B., Goldreich, O.: Universal Arguments and Their Applications. In: IEEE Conference on Computational Complexity (CCC 2002). IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica ed Appl., Università di Salerno, Italy

    Giuseppe Persiano & Ivan Visconti

Authors
  1. Giuseppe Persiano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ivan Visconti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CITI / Departamento de Informática, Universidade Nova de Lisboa, Portugal

    Luís Caires

  2. Dipartimento di Informatica, Sistemi e Produzione, Università di Roma “Tor Vergata”, via del Politecnico 1, 00133, Roma, Italy

    Giuseppe F. Italiano

  3. Departamento de Informatica, Universidade Nova de Lisboa, 2829-516, Caparica, Portugal

    Luís Monteiro

  4. Ecole Polytechnique, Rue de Saclay, 91128, Palaiseau Cedex, France

    Catuscia Palamidessi

  5. Computer Science Department, Google Inc. and Columbia University, 1214 Amsterdam Avenue, NY 10027, New York, USA

    Moti Yung

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Persiano, G., Visconti, I. (2005). Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_19

Download citation

  • DOI: https://doi.org/10.1007/11523468_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27580-0

  • Online ISBN: 978-3-540-31691-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation