{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:56:43Z","timestamp":1764133003795,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319446172"},{"type":"electronic","value":"9783319446189"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44618-9_26","type":"book-chapter","created":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T21:10:01Z","timestamp":1470777001000},"page":"486-505","source":"Crossref","is-referenced-by-count":3,"title":["What Security Can We Achieve Within 4 Rounds?"],"prefix":"10.1007","author":[{"given":"Carmit","family":"Hazay","sequence":"first","affiliation":[]},{"given":"Muthuramakrishnan","family":"Venkitasubramaniam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,11]]},"reference":[{"issue":"4","key":"26_CR1","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1109\/49.839935","volume":"18","author":"N Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. IEEE J. Sel. Areas Commun. 18(4), 593\u2013610 (2000)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"26_CR2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y Aumann","year":"2010","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol. 23(2), 281\u2013343 (2010)","journal-title":"J. Cryptol."},{"key":"26_CR3","unstructured":"Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. IACR Cryptology ePrint Archive 2005:106 (2005)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 377\u2013391. Springer, Heidelberg (1992)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/978-3-662-44381-1_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"I Bentov","year":"2014","unstructured":"Bentov, I., Kumaresan, R.: How to use bitcoin to design fair protocols. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part II. LNCS, vol. 8617, pp. 421\u2013439. Springer, Heidelberg (2014)"},{"key":"26_CR6","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, USA, pp. 1444\u20131451"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"issue":"6","key":"26_CR8","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Katz, J., Tackmann, B., Zikas, V.: How fair is your protocol? A utility-based approach to protocol optimality. In: PODC, pp. 281\u2013290 (2015)","DOI":"10.1145\/2767386.2767431"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-662-49896-5_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"S Garg","year":"2016","unstructured":"Garg, S., Mukherjee, P., Pandey, O., Polychroniadou, A.: The exact round complexity of secure computation. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 448\u2013476. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49896-5_16"},{"issue":"1","key":"26_CR11","doi-asserted-by":"crossref","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. Comput. 25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"26_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/978-3-642-13190-5_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"SD Gordon","year":"2010","unstructured":"Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 157\u2013176. Springer, Heidelberg (2010)"},{"issue":"2","key":"26_CR14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/100790537","volume":"40","author":"I Haitner","year":"2011","unstructured":"Haitner, I., Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: Black-box constructions of protocols for secure computation. SIAM J. Comput. 40(2), 225\u2013266 (2011)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"26_CR15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/s00145-010-9092-8","volume":"25","author":"S Halevi","year":"2012","unstructured":"Halevi, S., Kalai, Y.T.: Smooth projective hashing and two-message oblivious transfer. J. Cryptol. 25(1), 158\u2013193 (2012)","journal-title":"J. Cryptol."},{"key":"26_CR16","first-page":"797","volume":"2015","author":"C Hazay","year":"2015","unstructured":"Hazay, C., Venkitasubramaniam, M.: What security can we achieve in 4-rounds? IACR Cryptology ePrint Arch. 2015, 797 (2015). http:\/\/eprint.iacr.org\/2015\/797","journal-title":"IACR Cryptology ePrint Arch."},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/978-3-642-20465-4_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"Y Ishai","year":"2011","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Prabhakaran, M., Sahai, A.: Efficient non-interactive secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 406\u2013425. Springer, Heidelberg (2011)"},{"key":"26_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-28628-8_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"J Katz","year":"2004","unstructured":"Katz, J., Ostrovsky, R.: Round-optimal secure two-party computation. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 335\u2013354. Springer, Heidelberg (2004)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 2139, p. 171. Springer, Heidelberg (2001)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Micali, S.: Simple and fast optimistic protocols for fair electronic exchange. In: PODC, pp. 12\u201319 (2003)","DOI":"10.1145\/872035.872038"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R., Rosen, A.: Input-indistinguishable computation. In: FOCS, pp. 367\u2013378 (2006)","DOI":"10.1109\/FOCS.2006.43"},{"key":"26_CR22","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. 576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"26_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-00457-5_1","volume-title":"Theory of Cryptography","author":"T Moran","year":"2009","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 1\u201318. Springer, Heidelberg (2009)"},{"key":"26_CR24","unstructured":"Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SODA, pp. 448\u2013457 (2001)"},{"key":"26_CR25","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Richelson, S., Scafuro, A.: Round-optimal black-box two-party computation. IACR Cryptology ePrint Archive 2015:553 (2015)","DOI":"10.1007\/978-3-662-48000-7_17"},{"key":"26_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/3-540-39200-9_10","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R Pass","year":"2003","unstructured":"Pass, R.: Simulation in quasi-polynomial time, and its application to protocol composition. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 160\u2013176. Springer, Heidelberg (2003)"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-46766-1_9","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"TP Pedersen","year":"1992","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 129\u2013140. Springer, Heidelberg (1992)"},{"key":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"26_CR29","doi-asserted-by":"crossref","unstructured":"Prabhakaran, M., Sahai, A.: New notions of security: achieving universal composability without trusted setup. In: STOC, pp. 242\u2013251 (2004)","DOI":"10.1145\/1007352.1007394"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Yao, AC.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44618-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,12]],"date-time":"2019-09-12T06:26:59Z","timestamp":1568269619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44618-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319446172","9783319446189"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44618-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}