{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:41Z","timestamp":1766281001159,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642117985"},{"type":"electronic","value":"9783642117992"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11799-2_7","type":"book-chapter","created":{"date-parts":[[2010,2,2]],"date-time":"2010-02-02T13:55:48Z","timestamp":1265118948000},"page":"91-108","source":"Crossref","is-referenced-by-count":24,"title":["On Complete Primitives for Fairness"],"prefix":"10.1007","author":[{"given":"Dov","family":"Gordon","sequence":"first","affiliation":[]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Moran","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, May 2-4. ACM, New York (1988)"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1145\/266420.266426","volume-title":"CCS","author":"N. Asokan","year":"1997","unstructured":"Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: CCS, pp. 7\u201317. ACM, New York (1997)"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1109\/49.839935","volume":"18","author":"N. Asokan","year":"2000","unstructured":"Asokan, N., Shoup, V., Waidner, M.: Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications\u00a018(4), 593\u2013610 (2000)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BFb0020806","volume-title":"STACS 91","author":"B. Baum-Waidner","year":"1991","unstructured":"Baum-Waidner, B., Pfitzmann, B., Waidner, M.: Unconditional byzantine agreement with good majority. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol.\u00a0480, pp. 285\u2013295. Springer, Heidelberg (1991)"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/237814.237996","volume-title":"STOC","author":"D. Beaver","year":"1996","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: STOC, pp. 479\u2013488. ACM, New York (1996)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Beaver, D., Goldwasser, S.: Multiparty computation with faulty majority, pp. 468\u2013473 (1989)","DOI":"10.1109\/SFCS.1989.63520"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-540-24638-1_14","volume-title":"Theory of Cryptography","author":"A. Beimel","year":"2004","unstructured":"Beimel, A., Malkin, T.: A quantitative approach to reductions in secure computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 238\u2013257. Springer, Heidelberg (2004)"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2000","year":"2000","unstructured":"Bellare, M. (ed.): CRYPTO 2000. LNCS, vol.\u00a01880. Springer, Heidelberg (2000)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC [1], pp. 1\u201310","DOI":"10.1145\/62212.62213"},{"issue":"2","key":"7_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/357360.357368","volume":"1","author":"M. Blum","year":"1983","unstructured":"Blum, M.: How to exchange (secret) keys. ACM Transactions on Computer Systems\u00a01(2), 175\u2013193 (1983); Previously published in ACM STOC\u00a01983 proceedings, pp. 440\u2013447","journal-title":"ACM Transactions on Computer Systems"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Timed commitments, pp. 236\u2013254","DOI":"10.1007\/3-540-44598-6_15"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Naor, M.: Timed commitments. In: Bellare [8], pp. 236\u2013254","DOI":"10.1007\/3-540-44598-6_15"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Cachin, C., Camenisch, J.: Optimistic fair secure computation. In: Bellare [8], pp. 93\u2013111","DOI":"10.1007\/3-540-44598-6_6"},{"issue":"1","key":"7_CR14","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. J. Cryptology\u00a013(1), 143\u2013202 (2000)","journal-title":"J. Cryptology"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC [1], pp. 11\u201319","DOI":"10.1145\/62212.62214"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-24676-3_18","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"L. Chen","year":"2004","unstructured":"Chen, L., Kudla, C., Paterson, K.G.: Concurrent signatures. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 287\u2013305. Springer, Heidelberg (2004)"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00195209","volume":"7","author":"B. Chor","year":"1994","unstructured":"Chor, B., Ger\u00e9b-Graus, M., Kushilevitz, E.: On the structure of the privacy hierarchy. J. Cryptology\u00a07(1), 53\u201360 (1994)","journal-title":"J. Cryptology"},{"key":"7_CR18","first-page":"383","volume-title":"FOCS","author":"B. Chor","year":"1985","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract). In: FOCS, pp. 383\u2013395. IEEE, Los Alamitos (1985)"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1137\/0404004","volume":"4","author":"B. Chor","year":"1991","unstructured":"Chor, B., Kushilevitz, E.: A zero-one law for boolean privacy. SIAM J. Discrete Math.\u00a04(1), 36\u201347 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"7_CR20","first-page":"364","volume-title":"STOC","author":"R. Cleve","year":"1986","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364\u2013369. ACM, New York (1986)"},{"key":"7_CR21","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)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R. Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 471\u2013488. Springer, Heidelberg (2008)"},{"issue":"4","key":"7_CR23","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. J. Cryptology\u00a08(4), 201\u2013222 (1995)","journal-title":"J. Cryptology"},{"issue":"4","key":"7_CR24","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. J. Cryptology\u00a08(4), 201\u2013222 (1995)","journal-title":"J. Cryptology"},{"issue":"6","key":"7_CR25","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. Commun. ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"issue":"1","key":"7_CR26","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00145-004-0150-y","volume":"18","author":"M. Fitzi","year":"2005","unstructured":"Fitzi, M., Garay, J.A., Maurer, U.M., Ostrovsky, R.: Minimal complete primitives for secure multi-party computation. J. Cryptology\u00a018(1), 37\u201361 (2005)","journal-title":"J. Cryptology"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/3-540-46035-7_32","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"M. Fitzi","year":"2002","unstructured":"Fitzi, M., Gisin, N., Maurer, U.M., von Rotz, O.: Unconditional byzantine agreement and multi-party computation secure against dishonest minorities from scratch. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 482\u2013501. Springer, Heidelberg (2002)"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Galil, Z., Haber, S., Yung, M.: Cryptographic computation: Secure fault-tolerant protocols and the public-key model, pp. 135\u2013155","DOI":"10.1007\/3-540-48184-2_10"},{"key":"7_CR29","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":"7_CR30","first-page":"218","volume-title":"STOC","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC, pp. 218\u2013229. ACM, New York (1987)"},{"key":"7_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/3-540-48184-2_6","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"O. Goldreich","year":"1988","unstructured":"Goldreich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 73\u201386. Springer, Heidelberg (1988)"},{"key":"7_CR32","unstructured":"Goldwasser, S., Levin, L.: Fair computation and general functions in the presence of immoral majority"},{"key":"7_CR33","unstructured":"Gordon, D., Katz, J.: Partial fairness in secure two-party computation. Cryptology ePrint Archive, Report 2008\/206 (2008), http:\/\/eprint.iacr.org\/2008\/206"},{"key":"7_CR34","first-page":"413","volume-title":"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: Ladner, R.E., Dwork, C. (eds.) STOC, pp. 413\u2013422. ACM, New York (2008)"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: Reingold [49], pp. 19\u201335","DOI":"10.1007\/978-3-642-00457-5_2"},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11426639_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D. Harnik","year":"2005","unstructured":"Harnik, D., Kilian, J., Naor, M., Reingold, O., Rosen, A.: On robust combiners for oblivious transfer and other primitives. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 96\u2013113. Springer, Heidelberg (2005)"},{"issue":"2","key":"7_CR37","doi-asserted-by":"publisher","first-page":"159","DOI":"10.3233\/JCS-2009-0336","volume":"17","author":"A. Herzberg","year":"2009","unstructured":"Herzberg, A.: Folklore, practice and theory of robust combiners. Journal of Computer Security\u00a017(2), 159\u2013189 (2009)","journal-title":"Journal of Computer Security"},{"key":"7_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y. Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer - efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 572\u2013591. Springer, Heidelberg (2008)"},{"key":"7_CR39","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1250790.1250793","volume-title":"STOC","author":"J. Katz","year":"2007","unstructured":"Katz, J.: On achieving the \u201cbest of both worlds\u201d in secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) STOC, pp. 11\u201320. ACM, New York (2007)"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: STOC [1], pp. 20\u201331","DOI":"10.1145\/62212.62215"},{"issue":"4","key":"7_CR41","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1137\/S0097539797321742","volume":"29","author":"J. Kilian","year":"2000","unstructured":"Kilian, J., Kushilevitz, E., Micali, S., Ostrovsky, R.: Reducibility and completeness in private computations. SIAM Journal on Computing\u00a029(4), 1189\u20131208 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR42","first-page":"1","volume-title":"PODC","author":"M. Lepinski","year":"2004","unstructured":"Lepinski, M., Micali, S., Peikert, C., shelat, A.: Completely fair sfe and coalition-safe cheap talk. In: Chaudhuri, S., Kutten, S. (eds.) PODC, pp. 1\u201310. ACM, New York (2004)"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-79263-5_8","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"A.Y. Lindell","year":"2008","unstructured":"Lindell, A.Y.: Legally-enforceable fairness in secure two-party computation. In: Malkin, T.G. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 121\u2013137. Springer, Heidelberg (2008)"},{"key":"7_CR44","first-page":"11","volume-title":"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: FOCS, pp. 11\u201321. IEEE, Los Alamitos (1983)"},{"key":"7_CR45","doi-asserted-by":"crossref","unstructured":"Maji, H.K., Prabhakaran, M., Rosulek, M.: Complexity of multi-party computation problems: The case of 2-party symmetric secure function evaluation. In: Reingold [49], pp. 256\u2013273","DOI":"10.1007\/978-3-642-00457-5_16"},{"key":"7_CR46","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1145\/872035.872038","volume-title":"PODC","author":"S. Micali","year":"2003","unstructured":"Micali, S.: Simple and fast optimistic protocols for fair electronic exchange. In: PODC, pp. 12\u201319. ACM, New York (2003)"},{"key":"7_CR47","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":"7_CR48","first-page":"73","volume-title":"STOC","author":"T. Rabin","year":"1989","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385. ACM, New York (1989)"},{"key":"7_CR49","series-title":"Lecture Notes in Computer Science","volume-title":"TCC 2009","year":"2009","unstructured":"Reingold, O. (ed.): TCC 2009. LNCS, vol.\u00a05444. Springer, Heidelberg (2009)"},{"key":"7_CR50","first-page":"162","volume-title":"FOCS","author":"A.C.-C. Yao","year":"1986","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167. IEEE, Los Alamitos (1986)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11799-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,17]],"date-time":"2025-02-17T06:40:39Z","timestamp":1739774439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11799-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642117985","9783642117992"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11799-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}