Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

International Conference on the Theory and Applications of Cryptographic Techniques

EUROCRYPT 2003: Advances in Cryptology — EUROCRYPT 2003 pp 160–176Cite as

  1. Home
  2. Advances in Cryptology — EUROCRYPT 2003
  3. Conference paper
Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition

Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition

  • Rafael Pass5 
  • Conference paper
  • First Online: 01 January 2003
  • 3670 Accesses

  • 95 Citations

Part of the Lecture Notes in Computer Science book series (LNCS,volume 2656)

Abstract

We propose a relaxation of zero-knowledge, by allowing the simulator to run in quasi-polynomial time. We show that protocols satisfying this notion can be constructed in settings where the standard definition is too restrictive. Specifically, we construct constant-round straight-line concurrent quasi-polynomial time simulatable arguments and show that such arguments can be used in advanced composition operations without any set-up assumptions. Our protocols rely on slightly strong, but standard type assumptions (namely the existence of one-to-one one-way functions secure against subexponential circuits).

Keywords

  • Random Oracle
  • Commitment Scheme
  • Interactive Proof
  • Common Reference String
  • Springer LNCS

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.

Download conference paper PDF

References

  1. Boaz Barak, “How to Go Beyond the Black-Box Simulation Barrier”, 42nd FOCS, pp. 106–115, 2001

    Google Scholar 

  2. Boaz Barak, Yehuda Lindell “Strict polynomial-time in simulation and extraction”, 34th STOC, pp. 484–493, 2002

    Google Scholar 

  3. Dan Boneh, Moni Naor, “Timed Commitments”, Crypto00, Springer LNCS 1880, pp. 236–254, 2000

    Google Scholar 

  4. Manuel Blum, “Coin Flipping by Telephone”, Crypto81, ECE Report 82-04, ECE Dept., UCSB, pp. 11–15, 1982

    Google Scholar 

  5. M. Blum, “How to prove a theorem so no one else can claim it”, Proc. of the International Congress of Mathematicians, pp. 1444–1451, 1986

    Google Scholar 

  6. Ran Canetti, “Universally Composable Security: A New Paradigm for Cryptographic Protocols”, 42nd FOCS, pp. 136–145, 2001

    Google Scholar 

  7. Ran Canetti, Marc Fischlin, “Universally Composable Commitments”, Crypto01, Springer LNCS 2139, pp. 19–40, 2001

    Google Scholar 

  8. Ran Canetti, Oded Goldreich, Shai Halevi, “The Random Oracle Methodology, Revisited (Preliminary Version)”, 30th STOC, pp. 209–218, 1998

    Google Scholar 

  9. R. Canetti, O. Goldreich, S. Goldwasser and S. Micali, “Resettable Zero-Knowledge”, 32nd STOC, pp. 235–244, 2000

    Google Scholar 

  10. Ran Canetti, Joe Kilian, Erez Petrank, Alon Rosen, “Black-box concurrent zero-knowledge requires Omega (log n) rounds”, 33rd STOC, pp. 570–579, 2001

    Google Scholar 

  11. Ronald Cramer, Ivan Damgård, Berry Schoenmakers, “Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols”, Crypto94, Springer LNCS 839, pp. 174–187, 1994

    Google Scholar 

  12. Y. Damgård, “Efficient Concurrent Zero-Knowledge in the Auxilliary String Model”, EuroCrypt00, Springer LNCS 1807, pp 418–430, 2000

    Google Scholar 

  13. Cynthia Dwork, Larry J. Stockmeyer, “2-round zero knowledge and proof auditors”, 34th STOC, pp 322–331, 2002

    Google Scholar 

  14. C. Dwork, M. Naor, A. Sahai, “Concurrent zero-knowledge”, 30th STOC pp. 409–418, 1998

    Google Scholar 

  15. Cynthia Dwork, Moni Naor, “Zaps and Their Applications”, 40th FOCS, pp. 283–293, 2000

    Google Scholar 

  16. Cynthia Dwork, Moni Naor, “Pricing via Processing or Combatting Junk Mail”, Crypto92, Springer LNCS 740, pp. 139–147, 1992

    Google Scholar 

  17. U. Feige, D. Lapidot, A. Shamir, “Multiple Noninteractive Zero Knowledge Proofs under General Assumptions”, Siam J. Comput. 29(1), pp. 1–28, 1999

    CrossRef  MATH  MathSciNet  Google Scholar 

  18. Uriel Feige, Adi Shamir, “Zero Knowledge Proofs of Knowledge in Two Rounds”, Crypto89, Springer LNCS 435, pp. 526–544, 1989

    Google Scholar 

  19. Uriel Feige, Adi Shamir, “Witness Indistinguishable and Witness Hiding Protocols”, 22nd STOC, pp. 416–426, 1990

    Google Scholar 

  20. O. Goldreich, “Foundations of Cryptography”, Cambridge University Press, 2001

    Google Scholar 

  21. Oded Goldreich, Ariel Kahan, “How to Construct Constant-Round Zero-Knowledge Proof Systems for NP”, Jour. of Cryptology 9(3), pp. 167–190, 1996

    CrossRef  MATH  MathSciNet  Google Scholar 

  22. Oded Goldreich, Hugo Krawczyk, “On the Composition of Zero-Knowledge Proof Systems”, SIAM J. Comput. 25(1), pp. 169–192, 1996

    CrossRef  MATH  MathSciNet  Google Scholar 

  23. Oded Goldreich, Leonid A. Levin, “A Hard-Core Predicate for all One-Way Functions”, 21st STOC, pp. 25–32, 1989

    Google Scholar 

  24. Oded Goldreich, Silvio Micali, Avi Wigderson, “Proofs that Yield Nothing But Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems”, JACM 38(3), pp. 691–729, 1991

    CrossRef  MATH  MathSciNet  Google Scholar 

  25. Oded Goldreich, Yair Oren, “Definitions and Properties of Zero-Knowledge Proof Systems”, Jour. of Cryptology 7(1), pp. 1–32, 1994

    MATH  MathSciNet  Google Scholar 

  26. Shafi Goldwasser, Silvio Micali, “Probabilistic Encryption”, JCSS 28(2), pp. 270–299, 1984

    MATH  MathSciNet  Google Scholar 

  27. Shafi Goldwasser, Silvio Micali, Charles Rackoff, “The Knowledge Complexity of Interactive Proof Systems”, SIAM J. Comput. 18(1), pp. 186–208, 1989. Preliminary version in STOC 1985. Earlier versions date to 1982.

    CrossRef  MATH  MathSciNet  Google Scholar 

  28. Louis C. Guillou, Jean-Jacques Quisquater, “A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Trasmission and Memory”, EuroCrypt88, Springer LNCS 330, pp. 123–128, 1988

    Google Scholar 

  29. Rafael Pass, “How to Use Random Oracles Properly”, Submitted.

    Google Scholar 

  30. Rafael Pass, “On the Limits of the Common Reference String Model, and Implications on Universal Composability”, Submitted.

    Google Scholar 

  31. Charles Rackoff, Daniel R. Simon, “Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack”, Crypto91, Springer LNCS 576, pp. 433–444, 1991

    Google Scholar 

  32. Ransom Richardson, Joe Kilian, “On the Concurrent Composition of Zero-Knowledge Proofs”, EuroCrypt99, Springer LNCS 1592, pp. 415–431, 1999

    Google Scholar 

  33. C.P. Schnorr, “Efficient Identification and Signatures for Smart Cards”, Crypto89, Springer LNCS 435, pp. 235–251, 1989

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Numerical Analysis and Computer Science, Royal Institute of Technology, 100 44, Stockholm, Sweden

    Rafael Pass

Authors
  1. Rafael Pass
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technion — Israel Institute of Technology, Haifa, 32000, Israel

    Eli Biham

Rights and permissions

Reprints and Permissions

Copyright information

© 2003 International Association for Cryptologic Research

About this paper

Cite this paper

Pass, R. (2003). Simulation in Quasi-Polynomial Time, and Its Application to Protocol Composition. In: Biham, E. (eds) Advances in Cryptology — EUROCRYPT 2003. EUROCRYPT 2003. Lecture Notes in Computer Science, vol 2656. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39200-9_10

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/3-540-39200-9_10

  • Published: 13 May 2003

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-14039-9

  • Online ISBN: 978-3-540-39200-2

  • eBook Packages: Springer Book Archive

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature