{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:58:05Z","timestamp":1764133085768},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,22]],"date-time":"2017-09-22T00:00:00Z","timestamp":1506038400000},"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":[[2018,4]]},"DOI":"10.1007\/s00145-017-9264-x","type":"journal-article","created":{"date-parts":[[2017,9,22]],"date-time":"2017-09-22T19:39:04Z","timestamp":1506109144000},"page":"587-609","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Characterization of Secure Multiparty Computation Without Broadcast"],"prefix":"10.1007","volume":"31","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":[[2017,9,22]]},"reference":[{"key":"9264_CR1","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"},{"issue":"3","key":"9264_CR2","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. Journal of Cryptology. 28(3), 551\u2013600 (2015)","journal-title":"J. Cryptol."},{"key":"9264_CR3","unstructured":"M.\u00a0Ben-Or, S.\u00a0Goldwasser, A.\u00a0Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract), in Proceedings of the 29th Annual Symposium on Foundations of Computer Science (FOCS). (1988) pp. 1\u201310"},{"key":"9264_CR4","unstructured":"M.\u00a0Blum. Coin flipping by telephone, in Advances in Cryptology\u2014CRYPTO \u201981. (1981) pp. 11\u201315"},{"key":"9264_CR5","unstructured":"A.Z. Broder, D.\u00a0Dolev. Flipping coins in many pockets (Byzantine agreement on uniformly random values), in Proceedings of the 25th Annual Symposium on Foundations of Computer Science (FOCS). (1984) pp. 157\u2013170"},{"key":"9264_CR6","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"},{"key":"9264_CR7","unstructured":"D.\u00a0Chaum, C.\u00a0Cr\u00e9peau, I.\u00a0Damg\u00e5rd. Multiparty unconditionally secure protocols (extended abstract), in Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC). (1988) pp. 11\u201319"},{"key":"9264_CR8","unstructured":"B.\u00a0Chor, S.\u00a0Goldwasser, S.\u00a0Micali, B.\u00a0Awerbuch. Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract), in Proceedings of the 26th Annual Symposium on Foundations of Computer Science (FOCS). (1985) pp. 383\u2013395"},{"key":"9264_CR9","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cleve. Limits on the security of coin flips when half the processors are faulty, in Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC). (1986) pp. 364\u2013369","DOI":"10.1145\/12130.12168"},{"key":"9264_CR10","unstructured":"R.\u00a0Cohen, Y.\u00a0Lindell. Fairness versus guaranteed output delivery in secure multiparty computation, in Advances in Cryptology\u2014ASIACRYPT 2014, part II. (2014) pp. 466\u2013485"},{"key":"9264_CR11","unstructured":"R.\u00a0Cohen, I.\u00a0Haitner, E.\u00a0Omri, L.\u00a0Rotem. Characterization of secure multiparty computation without broadcast, in Proceedings of the 13th Theory of Cryptography Conference, TCC 2016-A, part I. (2016) pp. 596\u2013616"},{"key":"9264_CR12","doi-asserted-by":"crossref","unstructured":"R.\u00a0Cohen, I.\u00a0Haitner, E.\u00a0Omri, L.\u00a0Rotem. From fairness to full security in multiparty computation. Manuscript. (2017)","DOI":"10.1007\/978-3-319-98113-0_12"},{"issue":"4","key":"9264_CR13","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"D.\u00a0Dolev, R.\u00a0Strong. Authenticated algorithms for Byzantine agreement. SIAM Journal on Computing. 12(4), 656\u2013666, (1983)","journal-title":"SIAM J. Comput."},{"key":"9264_CR14","unstructured":"M.J. Fischer, N.A. Lynch, M.\u00a0Merritt. Easy impossibility proofs for distributed consensus problems, in Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing (PODC). (1985) pp. 59\u201370"},{"key":"9264_CR15","unstructured":"M.\u00a0Fitzi, D.\u00a0Gottesman, M.\u00a0Hirt, T.\u00a0Holenstein, A.\u00a0Smith. Detectable Byzantine agreement secure against faulty majorities, in Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC). (2002) pp. 118\u2013126"},{"key":"9264_CR16","unstructured":"M.\u00a0Fitzi, M.\u00a0Hirt, T.\u00a0Holenstein, J.\u00a0Wullschleger. Two-threshold broadcast and detectable multi-party computation, in Advances in Cryptology\u2014EUROCRYPT 2003. (2003) pp. 51\u201367"},{"key":"9264_CR17","doi-asserted-by":"crossref","unstructured":"O.\u00a0Goldreich. Foundations of Cryptography\u2014VOLUME 2: Basic Applications. Cambridge University Press, (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"9264_CR18","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"},{"issue":"3","key":"9264_CR19","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00145-005-0319-z","volume":"18","author":"S Goldwasser","year":"2005","unstructured":"S.\u00a0Goldwasser, Y.\u00a0Lindell. Secure multi-party computation without agreement. Journal of Cryptology. 18(3), 247\u2013287 (2005)","journal-title":"J. Cryptol."},{"key":"9264_CR20","unstructured":"D.\u00a0Gordon, J.\u00a0Katz. Complete fairness in multi-party computation without an honest majority, in Proceedings of the 6th Theory of Cryptography Conference, TCC 2009. (2009) pp. 19\u201335"},{"key":"9264_CR21","unstructured":"R.L. Graham, A.C. Yao. On the improbability of reaching byzantine agreements (preliminary version), in Proceedings of the 21st Annual ACM Symposium on Theory of Computing (STOC). (1989) pp. 467\u2013478"},{"key":"9264_CR22","unstructured":"I.\u00a0Haitner, E.\u00a0Tsfadia. An almost-optimally fair three-party coin-flipping protocol, in Proceedings of the 46th Annual ACM Symposium on Theory of Computing (STOC). (2014) pp. 817\u2013836"},{"issue":"3","key":"9264_CR23","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1145\/2402.322398","volume":"30","author":"L Lamport","year":"1983","unstructured":"L.\u00a0Lamport. The weak Byzantine generals problem. Journal of the ACM. 30(3), 668\u2013676 (1983)","journal-title":"J. ACM."},{"issue":"3","key":"9264_CR24","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"L.\u00a0Lamport, R.\u00a0E. Shostak, M.\u00a0C. Pease. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Programm. Lang. Syst."},{"key":"9264_CR25","unstructured":"T.\u00a0Moran, M.\u00a0Naor, G.\u00a0Segev. An optimally fair coin toss, in Proceedings of the 6th Theory of Cryptography Conference, TCC 2009. (2009) pp. 1\u201318"},{"issue":"2","key":"9264_CR26","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"MC Pease","year":"1980","unstructured":"M.\u00a0C. Pease, R.\u00a0E. Shostak, L.\u00a0Lamport. Reaching agreement in the presence of faults. Journal of the ACM. 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"9264_CR27","unstructured":"B.\u00a0Pfitzmann, M.\u00a0Waidner. Unconditional Byzantine agreement for any number of faulty processors, in Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS). (1992) pp. 339\u2013350"},{"key":"9264_CR28","unstructured":"T.\u00a0Rabin, M.\u00a0Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority (extended abstract), in Proceedings of the 30th Annual Symposium on Foundations of Computer Science (FOCS). (1989) pp. 73\u201385"},{"key":"9264_CR29","doi-asserted-by":"crossref","unstructured":"A.C. Yao. Protocols for secure computations, in Proceedings of the 23th 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":"http:\/\/link.springer.com\/article\/10.1007\/s00145-017-9264-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-017-9264-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-017-9264-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:05:29Z","timestamp":1586333129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-017-9264-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,22]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["9264"],"URL":"https:\/\/doi.org\/10.1007\/s00145-017-9264-x","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,22]]},"assertion":[{"value":"8 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 July 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 September 2017","order":3,"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"}]}}