{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T17:07:37Z","timestamp":1781284057826,"version":"3.54.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T00:00:00Z","timestamp":1474588800000},"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":[[2017,10]]},"DOI":"10.1007\/s00145-016-9245-5","type":"journal-article","created":{"date-parts":[[2016,9,23]],"date-time":"2016-09-23T19:39:23Z","timestamp":1474659563000},"page":"1157-1186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Fairness Versus Guaranteed Output Delivery in Secure Multiparty Computation"],"prefix":"10.1007","volume":"30","author":[{"given":"Ran","family":"Cohen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yehuda","family":"Lindell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,23]]},"reference":[{"issue":"2","key":"9245_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 and Y. Lindell. Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. Journal of Cryptology, 23(2):281\u2013343, 2010.","journal-title":"Journal of Cryptology"},{"key":"9245_CR2","doi-asserted-by":"crossref","unstructured":"G. Asharov. 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":"9245_CR3","doi-asserted-by":"crossref","unstructured":"D. Beaver. Foundations of Secure Interactive Computing. In Advances in Cryptology\u2013CRYPTO \u201991, (1991), pp. 377\u2013391.","DOI":"10.1007\/3-540-46766-1_31"},{"issue":"1","key":"9245_CR4","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. Journal of Cryptology, 13(1):143\u2013202, 2000.","journal-title":"Journal of Cryptology"},{"key":"9245_CR5","unstructured":"R. Cohen, Y. Lindell. Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation. In Advances in Cryptology\u2014ASIACRYPT 2014, part II, (2014), pp. 466\u2013485."},{"key":"9245_CR6","doi-asserted-by":"crossref","unstructured":"R. Cleve. 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"},{"issue":"4","key":"9245_CR7","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/0212045","volume":"12","author":"D Dolev","year":"1983","unstructured":"D. Dolev and H. R. Strong. Authenticated Algorithms for Byzantine Agreement. SIAM Journal on Computing, 12(4):656\u2013666, 1983.","journal-title":"SIAM Journal on Computing"},{"key":"9245_CR8","unstructured":"M. Fitzi, D. Gottesman, M. Hirt, T. Holenstein, A. Smith. 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":"9245_CR9","doi-asserted-by":"crossref","unstructured":"M. Fitzi, N. Gisin, M. Maurer, O. von Rotz. Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch. In Advances in Cryptology\u2014EUROCRYPT 2002 (Springer, Berlin, 2002) pp. 482\u2013501.","DOI":"10.1007\/3-540-46035-7_32"},{"key":"9245_CR10","unstructured":"D. Gordon, C. Hazay, J. Katz, Y. Lindell. Complete Fairness in Secure Two-Party Computation. In Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC), (2008), pp. 413\u2013422."},{"key":"9245_CR11","unstructured":"D. Gordon, J. Katz. 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":"9245_CR12","unstructured":"S. Goldwasser, L.A. Levin. Fair Computation of General Functions in Presence of Immoral Majority. In Advances in Cryptology\u2014CRYPTO \u201990 (1990), pp. 77\u201393."},{"issue":"3","key":"9245_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 and Y. Lindell. Secure Multi-Party Computation without Agreement. Journal of Cryptology, 18(3):247\u2013287, 2005.","journal-title":"Journal of Cryptology"},{"key":"9245_CR14","unstructured":"O. Goldreich, S. Micali, A. Wigderson. 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."},{"key":"9245_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography -","author":"O Goldreich","year":"2004","unstructured":"O. Goldreich. The Foundations of Cryptography - Volume 2, Basic Applications. Cambridge University Press, 2004."},{"key":"9245_CR16","doi-asserted-by":"crossref","unstructured":"J. Kilian. A General Completeness Theorem for Two-Party Games. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC) (1991), pp. 553\u2013560.","DOI":"10.1145\/103418.103475"},{"issue":"3","key":"9245_CR17","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"L. Lamport, R. E. Shostak, and M. C. Pease. The Byzantine Generals Problem. ACM Transactions on Programming Languages and Systems, 4(3):382\u2013401, 1982.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9245_CR18","unstructured":"S. Micali, P. Rogaway. Secure Computation (Abstract). In Advances in Cryptology \u2013 CRYPTO \u201991 (1991), pp. 392\u2013404."},{"issue":"2","key":"9245_CR19","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, and L. Lamport. Reaching Agreement in the Presence of Faults. Journal of the ACM, 27(2):228\u2013234, 1980.","journal-title":"Journal of the ACM"},{"key":"9245_CR20","unstructured":"B. Pfitzmann, M. Waidner. 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":"9245_CR21","unstructured":"T. Rabin, M. Ben-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."}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-016-9245-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-016-9245-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-016-9245-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:21:03Z","timestamp":1586334063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-016-9245-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,23]]},"references-count":21,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9245"],"URL":"https:\/\/doi.org\/10.1007\/s00145-016-9245-5","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,23]]},"assertion":[{"value":"12 November 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 July 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2016","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"}]}}