{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:48Z","timestamp":1766281008401},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T00:00:00Z","timestamp":1284508800000},"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":[[2012,1]]},"DOI":"10.1007\/s00145-010-9079-5","type":"journal-article","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T19:15:30Z","timestamp":1284491730000},"page":"14-40","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Partial Fairness in Secure Two-Party Computation"],"prefix":"10.1007","volume":"25","author":[{"given":"S. Dov","family":"Gordon","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,15]]},"reference":[{"key":"9079_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-70936-7_8","volume-title":"Theory of Cryptography Conference\u2014TCC 2007","author":"Y. Aumann","year":"2007","unstructured":"Y. Aumann, Y. Lindell, Security against covert adversaries: efficient protocols for realistic adversaries, in Theory of Cryptography Conference\u2014TCC 2007. LNCS, vol.\u00a04392 (Springer, Berlin, 2007), pp.\u00a0137\u2013156"},{"key":"9079_CR2","series-title":"LNCS","first-page":"377","volume-title":"Advances in Cryptology\u2014Crypto\u00a0\u201991","author":"D. Beaver","year":"1992","unstructured":"D. Beaver, Foundations of secure interactive computing, in Advances in Cryptology\u2014Crypto\u00a0\u201991. LNCS, vol.\u00a0576 (Springer, Berlin, 1992), pp.\u00a0377\u2013391"},{"key":"9079_CR3","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/SFCS.1989.63520","volume-title":"30th Annual Symposium on Foundations of Computer Science (FOCS)","author":"D. Beaver","year":"1989","unstructured":"D. Beaver, S. Goldwasser, Multiparty computation with faulty majority, in 30th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Press, New York, 1989), pp.\u00a0468\u2013473"},{"key":"9079_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-642-14623-7_29","volume-title":"Advances in Cryptology\u2014Crypto 2010","author":"A. Beimel","year":"2010","unstructured":"A. Beimel, E. Omri, I. Orlov, Protocols for multiparty coin toss with dishonest majority, in Advances in Cryptology\u2014Crypto 2010. LNCS, vol.\u00a06223 (Springer, Berlin, 2010), pp.\u00a0538\u2013557"},{"issue":"1","key":"9079_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.50372","volume":"36","author":"M. Ben-Or","year":"1990","unstructured":"M. Ben-Or, O. Goldreich, S. Micali, R. Rivest, A\u00a0fair protocol for signing contracts. IEEE Trans. Inf. Theory\n                           36(1), 40\u201346 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9079_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M. Blum","year":"1984","unstructured":"M. Blum, How to exchange (secret) keys. ACM Trans. Comput. Syst.\n                           1, 175\u2013193 (1984)","journal-title":"ACM Trans. Comput. Syst."},{"key":"9079_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology\u2014Crypto 2000","author":"D. Boneh","year":"2000","unstructured":"D. Boneh, M. Naor, Timed commitments, in Advances in Cryptology\u2014Crypto 2000. LNCS, vol.\u00a01880 (Springer, Berlin, 2000), pp.\u00a0236\u2013254"},{"key":"9079_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44598-6_6","volume-title":"Advances in Cryptology \u2014Crypto 2000","author":"C. Cachin","year":"2000","unstructured":"C. Cachin, J. Camenisch, Optimistic fair secure computation, in Advances in Cryptology \u2014Crypto 2000. LNCS, vol.\u00a01880 (Springer, Berlin, 2000), pp.\u00a093\u2013111"},{"issue":"1","key":"9079_CR9","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.\u00a0Cryptol.\n                           13(1), 143\u2013202 (2000)","journal-title":"J.\u00a0Cryptol."},{"key":"9079_CR10","first-page":"136","volume-title":"42nd Annual Symposium on Foundations of Computer Science (FOCS)","author":"R. Canetti","year":"2001","unstructured":"R. Canetti, Universally composable security: a new paradigm for cryptographic protocols, in 42nd Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Press, New York, 2001), pp.\u00a0136\u2013145"},{"key":"9079_CR11","first-page":"364","volume-title":"18th Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Cleve","year":"1986","unstructured":"R. Cleve, Limits on the security of coin flips when half the processors are faulty, in 18th Annual ACM Symposium on Theory of Computing (STOC) (Assoc. Comput. Mach., New York, 1986), pp.\u00a0364\u2013369"},{"key":"9079_CR12","series-title":"LNCS","first-page":"573","volume-title":"Advances in Cryptology\u2014Crypto\u00a0\u201989","author":"R. Cleve","year":"1990","unstructured":"R. Cleve, Controlled gradual disclosure schemes for random bits and their applications, in Advances in Cryptology\u2014Crypto\u00a0\u201989. LNCS, vol.\u00a0435 (Springer, Berlin, 1990), pp. 573\u2013588"},{"issue":"4","key":"9079_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00191356","volume":"8","author":"I. Damg\u00e5rd","year":"1995","unstructured":"I. Damg\u00e5rd, Practical and provably secure release of a secret and exchange of signatures. J.\u00a0Cryptol.\n                           8(4), 201\u2013222 (1995)","journal-title":"J.\u00a0Cryptol."},{"issue":"6","key":"9079_CR14","first-page":"851","volume":"51","author":"C. Dwork","year":"2004","unstructured":"C. Dwork, M. Naor, A. Sahai, Concurrent zero-knowledge. J.\u00a0ACM\n                           51(6), 851\u2013898 (2004)","journal-title":"J.\u00a0ACM"},{"issue":"6","key":"9079_CR15","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"S. Even, O. Goldreich, A. Lempel, A\u00a0randomized protocol for signing contracts. Commun. ACM\n                           28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"9079_CR16","unstructured":"M. Franklin, Complexity and security of distributed protocols. PhD thesis, Columbia University (1993)"},{"key":"9079_CR17","series-title":"LNCS","first-page":"135","volume-title":"Advances in Cryptology\u2014Crypto\u00a0\u201987","author":"Z. Galil","year":"1988","unstructured":"Z. Galil, S. Haber, M. Yung, Cryptographic computation: Secure faut-tolerant protocols and the public-key model, in Advances in Cryptology\u2014Crypto\u00a0\u201987. LNCS, vol.\u00a0293 (Springer, Berlin, 1988), pp.\u00a0135\u2013155"},{"key":"9079_CR18","series-title":"LNCS","first-page":"404","volume-title":"3rd Theory of Cryptography Conference\u2014TCC 2006","author":"J.A. Garay","year":"2006","unstructured":"J.A. Garay, P.D. MacKenzie, M. Prabhakaran, K. Yang, Resource fairness and composability of cryptographic protocols, in 3rd Theory of Cryptography Conference\u2014TCC 2006. LNCS, vol.\u00a03876 (Springer, Berlin, 2006), pp.\u00a0404\u2013428"},{"key":"9079_CR19","series-title":"Foundations of Cryptography","volume-title":"Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"O. Goldreich, Basic Applications. Foundations of Cryptography, vol.\u00a02 (Cambridge University Press, Cambridge, 2004)"},{"issue":"3","key":"9079_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00145-006-0233-z","volume":"19","author":"O. Goldreich","year":"2006","unstructured":"O. Goldreich, Y. Lindell, Session-key generation using human passwords only. J.\u00a0Cryptol.\n                           19(3), 241\u2013340 (2006)","journal-title":"J.\u00a0Cryptol."},{"key":"9079_CR21","series-title":"LNCS","first-page":"77","volume-title":"Advances in Cryptology\u2014Crypto\u00a0\u201990","author":"S. Goldwasser","year":"1991","unstructured":"S. Goldwasser, L.A. Levin, Fair computation of general functions in presence of immoral majority, in Advances in Cryptology\u2014Crypto\u00a0\u201990. LNCS, vol.\u00a0537 (Springer, Berlin, 1991), pp.\u00a077\u201393"},{"key":"9079_CR22","unstructured":"S.D. Gordon, Fairness in secure computation. PhD thesis, University of Maryland (2010)"},{"key":"9079_CR23","series-title":"LNCS","first-page":"19","volume-title":"6th Theory of Cryptography Conference\u2014TCC 2009","author":"S. Gordon","year":"2009","unstructured":"S. Gordon, J. Katz, Complete fairness in multi-party computation without an honest majority, in 6th Theory of Cryptography Conference\u2014TCC 2009. LNCS, vol.\u00a05444 (Springer, Berlin, 2009), pp.\u00a019\u201335"},{"key":"9079_CR24","first-page":"413","volume-title":"40th Annual ACM Symposium on Theory of Computing (STOC)","author":"S.D. Gordon","year":"2008","unstructured":"S.D. Gordon, C. Hazay, J. Katz, Y. Lindell, Complete fairness in secure two-party computation, in 40th Annual ACM Symposium on Theory of Computing (STOC) (Assoc. Comput. Mach., New York, 2008), pp.\u00a0413\u2013422"},{"key":"9079_CR25","first-page":"11","volume-title":"39th Annual ACM Symposium on Theory of Computing (STOC)","author":"J. Katz","year":"2007","unstructured":"J. Katz, On achieving the \u201cbest of both worlds\u201d in secure multiparty computation, in 39th Annual ACM Symposium on Theory of Computing (STOC) (Assoc. Comput. Mach., New York, 2007), pp.\u00a011\u201320"},{"key":"9079_CR26","first-page":"1","volume-title":"23rd Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"M. Lepinski","year":"2004","unstructured":"M. Lepinski, S. Micali, C. Peikert, A. Shelat, Completely fair SFE and coalition-safe cheap talk, in 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC) (Assoc. Comput. Mach., New York, 2004), pp.\u00a01\u201310"},{"key":"9079_CR27","first-page":"23","volume-title":"24th Annual Symposium on Foundations of Computer Science (FOCS)","author":"M. Luby","year":"1983","unstructured":"M. Luby, S. Micali, C. Rackoff, How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin, in 24th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Press, New York, 1983), pp.\u00a023\u201330"},{"key":"9079_CR28","series-title":"LNCS","first-page":"392","volume-title":"Advances in Cryptology\u2014Crypto\u00a0\u201991","author":"S. Micali","year":"1992","unstructured":"S. Micali, P. Rogaway, Secure computation, in Advances in Cryptology\u2014Crypto\u00a0\u201991. LNCS, vol.\u00a0576 (Springer, Berlin, 1992), pp.\u00a0392\u2013404"},{"key":"9079_CR29","series-title":"LNCS","first-page":"1","volume-title":"6th Theory of Cryptography Conference\u2014TCC 2009","author":"T. Moran","year":"2009","unstructured":"T. Moran, M. Naor, G. Segev, An optimally fair coin toss, in 6th Theory of Cryptography Conference\u2014TCC 2009. LNCS, vol.\u00a05444 (Springer, Berlin, 2009), pp.\u00a01\u201318"},{"key":"9079_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-39200-9_6","volume-title":"Advances in Cryptology\u2014Eurocrypt 2003","author":"B. Pinkas","year":"2003","unstructured":"B. Pinkas, Fair secure two-party computation, in Advances in Cryptology\u2014Eurocrypt 2003. LNCS, vol.\u00a02656 (Springer, Berlin, 2003), pp.\u00a087\u2013105"},{"key":"9079_CR31","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1109\/SFCS.1986.25","volume-title":"27th Annual Symposium on Foundations of Computer Science (FOCS)","author":"A.C.-C. Yao","year":"1986","unstructured":"A.C.-C. Yao, How to generate and exchange secrets, in 27th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE Press, New York, 1986), pp.\u00a0162\u2013167"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9079-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-010-9079-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9079-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-010-9079-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:49:00Z","timestamp":1586335740000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-010-9079-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,15]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["9079"],"URL":"https:\/\/doi.org\/10.1007\/s00145-010-9079-5","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,15]]},"assertion":[{"value":"10 March 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2010","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"}]}}