{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,10]],"date-time":"2023-08-10T04:17:41Z","timestamp":1691641061160},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T00:00:00Z","timestamp":1686096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s00145-023-09456-4","type":"journal-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T20:32:12Z","timestamp":1686169932000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Power of an Honest Majority in Three-Party Computation Without Broadcast"],"prefix":"10.1007","volume":"36","author":[{"given":"Bar","family":"Alon","sequence":"first","affiliation":[]},{"given":"Ran","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Eran","family":"Omri","sequence":"additional","affiliation":[]},{"given":"Tom","family":"Suad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"key":"9456_CR1","doi-asserted-by":"crossref","unstructured":"S.\u00a0Agrawal, M.\u00a0Prabhakaran, On fair exchange, fair coins and fair sampling, in 32nd Annual International Cryptology Conference (CRYPTO), Part I (2013), pp. 259\u2013276","DOI":"10.1007\/978-3-642-40041-4_15"},{"key":"9456_CR2","doi-asserted-by":"crossref","unstructured":"B.\u00a0Alon, E.\u00a0Omri, Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious, in Proceedings of the 14th Theory of Cryptography Conference (TCC 2016-B), Part I (2016), pp. 307\u2013335","DOI":"10.1007\/978-3-662-53641-4_13"},{"key":"9456_CR3","doi-asserted-by":"crossref","unstructured":"B.\u00a0Alon, R.\u00a0Cohen, E.\u00a0Omri, T.\u00a0Suad, On the power of an honest majority in three-party computation without broadcast, in Proceedings of the 18th Theory of Cryptography Conference (TCC), Part II (2020), pp. 621\u2013651","DOI":"10.1007\/978-3-030-64378-2_22"},{"key":"9456_CR4","doi-asserted-by":"crossref","unstructured":"G.\u00a0Asharov, Towards characterizing complete fairness in secure two-party computation, in Proceedings of the 11th Theory of Cryptography Conference (TCC) (2014), pp. 291\u2013316","DOI":"10.1007\/978-3-642-54242-8_13"},{"key":"9456_CR5","doi-asserted-by":"crossref","unstructured":"G.\u00a0Asharov, A.\u00a0Beimel, N.\u00a0Makriyannis, E.\u00a0Omri, Complete characterization of fairness in secure two-party computation of Boolean functions, in Proceedings of the 12th Theory of Cryptography Conference (TCC), Part I (2015), pp. 199\u2013228","DOI":"10.1007\/978-3-662-46494-6_10"},{"key":"9456_CR6","doi-asserted-by":"crossref","unstructured":"N.\u00a0Asokan, V.\u00a0Shoup, M.\u00a0Waidner, Optimistic fair exchange of digital signatures (extended abstract), in 17th International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (1998), pp. 591\u2013606","DOI":"10.1007\/BFb0054156"},{"issue":"3","key":"9456_CR7","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00145-013-9168-3","volume":"28","author":"A Beimel","year":"2015","unstructured":"A.\u00a0Beimel, E.\u00a0Omri, I.\u00a0Orlov, Protocols for multiparty coin toss with a dishonest majority. J. Cryptol. 28(3), 551\u2013600 (2015)","journal-title":"J. Cryptol."},{"key":"9456_CR8","doi-asserted-by":"crossref","unstructured":"A.\u00a0Beimel, I.\u00a0Haitner, N.\u00a0Makriyannis, E.\u00a0Omri, Tighter bounds on multi-party coin flipping via augmented weak martingales and differentially private sampling, in Proceedings of the 59th Annual Symposium on Foundations of Computer Science (FOCS) (2018), pp. 838\u2013849","DOI":"10.1109\/FOCS.2018.00084"},{"key":"9456_CR9","doi-asserted-by":"crossref","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, A.\u00a0Wigderson, Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC) (1988), pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"key":"9456_CR10","unstructured":"M.\u00a0Blum, Coin flipping by telephone, in 1st Annual International Cryptology Conference (CRYPTO) (1981), pp. 11\u201315"},{"key":"9456_CR11","doi-asserted-by":"crossref","unstructured":"M.\u00a0Borderding, Levels of authentication in distributed agreement, in 10th International Workshop on Distributed Algorithms WDAG (1996), pp. 40\u201355","DOI":"10.1007\/3-540-61769-8_4"},{"issue":"4","key":"9456_CR12","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1145\/4221.214134","volume":"32","author":"G Bracha","year":"1985","unstructured":"G.\u00a0Bracha, S.\u00a0Toueg, Asynchronous consensus and broadcast protocols. J. ACM 32(4), 824\u2013840 (1985)","journal-title":"J. ACM"},{"key":"9456_CR13","doi-asserted-by":"crossref","unstructured":"N.\u00a0Buchbinder, I.\u00a0Haitner, N.\u00a0Levi, E.\u00a0Tsfadia, Fair coin flipping: Tighter analysis and the many-party case, in Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2017), pp. 2580\u20132600","DOI":"10.1137\/1.9781611974782.170"},{"key":"9456_CR14","doi-asserted-by":"crossref","unstructured":"C.\u00a0Cachin, J.\u00a0Camenisch, Optimistic fair secure computation, in 19th Annual International Cryptology Conference (CRYPTO) (2000), pp. 93\u2013111","DOI":"10.1007\/3-540-44598-6_6"},{"issue":"1","key":"9456_CR15","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R Canetti","year":"2000","unstructured":"R.\u00a0Canetti, Security and composition of multiparty cryptographic protocols. J. Cryptol. 13(1), 143\u2013202 (2000)","journal-title":"J. Cryptol."},{"key":"9456_CR16","doi-asserted-by":"crossref","unstructured":"D.\u00a0Chaum, C.\u00a0Cr\u00e9peau, I.\u00a0Damg\u00e5rd, Multiparty unconditionally secure protocols (extended abstract), in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC) (1988), pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"9456_CR17","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cleve, Limits on the security of coin flips when half the processors are faulty (extended abstract), in Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC) (1986), pp. 364\u2013369","DOI":"10.1145\/12130.12168"},{"issue":"4","key":"9456_CR18","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1007\/s00145-016-9245-5","volume":"30","author":"R Cohen","year":"2017","unstructured":"R.\u00a0Cohen, Y.\u00a0Lindell, Fairness versus guaranteed output delivery in secure multiparty computation. J. Cryptol. 30(4), 1157\u20131186 (2017)","journal-title":"J. Cryptol."},{"issue":"2","key":"9456_CR19","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/s00145-017-9264-x","volume":"31","author":"R Cohen","year":"2018","unstructured":"R.\u00a0Cohen, I.\u00a0Haitner, E.\u00a0Omri, L.\u00a0Rotem, Characterization of secure multiparty computation without broadcast. J. Cryptol. 31(2), 587\u2013609 (2018)","journal-title":"J. Cryptol."},{"issue":"1","key":"9456_CR20","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/s00145-021-09415-x","volume":"35","author":"R Cohen","year":"2022","unstructured":"R.\u00a0Cohen, I.\u00a0Haitner, E.\u00a0Omri, L.\u00a0Rotem, From fairness to full security in multiparty computation. J. Cryptol. 35(1), 4 (2022)","journal-title":"J. Cryptol."},{"issue":"2","key":"9456_CR21","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/42282.42283","volume":"35","author":"C Dwork","year":"1988","unstructured":"C.\u00a0Dwork, N.A. Lynch, L.J. Stockmeyer, Consensus in the presence of partial synchrony. J. ACM 35(2), 288\u2013323 (1988)","journal-title":"J. ACM"},{"issue":"1","key":"9456_CR22","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01843568","volume":"1","author":"MJ Fischer","year":"1986","unstructured":"M.J. Fischer, N.A. Lynch, M.\u00a0Merritt, Easy impossibility proofs for distributed consensus problems. Distrib. Comput. 1(1), 26\u201339 (1986)","journal-title":"Distrib. Comput."},{"key":"9456_CR23","doi-asserted-by":"crossref","unstructured":"M.\u00a0Fitzi, N.\u00a0Gisin, U.M. Maurer, O.\u00a0von Rotz, Unconditional byzantine agreement and multi-party computation secure against dishonest minorities from scratch, in 21st International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT) (2002), pp. 482\u2013501","DOI":"10.1007\/3-540-46035-7_32"},{"key":"9456_CR24","doi-asserted-by":"crossref","unstructured":"M.\u00a0Fitzi, D.\u00a0Gottesman, M.\u00a0Hirt, T.\u00a0Holenstein, A.D. Smith, Detectable byzantine agreement secure against faulty majorities, in Proceedings of the 21th Annual ACM Symposium on Principles of Distributed Computing (PODC) (2002), pp. 118\u2013126","DOI":"10.1145\/571825.571841"},{"issue":"1","key":"9456_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00145-004-0150-y","volume":"18","author":"M Fitzi","year":"2005","unstructured":"M.\u00a0Fitzi, J.\u00a0A. Garay, U.\u00a0M. Maurer, and R.\u00a0Ostrovsky. Minimal complete primitives for secure multi-party computation. Journal of Cryptology, 18(1):37\u201361, 2005.","journal-title":"J. Cryptol."},{"key":"9456_CR26","doi-asserted-by":"crossref","unstructured":"J.A. Garay, A.\u00a0Kiayias, R.M. Ostrovsky, G.\u00a0Panagiotakos, V.\u00a0Zikas, Resource-restricted cryptography: Revisiting MPC bounds in the proof-of-work era, in 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT), Part II (2020), pp. 129\u2013158","DOI":"10.1007\/978-3-030-45724-2_5"},{"key":"9456_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography\u2014 Volume 2: Basic Applications","author":"O Goldreich","year":"2004","unstructured":"O.\u00a0Goldreich. Foundations of Cryptography \u2013 2: Basic Applications. Cambridge University Press, , 2004."},{"key":"9456_CR28","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich, S.\u00a0Micali, A.\u00a0Wigderson, How to play any mental game or a completeness theorem for protocols with honest majority, in Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC) (1987), pp. 218\u2013229","DOI":"10.1145\/28395.28420"},{"key":"9456_CR29","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, C.\u00a0Hazay, J.\u00a0Katz, Y.\u00a0Lindell, Complete fairness in secure two-party computation, in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC) (2008), pp. 413\u2013422","DOI":"10.1145\/1374376.1374436"},{"issue":"2","key":"9456_CR30","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1137\/15M1009147","volume":"46","author":"I Haitner","year":"2017","unstructured":"I.\u00a0Haitner, E.\u00a0Tsfadia, An almost-optimally fair three-party coin-flipping protocol. SIAM J. Comput. 46(2), 479\u2013542 (2017)","journal-title":"SIAM J. Comput."},{"key":"9456_CR31","doi-asserted-by":"crossref","unstructured":"I.\u00a0Haitner, N.\u00a0Makriyannis, E.\u00a0Omri, On the complexity of fair coin flipping, in Proceedings of the 16th Theory of Cryptography Conference (TCC), Part I (2018), pp. 539\u2013562","DOI":"10.1007\/978-3-030-03807-6_20"},{"key":"9456_CR32","doi-asserted-by":"crossref","unstructured":"S.\u00a0Halevi, Y.\u00a0Ishai, E.\u00a0Kushilevitz, N.\u00a0Makriyannis, T.\u00a0Rabin, On fully secure MPC with solitary output, in Proceedings of the 17th Theory of Cryptography Conference (TCC), Part I (2019), pp. 312\u2013340","DOI":"10.1007\/978-3-030-36030-6_13"},{"key":"9456_CR33","doi-asserted-by":"crossref","unstructured":"J.\u00a0Kilian, Founding cryptography on oblivious transfer, in Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC) (1988), pp. 20\u201331","DOI":"10.1145\/62212.62215"},{"issue":"3","key":"9456_CR34","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"L.\u00a0Lamport, R.E. Shostak, M.C. Pease. The byzantine generals problem. ACM Trans. Program. Lang. Syst. (TOPLAS) 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"9456_CR35","doi-asserted-by":"crossref","unstructured":"N.\u00a0Makriyannis, On the classification of finite Boolean functions up to fairness, in Proceedings of the 9th Conference on Security and Cryptography for Networks (SCN) (2014), pp. 135\u2013154","DOI":"10.1007\/978-3-319-10879-7_9"},{"issue":"3","key":"9456_CR36","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00145-015-9199-z","volume":"29","author":"T Moran","year":"2016","unstructured":"T.\u00a0Moran, M.\u00a0Naor, G.\u00a0Segev, An optimally fair coin toss. J. Cryptol. 29(3), 491\u2013513 (2016)","journal-title":"J. Cryptol."},{"issue":"2","key":"9456_CR37","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"M.C. Pease, R.E. Shostak, L.\u00a0Lamport, Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"9456_CR38","doi-asserted-by":"crossref","unstructured":"T.\u00a0Rabin, M.\u00a0Ben-Or, Verifiable secret sharing and multiparty protocols with honest majority (extended abstract), in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC) (1989), pp. 73\u201385","DOI":"10.1145\/73007.73014"},{"key":"9456_CR39","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Protocols for secure computations (extended abstract), in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS) (1982), pp. 160\u2013164","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09456-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-023-09456-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-023-09456-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T16:10:13Z","timestamp":1691597413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-023-09456-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,7]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["9456"],"URL":"https:\/\/doi.org\/10.1007\/s00145-023-09456-4","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,7]]},"assertion":[{"value":"4 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"25"}}