{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:49:28Z","timestamp":1764132568055},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642131899"},{"type":"electronic","value":"9783642131905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13190-5_8","type":"book-chapter","created":{"date-parts":[[2010,5,19]],"date-time":"2010-05-19T13:16:46Z","timestamp":1274275006000},"page":"157-176","source":"Crossref","is-referenced-by-count":46,"title":["Partial Fairness in Secure Two-Party Computation"],"prefix":"10.1007","author":[{"given":"S. Dov","family":"Gordon","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-70936-7_8","volume-title":"Theory of Cryptography","author":"Y. Aumann","year":"2007","unstructured":"Aumann, Y., Lindell, Y.: Security against covert adversaries: Efficient protocols for realistic adversaries. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 137\u2013156. Springer, Heidelberg (2007)"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Beaver","year":"1992","unstructured":"Beaver, D.: Foundations of secure interactive computing. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 377\u2013391. Springer, Heidelberg (1992)"},{"key":"8_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":"Beaver, D., Goldwasser, S.: Multiparty computation with faulty majority. In: 30th Annual Symposium on Foundations of Computer Science (FOCS), pp. 468\u2013473. IEEE, Los Alamitos (1989)"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.50372","volume":"36","author":"M. Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.: A fair protocol for signing contracts. IEEE Trans. Information Theory\u00a036(1), 40\u201346 (1990)","journal-title":"IEEE Trans. Information Theory"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M. Blum","year":"1984","unstructured":"Blum, M.: How to exchange (secret) keys. ACM Transactions on Computer Systems\u00a01, 175\u2013193 (1984)","journal-title":"ACM Transactions on Computer Systems"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/3-540-44598-6_15","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"D. Boneh","year":"2000","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 236\u2013254. Springer, Heidelberg (2000)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44598-6_6","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"C. Cachin","year":"2000","unstructured":"Cachin, C., Camenisch, J.: Optimistic fair secure computation. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 93\u2013111. Springer, Heidelberg (2000)"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s001459910006","volume":"13","author":"R. Canetti","year":"2000","unstructured":"Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"Journal of Cryptology"},{"key":"8_CR9","first-page":"136","volume-title":"42nd Annual Symposium on Foundations of Computer Science (FOCS)","author":"R. Canetti","year":"2001","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 136\u2013145. IEEE, Los Alamitos (2001)"},{"key":"8_CR10","first-page":"364","volume-title":"18th Annual ACM Symposium on Theory of Computing (STOC)","author":"R. Cleve","year":"1986","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 364\u2013369. ACM Press, New York (1986)"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/0-387-34805-0_50","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R. Cleve","year":"1990","unstructured":"Cleve, R.: Controlled gradual disclosure schemes for random bits and their applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 573\u2013588. Springer, Heidelberg (1990)"},{"issue":"4","key":"8_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00191356","volume":"8","author":"I. Damg\u00e5rd","year":"1995","unstructured":"Damg\u00e5rd, I.: Practical and provably secure release of a secret and exchange of signatures. Journal of Cryptology\u00a08(4), 201\u2013222 (1995)","journal-title":"Journal of Cryptology"},{"issue":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1145\/1039488.1039489","volume":"51","author":"C. Dwork","year":"2004","unstructured":"Dwork, C., Naor, M., Sahai, A.: Concurrent zero-knowledge. Journal of the ACM\u00a051(6), 851\u2013898 (2004)","journal-title":"Journal of the ACM"},{"issue":"6","key":"8_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Comm. ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Comm. ACM"},{"key":"8_CR15","unstructured":"Franklin, M.: Complexity and Security of Distributed Protocols. PhD thesis, Columbia University (1993)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/3-540-48184-2_10","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"Z. Galil","year":"1988","unstructured":"Galil, Z., Haber, S., Yung, M.: Cryptographic computation: Secure faut-tolerant protocols and the public-key model. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 135\u2013155. Springer, Heidelberg (1988)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/11681878_21","volume-title":"Theory of Cryptography","author":"J.A. Garay","year":"2006","unstructured":"Garay, J.A., MacKenzie, P.D., Prabhakaran, M., Yang, K.: Resource fairness and composability of cryptographic protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 404\u2013428. Springer, Heidelberg (2006)"},{"key":"8_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography. Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press, Cambridge (2004)"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00145-006-0233-z","volume":"19","author":"O. Goldreich","year":"2006","unstructured":"Goldreich, O., Lindell, Y.: Session-key generation using human passwords only. Journal of Cryptology\u00a019(3), 241\u2013340 (2006)","journal-title":"Journal of Cryptology"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-38424-3_6","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"S. Goldwasser","year":"1991","unstructured":"Goldwasser, S., Levin, L.A.: Fair computation of general functions in presence of immoral majority. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 77\u201393. Springer, Heidelberg (1991)"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-3-642-00457-5_2","volume-title":"TCC 2009","author":"S.D. Gordon","year":"2009","unstructured":"Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 19\u201335. Springer, Heidelberg (2009)"},{"key":"8_CR22","first-page":"413","volume-title":"40th Annual ACM Symposium on Theory of Computing (STOC)","author":"S.D. Gordon","year":"2008","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: 40th Annual ACM Symposium on Theory of Computing (STOC), pp. 413\u2013422. ACM Press, New York (2008)"},{"key":"8_CR23","first-page":"11","volume-title":"39th Annual ACM Symposium on Theory of Computing (STOC)","author":"J. Katz","year":"2007","unstructured":"Katz, J.: On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. In: 39th Annual ACM Symposium on Theory of Computing (STOC), pp. 11\u201320. ACM Press, New York (2007)"},{"key":"8_CR24","first-page":"1","volume-title":"23rd ACM Symposium Annual on Principles of Distributed Computing","author":"M. Lepinski","year":"2004","unstructured":"Lepinski, M., Micali, S., Peikert, C., Shelat, A.: Completely fair SFE and coalition-safe cheap talk. In: 23rd ACM Symposium Annual on Principles of Distributed Computing, pp. 1\u201310. ACM Press, New York (2004)"},{"key":"8_CR25","first-page":"23","volume-title":"24th Annual Symposium on Foundations of Computer Science (FOCS)","author":"M. Luby","year":"1983","unstructured":"Luby, M., Micali, S., Rackoff, C.: How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin. In: 24th Annual Symposium on Foundations of Computer Science (FOCS), pp. 23\u201330. IEEE, Los Alamitos (1983)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-46766-1_32","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Micali","year":"1992","unstructured":"Micali, S., Rogaway, P.: Secure computation. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 392\u2013404. Springer, Heidelberg (1992)"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"TCC 2009","author":"T. Moran","year":"2009","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 1\u201318. Springer, Heidelberg (2009)"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-39200-9_6","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"B. Pinkas","year":"2003","unstructured":"Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 87\u2013105. Springer, Heidelberg (2003)"},{"key":"8_CR29","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":"Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (FOCS), pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13190-5_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:57:15Z","timestamp":1619783835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13190-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642131899","9783642131905"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13190-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}