{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T02:17:02Z","timestamp":1772158622635,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,9,28]],"date-time":"2007-09-28T00:00:00Z","timestamp":1190937600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00145-007-9004-8","type":"journal-article","created":{"date-parts":[[2007,9,27]],"date-time":"2007-09-27T18:28:25Z","timestamp":1190917705000},"page":"303-349","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Handling Expected Polynomial-Time Strategies in\u00a0Simulation-Based Security Proofs"],"prefix":"10.1007","volume":"21","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,9,28]]},"reference":[{"key":"9004_CR1","doi-asserted-by":"crossref","unstructured":"B. Barak, How to go beyond the black-box simulation barrier, in 42nd FOCS, 2001, pp.\u00a0106\u2013115","DOI":"10.1109\/SFCS.2001.959885"},{"key":"9004_CR2","doi-asserted-by":"crossref","unstructured":"B. Barak, O. Goldreich, Universal arguments and their applications, in 17th IEEE Conference on Computational Complexity, 2002, pp.\u00a0194\u2013203","DOI":"10.1109\/CCC.2002.1004355"},{"issue":"4","key":"9004_CR3","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1137\/S0097539703427975","volume":"33","author":"B. Barak","year":"2004","unstructured":"B. Barak, Y. Lindell, Strict polynomial-time in simulation and extraction, SIAM J.\u00a0Comput. 33(4), 783\u2013818 (2004)","journal-title":"SIAM J.\u00a0Comput."},{"key":"9004_CR4","volume-title":"Probability and Measure","author":"P. Billingsley","year":"1986","unstructured":"P. Billingsley, Probability and Measure, 2nd\u00a0edn. (Wiley, New York, 1986)","edition":"2"},{"issue":"1","key":"9004_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"R. Canetti, Security and composition of multiparty cryptographic protocols, J.\u00a0Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J.\u00a0Cryptol."},{"key":"9004_CR6","doi-asserted-by":"crossref","unstructured":"R. Canetti, Universally composable security: a\u00a0new paradigm for cryptographic protocols, in 42nd FOCS, 2001, pp.\u00a0136\u2013145","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9004_CR7","doi-asserted-by":"crossref","unstructured":"R. Canetti, O. Goldreich, S. Goldwasser, S. Micali, Resettable zero-knowledge, in 32nd STOC, 2000, pp.\u00a0235\u2013244","DOI":"10.1145\/335305.335334"},{"key":"9004_CR8","unstructured":"U. Feige, Alternative models for zero knowledge interactive proofs. Ph.D.\u00a0Thesis, Weizmann Institute, 1990"},{"key":"9004_CR9","series-title":"LNCS","first-page":"526","volume-title":"CRYPTO\u201989","author":"U. Feige","year":"1989","unstructured":"U. Feige, A. Shamir, Zero-knowledge proofs of knowledge in two rounds, in CRYPTO\u201989. LNCS, vol.\u00a0435 (Springer, Berlin, 1989), pp.\u00a0526\u2013544"},{"key":"9004_CR10","series-title":"Foundations of Cryptography","volume-title":"Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"O. Goldreich, Basic Tools. Foundations of Cryptography, vol.\u00a01 (Cambridge University Press, Cambridge, 2001)"},{"key":"9004_CR11","series-title":"Foundations of Cryptography","volume-title":"Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Basic Applications. Foundations of Cryptography, vol.\u00a02 (Cambridge University Press, Cambridge, 2004)"},{"issue":"3","key":"9004_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"O. Goldreich, A. Kahan, How to construct constant-round zero-knowledge proof systems for\u00a0NP, J.\u00a0Cryptol. 9(3), 167\u2013190 (1996)","journal-title":"J.\u00a0Cryptol."},{"issue":"1","key":"9004_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O. Goldreich","year":"1994","unstructured":"O. Goldreich, Y. Oren, Definitions and properties of zero-knowledge proof systems, J.\u00a0Crypt. 7(1), 1\u201332 (1994)","journal-title":"J.\u00a0Crypt."},{"issue":"4","key":"9004_CR14","first-page":"792","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions, J.\u00a0ACM 33(4), 792\u2013807 (1986)","journal-title":"J.\u00a0ACM"},{"key":"9004_CR15","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game\u2014a\u00a0completeness theorem for protocols with honest majority, in 19th STOC, 1987, pp.\u00a0218\u2013229. For details see\u00a0[11]","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"9004_CR16","first-page":"691","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali, A. Wigderson, Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems, J.\u00a0ACM 38(1), 691\u2013729 (1991)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"9004_CR17","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, C. Rackoff, The knowledge complexity of interactive proof systems, SIAM J.\u00a0Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J.\u00a0Comput."},{"issue":"4","key":"9004_CR18","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"J. H\u00e5stad, R. Impagliazzo, L.A. Levin, M. Luby, A\u00a0pseudorandom generator from any one-way function, SIAM J.\u00a0Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J.\u00a0Comput."},{"issue":"3","key":"9004_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00145-002-0143-7","volume":"16","author":"Y. Lindell","year":"2003","unstructured":"Y. Lindell, Parallel coin-tossing and constant-round secure two-party computation, J.\u00a0Cryptol. 16(3), 143\u2013184 (2003)","journal-title":"J.\u00a0Cryptol."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9004-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-007-9004-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9004-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9004-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T07:22:27Z","timestamp":1737444147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-007-9004-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9,28]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9004"],"URL":"https:\/\/doi.org\/10.1007\/s00145-007-9004-8","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9,28]]},"assertion":[{"value":"20 September 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2006","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}