{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:32:20Z","timestamp":1743143540810,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319981123"},{"type":"electronic","value":"9783319981130"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98113-0_12","type":"book-chapter","created":{"date-parts":[[2018,8,2]],"date-time":"2018-08-02T12:13:46Z","timestamp":1533212026000},"page":"216-234","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["From Fairness to Full Security in Multiparty Computation"],"prefix":"10.1007","author":[{"given":"Ran","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Iftach","family":"Haitner","sequence":"additional","affiliation":[]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[]},{"given":"Lior","family":"Rotem","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,3]]},"reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-662-53641-4_13","volume-title":"Theory of Cryptography","author":"B Alon","year":"2016","unstructured":"Alon, B., Omri, E.: Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious. In: Hirt, M., Smith, A. (eds.) TCC 2016 Part I. LNCS, vol. 9985, pp. 307\u2013335. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53641-4_13"},{"key":"12_CR2","unstructured":"Averbuch, B., Blum, M., Chor, B., Goldwasser, S., Micali, S.: How to implement Bracha\u2019s $${O}(\\log n)$$ Byzantine agreement algorithm (1985). Unpublished manuscript"},{"issue":"3","key":"12_CR3","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/s00145-013-9168-3","volume":"28","author":"A Beimel","year":"2015","unstructured":"Beimel, A., Omri, E., Orlov, I.: Protocols for multiparty coin toss with a dishonest majority. JCRYPTOL 28(3), 551\u2013600 (2015)","journal-title":"JCRYPTOL"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Buchbinder, N., Haitner, I., Levi, N., Tsfadia, E.: Fair coin flipping: tighter analysis and the many-party case. In: SODA, pp. 2580\u20132600 (2017)","DOI":"10.1137\/1.9781611974782.170"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"issue":"4","key":"12_CR6","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1007\/s00145-016-9245-5","volume":"30","author":"R Cohen","year":"2017","unstructured":"Cohen, R., Lindell, Y.: Fairness versus guaranteed output delivery in secure multiparty computation. JCRYPTOL 30(4), 1157\u20131186 (2017)","journal-title":"JCRYPTOL"},{"issue":"2","key":"12_CR7","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s00145-017-9264-x","volume":"31","author":"R Cohen","year":"2018","unstructured":"Cohen, R., Haitner, I., Omri, E., Rotem, L.: Characterization of secure multiparty computation without broadcast. JCRYPTOL 31(2), 587\u2013609 (2018)","journal-title":"JCRYPTOL"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Cohen, R., Haitner, I., Omri, E., Rotem, L.: From fairness to full security in multiparty computation. Manuscript (2018)","DOI":"10.1007\/978-3-319-98113-0_12"},{"key":"12_CR9","unstructured":"Feige, U.: Noncryptographic selection protocols. In: FOCS, pp. 142\u2013153 (1999)"},{"key":"12_CR10","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":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-00457-5_2","volume-title":"Theory of Cryptography","author":"SD Gordon","year":"2009","unstructured":"Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 19\u201335. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_2"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Gradwohl, R., Vadhan, S.P., Zuckerman, D.: Random selection with an adversarial majority. In: CRYPTO 2006, pp. 409\u2013426 (2006)","DOI":"10.1007\/11818175_25"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Haitner, I., Tsfadia, E.: An almost-optimally fair three-party coin-flipping protocol. In: STOC, pp. 817\u2013836 (2014)","DOI":"10.1145\/2591796.2591842"},{"key":"12_CR14","series-title":"Information Security and Cryptography","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14303-8","volume-title":"Efficient Secure Two-Party Protocols - Techniques and Constructions","author":"C Hazay","year":"2010","unstructured":"Hazay, C., Lindell, Y.: Efficient Secure Two-Party Protocols - Techniques and Constructions. Information Security and Cryptography. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14303-8"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: STOC, pp. 21\u201330 (2007)","DOI":"10.1145\/1250790.1250794"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/100783224","volume":"40","author":"Y Ishai","year":"2011","unstructured":"Ishai, Y., Katz, J., Kushilevitz, E., Lindell, Y., Petrank, E.: On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. SICOMP 40(1), 122\u2013141 (2011)","journal-title":"SICOMP"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-662-44381-1_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"Y Ishai","year":"2014","unstructured":"Ishai, Y., Ostrovsky, R., Zikas, V.: Secure multi-party computation with identifiable abort. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014 Part II. LNCS, vol. 8617, pp. 369\u2013386. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44381-1_21"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/978-3-662-53008-5_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"Y Ishai","year":"2016","unstructured":"Ishai, Y., Kushilevitz, E., Prabhakaran, M., Sahai, A., Yu, C.-H.: Secure protocol transformations. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016 Part II. LNCS, vol. 9815, pp. 430\u2013458. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_15"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-10879-7_9","volume-title":"Security and Cryptography for Networks","author":"N Makriyannis","year":"2014","unstructured":"Makriyannis, N.: On the classification of finite Boolean functions up to fairness. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 135\u2013154. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10879-7_9"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_1"},{"issue":"2","key":"12_CR21","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. JCRYPTOL 4(2), 151\u2013158 (1991). Preliminary version in CRYPTO \u201989","journal-title":"JCRYPTOL"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Pass, R.: Bounded-concurrent secure multi-party computation with a dishonest majority. In: STOC, pp. 232\u2013241 (2004)","DOI":"10.1145\/1007352.1007393"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98113-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:45:27Z","timestamp":1710348327000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98113-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319981123","9783319981130"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98113-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"3 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Cryptography for Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amalfi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scn2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/scn.di.unisa.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}