{"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":1766281001514},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642004568"},{"type":"electronic","value":"9783642004575"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00457-5_2","type":"book-chapter","created":{"date-parts":[[2009,2,19]],"date-time":"2009-02-19T04:59:44Z","timestamp":1235019584000},"page":"19-35","source":"Crossref","is-referenced-by-count":37,"title":["Complete Fairness in Multi-party Computation without an Honest Majority"],"prefix":"10.1007","author":[{"given":"S. Dov","family":"Gordon","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Katz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty. In: Proc. 18th Annual ACM Symposium on Theory of Computing (STOC), pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Gordon, D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: Proc. 40th Annual ACM Symposium on Theory of Computing (STOC) (2008)","DOI":"10.1145\/1374376.1374436"},{"issue":"1","key":"2_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.2000.3013","volume":"167","author":"B. Chor","year":"2001","unstructured":"Chor, B., Ishai, Y.: On privacy and partition arguments. Inf. Comput.\u00a0167(1), 2\u20139 (2001)","journal-title":"Inf. Comput."},{"issue":"4","key":"2_CR4","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 J. Computing\u00a029(4), 1189\u20131208 (2000)","journal-title":"SIAM J. Computing"},{"issue":"1","key":"2_CR5","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 Journal of Discrete Math\u00a04(1), 36\u201347 (1991)","journal-title":"SIAM Journal of Discrete Math"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/11818175_29","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"Y. Ishai","year":"2006","unstructured":"Ishai, Y., Kushilevitz, E., Lindell, Y., Petrank, E.: On combining privacy with guaranteed output delivery in secure multiparty computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 483\u2013500. Springer, Heidelberg (2006)"},{"key":"2_CR7","unstructured":"Gordon, S.D., Katz, J.: Complete fairness in multi-party computation without an honest majority. In: 6th Theory of Cryptography Conference, TCC (2009), \n                  \n                    http:\/\/eprint.iacr.org\/2008\/458"},{"key":"2_CR8","doi-asserted-by":"publisher","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":"1","key":"2_CR9","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"}],"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-00457-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T08:47:06Z","timestamp":1551775626000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00457-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642004568","9783642004575"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00457-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}