{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:50Z","timestamp":1766281010056},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T00:00:00Z","timestamp":1384819200000},"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":[[2015,7]]},"DOI":"10.1007\/s00145-013-9168-3","type":"journal-article","created":{"date-parts":[[2013,11,19]],"date-time":"2013-11-19T02:16:23Z","timestamp":1384827383000},"page":"551-600","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Protocols for Multiparty Coin Toss with a Dishonest Majority"],"prefix":"10.1007","volume":"28","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[]},{"given":"Ilan","family":"Orlov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,19]]},"reference":[{"issue":"2","key":"9168_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s00145-009-9040-7","volume":"23","author":"Y. Aumann","year":"2010","unstructured":"Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries. J. Cryptol.\n                  23(2), 281\u2013343 (2010)","journal-title":"J. Cryptol."},{"key":"9168_CR2","unstructured":"B. Averbuch, M. Blum, B. Chor, S. Goldwasser, S. Micali, How to implement Bracha\u2019s O(logn) Byzantine agreement algorithm, Unpublished manuscript (1985)"},{"key":"9168_CR3","first-page":"503","volume-title":"Proc. of the 22nd ACM Symp. on the Theory of Computing","author":"D. Beaver","year":"1990","unstructured":"D. Beaver, S. Micali, P. Rogaway, The round complexity of secure protocols, in Proc. of the 22nd ACM Symp. on the Theory of Computing (1990), pp. 503\u2013513"},{"key":"9168_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-22792-9_16","volume-title":"Advances in Cryptology, CRYPTO 2011","author":"A. Beimel","year":"2011","unstructured":"A. Beimel, Y. Lindell, E. Omri, I. Orlov, 1\/p-secure multiparty computation without honest majority and the best of both worlds, in Advances in Cryptology, CRYPTO 2011, ed. by P. Rogaway. Lecture Notes in Computer Science, vol.\u00a06841 (Springer, Berlin, 2011), pp. 277\u2013296"},{"issue":"1","key":"9168_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1008908.1008911","volume":"15","author":"M. Blum","year":"1983","unstructured":"M. Blum, Coin flipping by telephone a protocol for solving impossible problems. SIGACT News\n                  15(1), 23\u201327 (1983)","journal-title":"SIGACT News"},{"issue":"1","key":"9168_CR6","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. Cryptol.\n                  13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"9168_CR7","first-page":"494","volume-title":"Proc. of the 34th ACM Symp. on the Theory of Computing","author":"R. Canetti","year":"2002","unstructured":"R. Canetti, Y. Lindell, R. Ostrovsky, A. Sahai, Universally composable two-party and multi-party secure computation, in Proc. of the 34th ACM Symp. on the Theory of Computing (2002), pp. 494\u2013503"},{"key":"9168_CR8","first-page":"364","volume-title":"Proc. of the 18th ACM Symp. on the Theory of Computing","author":"R. Cleve","year":"1986","unstructured":"R. Cleve, Limits on the security of coin flips when half the processors are faulty, in Proc. of the 18th ACM Symp. on the Theory of Computing (1986), pp. 364\u2013369"},{"key":"9168_CR9","unstructured":"R. Cleve, R. Impagliazzo, Martingales, collective coin flipping and discrete control processes. Online version: \n                    http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.51.1797\n                    \n                   (1993)"},{"key":"9168_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography, Voume I: Basic Tools","author":"O. Goldreich","year":"2001","unstructured":"O. Goldreich, Foundations of Cryptography, Voume I: Basic Tools (Cambridge University Press, Cambridge, 2001)"},{"key":"9168_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography, Voume II: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Foundations of Cryptography, Voume II: Basic Applications (Cambridge University Press, Cambridge, 2004)"},{"key":"9168_CR12","first-page":"218","volume-title":"Proc. of the 19th ACM Symp. on the Theory of Computing","author":"O. Goldreich","year":"1987","unstructured":"O. Goldreich, S. Micali, A. Wigderson, How to play any mental game, in Proc. of the 19th ACM Symp. on the Theory of Computing (1987), pp. 218\u2013229"},{"issue":"3","key":"9168_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00145-005-0319-z","volume":"18","author":"S. Goldwasser","year":"2005","unstructured":"S. Goldwasser, Y. Lindell, Secure multi-party computation without agreement. J. Cryptol.\n                  18(3), 247\u2013287 (2005)","journal-title":"J. Cryptol."},{"issue":"6","key":"9168_CR14","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/2049697.2049698","volume":"58","author":"S.D. Gordon","year":"2011","unstructured":"S.D. Gordon, C. Hazay, J. Katz, Y. Lindell, Complete fairness in secure two-party computation. J. ACM\n                  58(6), 24 (2011)","journal-title":"J. ACM"},{"key":"9168_CR15","first-page":"229","volume-title":"Security in Communication Networks, SCN","author":"S.D. Gordon","year":"2006","unstructured":"S.D. Gordon, J. Katz, Rational secret sharing, revisited, in Security in Communication Networks, SCN (2006), pp. 229\u2013241"},{"key":"9168_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-13190-5_8","volume-title":"Advances in Cryptology, EUROCRYPT 2010","author":"S.D. Gordon","year":"2010","unstructured":"S.D. Gordon, J. Katz, Partial fairness in secure two-party computation, in Advances in Cryptology, EUROCRYPT 2010, ed. by H. Gilbert. Lecture Notes in Computer Science, vol.\u00a06110 (Springer, Berlin, 2010), pp. 157\u2013176"},{"issue":"1","key":"9168_CR17","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00145-010-9079-5","volume":"25","author":"S.D. Gordon","year":"2012","unstructured":"S.D. Gordon, J. Katz, Partial fairness in secure two-party computation. J. Cryptol.\n                  25(1), 14\u201340 (2012)","journal-title":"J. Cryptol."},{"key":"9168_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/11818175_29","volume-title":"Advances in Cryptology, CRYPTO 2006","author":"Y. Ishai","year":"2006","unstructured":"Y. Ishai, E. Kushilevitz, Y. Lindell, E. Petrank, On combining privacy with guaranteed output delivery in secure multiparty computation, in Advances in Cryptology, CRYPTO 2006. Lecture Notes in Computer Science, vol.\u00a04117 (Springer, Berlin, 2006), pp. 483\u2013500"},{"key":"9168_CR19","first-page":"21","volume-title":"Proc. of the Ninth Theory of Cryptography Conference, TCC 2012","author":"Y. Ishai","year":"2012","unstructured":"Y. Ishai, R. Ostrovsky, H. Seyalioglu, Identifying cheaters without an honest majority, in Proc. of the Ninth Theory of Cryptography Conference, TCC 2012 (2012), pp. 21\u201338"},{"key":"9168_CR20","first-page":"11","volume-title":"Proc. of the 39th ACM Symp. on the Theory of Computing","author":"J. Katz","year":"2007","unstructured":"J. Katz, On achieving the \u201cbest of both worlds\u201d in secure multiparty computation, in Proc. of the 39th ACM Symp. on the Theory of Computing (2007), pp. 11\u201320"},{"issue":"3","key":"9168_CR21","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. Cryptol.\n                  16(3), 143\u2013184 (2003)","journal-title":"J. Cryptol."},{"key":"9168_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00457-5_1","volume-title":"Proc. of the Sixth Theory of Cryptography Conference, TCC","author":"T. Moran","year":"2009","unstructured":"T. Moran, M. Naor, G. Segev, An optimally fair coin toss, in Proc. of the Sixth Theory of Cryptography Conference, TCC (2009), pp. 1\u201318"},{"key":"9168_CR23","first-page":"232","volume-title":"Proc. of the 36th ACM Symp. on the Theory of Computing","author":"R. Pass","year":"2004","unstructured":"R. Pass, Bounded-concurrent secure multi-party computation with a dishonest majority, in Proc. of the 36th ACM Symp. on the Theory of Computing (2004), pp. 232\u2013241"},{"key":"9168_CR24","first-page":"73","volume-title":"Proc. of the 21st ACM Symp. on the Theory of Computing","author":"T. Rabin","year":"1989","unstructured":"T. Rabin, M. Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority, in Proc. of the 21st ACM Symp. on the Theory of Computing (1989), pp. 73\u201385"},{"key":"9168_CR25","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to share a secret. Commun. ACM\n                  22, 612\u2013613 (1979)","journal-title":"Commun. ACM"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9168-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-013-9168-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9168-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-013-9168-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:15:33Z","timestamp":1586333733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-013-9168-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,19]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9168"],"URL":"https:\/\/doi.org\/10.1007\/s00145-013-9168-3","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,19]]},"assertion":[{"value":"5 October 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2013","order":2,"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"}]}}