{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:10:55Z","timestamp":1769314255240,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540226680","type":"print"},{"value":"9783540286288","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28628-8_21","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:54:02Z","timestamp":1285016042000},"page":"335-354","source":"Crossref","is-referenced-by-count":110,"title":["Round-Optimal Secure Two-Party Computation"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Katz","sequence":"first","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/SFCS.2001.959885","volume-title":"42nd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"B. Barak","year":"2001","unstructured":"Barak, B.: How to Go Beyond the Black-Box Simulation Barrier. In: 42nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 106\u2013115. IEEE, Los Alamitos (2001)"},{"key":"21_CR2","first-page":"345","volume-title":"43rd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"B. Barak","year":"2002","unstructured":"Barak, B.: Constant-Round Coin-Tossing with a Man-in-the-Middle or Realizing the Shared Random String Model. In: 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 345\u2013355. IEEE, Los Alamitos (2002)"},{"key":"21_CR3","first-page":"484","volume-title":"34th ACM Symposium on Theory of Computing (STOC)","author":"B. Barak","year":"2002","unstructured":"Barak, B., Lindell, Y.: Strict Polynomial Time in Simulation and Extraction. In: 34th ACM Symposium on Theory of Computing (STOC), pp. 484\u2013493. ACM, New York (2002)"},{"key":"21_CR4","first-page":"201","volume-title":"Principles of Distributed Computing","author":"J. Bar-Ilan","year":"1989","unstructured":"Bar-Ilan, J., Beaver, D.: Non-Cryptographic Fault-Tolerant Computing in Constant Number of Rounds of Interaction. In: Principles of Distributed Computing, pp. 201\u2013209. ACM, New York (1989)"},{"key":"21_CR5","first-page":"503","volume-title":"22nd ACM Symposium on Theory of Computing (STOC)","author":"D. Beaver","year":"1990","unstructured":"Beaver, D., Micali, S., Rogaway, P.: The Round Complexity of Secure Protocols. In: 22nd ACM Symposium on Theory of Computing (STOC), pp. 503\u2013513. ACM, New York (1990)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., Ostrovsky, R.: Perfect Zero-Knowledge in Constant Rounds STOC, pp. 482\u2013493 (1990)","DOI":"10.1145\/100216.100283"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., Ostrovsky, R.: The (True) Complexity of Statistical Zero Knowledge STOC, pp. 494\u2013502 (1990)","DOI":"10.1145\/100216.100285"},{"key":"21_CR8","unstructured":"Blum, M.: Coin Flipping by Phone. In: IEEE COMPCOM, pp. 133\u2013137 (1982)"},{"issue":"1","key":"21_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and Composition of Multi-Party Cryptographic Protocols. J. Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally composable two-party and multi-party secure computation. In: STOC 2002, pp. 494\u2013503 (2002)","DOI":"10.1145\/509907.509980"},{"issue":"1","key":"21_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s001459910005","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Kushilevitz, E., Ostrovsky, R., Rosen, A.: Randomness versus Fault- Tolerance. J. Cryptology\u00a013(1), 107\u2013142 (2000)","journal-title":"J. Cryptology"},{"key":"21_CR12","first-page":"639","volume-title":"28th ACM Symposium on Theory of Computing (STOC)","author":"R. Canetti","year":"1996","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively-Secure Multiparty Computation. In: 28th ACM Symposium on Theory of Computing (STOC), pp. 639\u2013648. ACM, New York (1996)"},{"key":"21_CR13","first-page":"570","volume-title":"33rd ACM Symp. on Theory of Comp. (STOC)","author":"R. Canetti","year":"2001","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Concurrent Zero-Knowledge Requires _ \u03a9 (log n) Rounds. In: 33rd ACM Symp. on Theory of Comp (STOC), pp. 570\u2013579. ACM, New York (2001)"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/3-540-44647-8_7","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I.: Secure Distributed Linear Algebra in a Constant Number of Rounds. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 119\u2013136. Springer, Heidelberg (2001)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/3-540-48405-1_31","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"G. Crescenzo Di","year":"1999","unstructured":"Di Crescenzo, G., Ostrovsky, R.: On Concurrent Zero-Knowledge with Preprocessing. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 485\u2013502. Springer, Heidelberg (1999)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1007\/3-540-44598-6_27","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"I. Damg\u00e5rd","year":"2000","unstructured":"Damg\u00e5rd, I., Nielsen, J.B.: Improved Non-Committing Encryption Schemes. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 432\u2013450. Springer, Heidelberg (2000)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Santis De","year":"2001","unstructured":"De Santis, A., DiCrescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust Noninteractive Zero Knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 566\u2013598. Springer, Heidelberg (2001)"},{"key":"21_CR18","unstructured":"Feige, U.: Alternative Models for Zero Knowledge Interactive Proofs. PhD thesis, Weizmann Institute of Science (1990)"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1007\/0-387-34805-0_46","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Zero Knowledge Proofs of Knowledge in Two Rounds. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 526\u2013544. Springer, Heidelberg (1990)"},{"key":"21_CR20","first-page":"416","volume-title":"22nd ACM Symposium on Theory of Computing (STOC)","author":"U. Feige","year":"1990","unstructured":"Feige, U., Shamir, A.: Witness Indistinguishability and Witness Hiding Protocols. In: 22nd ACM Symposium on Theory of Computing (STOC), pp. 416\u2013426. ACM, New York (1990)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-44647-8_5","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"M. Fitzi","year":"2001","unstructured":"Fitzi, M., Garay, J., Maurer, U., Ostrovsky, R.: Minimal Complete Primitives for Secure Multi-party Computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 80\u2013100. Springer, Heidelberg (2001)"},{"key":"21_CR22","first-page":"580","volume-title":"33rd ACM Symposium on Theory of Computing (STOC)","author":"R. Gennaro","year":"2001","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In: 33rd ACM Symposium on Theory of Computing (STOC), pp. 580\u2013589. ACM, New York (2001)"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/3-540-45708-9_12","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"R. Gennaro","year":"2002","unstructured":"Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: On 2-Round Secure Multiparty Computation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 178\u2013193. Springer, Heidelberg (2002)"},{"key":"21_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography, Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Tools, vol.\u00a01. Cambridge University Press, Cambridge (2001)"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Draft of a Chapter on Cryptographic Protocols (June 2003), Available at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/foc-vol2.html","DOI":"10.1007\/s00446-002-0077-1"},{"key":"21_CR26","unstructured":"Goldreich, O.: Draft of an Appendix Regarding Corrections and Additions (June 2003), Available at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/foc-vol2.html"},{"issue":"3","key":"21_CR27","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to Construct Constant-Round Zero-Knowledge Proof Systems for NP. J. Cryptology\u00a09(3), 167\u2013190 (1996)","journal-title":"J. Cryptology"},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the Composition of Zero-Knowledge Proof Systems. SIAM J. Computing\u00a025(1), 169\u2013192 (1996)","journal-title":"SIAM J. Computing"},{"key":"21_CR29","first-page":"218","volume-title":"19th ACM Symposium on Theory of Computing (STOC)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game: a Completeness Theorem for Protocols with Honest Majority. In: 19th ACM Symposium on Theory of Computing (STOC), pp. 218\u2013229. ACM, New York (1987)"},{"key":"21_CR30","first-page":"44","volume-title":"21st ACM Symposium on Theory of Computing (STOC)","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the Provable Consequences of One-Way Permutations. In: 21st ACM Symposium on Theory of Computing (STOC), pp. 44\u201361. ACM, New York (1989)"},{"issue":"4","key":"21_CR31","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1137\/S0097539797321742","volume":"29","author":"J. Kilian","year":"2000","unstructured":"Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and Completeness in Private Computations. SIAM J. Comput.\u00a029(4), 1189\u20131208 (2000)","journal-title":"SIAM J. Comput."},{"key":"21_CR32","first-page":"294","volume-title":"41st IEEE Symposium on Foundations of Computer Science (FOCS)","author":"Y. Ishai","year":"2000","unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. In: 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 294\u2013304. IEEE, Los Alamitos (2000)"},{"key":"21_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/3-540-39200-9_36","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"J. Katz","year":"2003","unstructured":"Katz, J., Ostrovsky, R., Smith, A.: Round Efficiency of Multi-Party Computation with a Dishonest Majority. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 578\u2013595. Springer, Heidelberg (2003)"},{"issue":"4","key":"21_CR34","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1137\/S089548010135274X","volume":"16","author":"E. Kushilevitz","year":"2003","unstructured":"Kushilevitz, E., Ostrovsky, R., Ros\u00e9n, A.: Amortizing Randomness in Private Multiparty Computations. SIAM J. Discrete Math.\u00a016(4), 533\u2013544 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR35","first-page":"560","volume-title":"31st ACM Symposium on Theory of Computing (STOC)","author":"J. Kilian","year":"2001","unstructured":"Kilian, J., Petrank, E.: Concurrent and Resettable Zero-Knowledge in Polylogarithmic Rounds. In: 31st ACM Symposium on Theory of Computing (STOC), pp. 560\u2013569. ACM, New York (2001)"},{"key":"21_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-38424-3_26","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"D. Lapidot","year":"1991","unstructured":"Lapidot, D., Shamir, A.: Publicly-Verifiable Non-Interactive Zero-Knowledge Proofs. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 353\u2013365. Springer, Heidelberg (1991)"},{"key":"21_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44647-8_10","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"Y. Lindell","year":"2001","unstructured":"Lindell, Y.: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 171\u2013189. Springer, Heidelberg (2001)"},{"key":"21_CR38","unstructured":"Lindell, Y.: Personal communication (2001)"},{"key":"21_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure Computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"21_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-48071-4_14","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"M. Naor","year":"1993","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 196\u2013214. Springer, Heidelberg (1993)"},{"key":"21_CR41","first-page":"366","volume-title":"43rd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"M. Prabhakaran","year":"2002","unstructured":"Prabhakaran, M., Rosen, A., Sahai, A.: Concurrent Zero Knowledge with Logarithmic Round-Complexity. In: 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 366\u2013375. IEEE, Los Alamitos (2002)"},{"key":"21_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1007\/3-540-48910-X_29","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"R. Richardson","year":"1999","unstructured":"Richardson, R., Kilian, J.: On the Concurrent Composition of Zero-Knowledge Proofs. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 415\u2013431. Springer, Heidelberg (1999)"},{"key":"21_CR43","first-page":"162","volume-title":"27th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A.C. Yao","year":"1986","unstructured":"Yao, A.C.: How to Generate and Exchange Secrets. In: 27th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28628-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:42Z","timestamp":1620012462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28628-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226680","9783540286288"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28628-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}