Handling Expected Polynomial-Time Strategies in Simulation-Based Security Proofs

  • Jonathan Katz
  • Yehuda Lindell
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3378)


The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines (or circuits). However, expected polynomial-time machines are often also considered. For example, there are many zero-knowledge protocols for which the only simulation techniques known run in expected (and not strict) polynomial-time. In addition, it has been shown that expected polynomial-time simulation is essential for achieving constant-round black-box zero-knowledge protocols. This reliance on expected polynomial-time simulation introduces a number of conceptual and technical difficulties. In this paper, we develop techniques for dealing with expected polynomial-time adversaries in the context of simulation-based security proofs.


Pseudorandom Function Auxiliary Input Honest Party Oracle Query Composition Theorem 
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.


  1. 1.
    Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: 42nd FOCS, pp. 106–115 (2001)Google Scholar
  2. 2.
    Barak, B., Goldreich, O.: Universal Arguments and their Applications. In: 17th IEEE Conference on Computational Complexity, pp. 194–203 (2002)Google Scholar
  3. 3.
    Barak, B., Lindell, Y.: Strict Polynomial-Time in Simulation and Extraction. SIAM Journal on Computing 33(4), 783–818 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1), 143–202 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: 42nd FOCS, pp. 136–145 (2001)Google Scholar
  6. 6.
    Canetti, R., Goldreich, O., Goldwasser, S., Micali, S.: Resettable Zero-Knowledge. In: STOC (2000)Google Scholar
  7. 7.
    Feige, U.: Alternative Models for Zero Knowledge Interactive Proofs. Ph.D. Thesis, Weizmann Institute (1990)Google Scholar
  8. 8.
    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
  9. 9.
    Goldreich, O.: Foundations of Cryptography: Basic Tools, vol. 1. Cambridge University Press, Cambridge (2001)zbMATHCrossRefGoogle Scholar
  10. 10.
    Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)zbMATHGoogle Scholar
  11. 11.
    Goldreich, O., Kahan, A.: How To Construct Constant-Round Zero-Knowledge Proof Systems for NP. Journal of Cryptology 9(3), 167–190 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Goldreich, O., Krawczyk, H.: On the Composition of Zero-Knowledge Proof Systems. SIAM Journal on Computing 25(1), 169–192 (1996)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Goldreich, O., Micali, S., Wigderson, A.: Proofs that Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. Journal of the ACM 38(1), 691–729 (1991)zbMATHMathSciNetGoogle Scholar
  14. 14.
    Goldreich, O., Oren, Y.: Definitions and Properties of Zero-Knowledge Proof Systems. Journal of Cryptology 7(1), 1–32 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing 18(1), 186–208 (1989)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Lindell, Y.: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. Journal of Cryptology 16(3), 143–184 (2003)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jonathan Katz
    • 1
  • Yehuda Lindell
    • 2
  1. 1.Department of Computer ScienceUniversity of MarylandUSA
  2. 2.Department of Computer ScienceBar-Ilan UniversityIsrael

Personalised recommendations