{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:49:27Z","timestamp":1770900567556,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642542411","type":"print"},{"value":"9783642542428","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54242-8_13","type":"book-chapter","created":{"date-parts":[[2014,2,2]],"date-time":"2014-02-02T21:42:54Z","timestamp":1391377374000},"page":"291-316","source":"Crossref","is-referenced-by-count":33,"title":["Towards Characterizing Complete Fairness in Secure Two-Party Computation"],"prefix":"10.1007","author":[{"given":"Gilad","family":"Asharov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-40041-4_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S. Agrawal","year":"2013","unstructured":"Agrawal, S., Prabhakaran, M.: On fair exchange, fair coins and fair sampling. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol.\u00a08042, pp. 259\u2013276. Springer, Heidelberg (2013)"},{"key":"13_CR2","unstructured":"Asharov, G.: Towards characterizing complete fairness in secure two-party computation. IACR Cryptology ePrint Archive (to appear)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-36594-2_14","volume-title":"Theory of Cryptography","author":"G. Asharov","year":"2013","unstructured":"Asharov, G., Lindell, Y., Rabin, T.: A full characterization of functions that imply fair coin tossing and ramifications to fairness. In: Sahai, A. (ed.) TCC 2013. LNCS, vol.\u00a07785, pp. 243\u2013262. Springer, Heidelberg (2013)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-22792-9_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"A. Beimel","year":"2011","unstructured":"Beimel, A., Lindell, Y., Omri, E., Orlov, I.: 1\/p-secure multiparty computation without honest majority and the best of both worlds. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 277\u2013296. Springer, Heidelberg (2011)"},{"issue":"1","key":"13_CR5","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.L.: A fair protocol for signing contracts. IEEE Transactions on Information Theory\u00a036(1), 40\u201346 (1990)","journal-title":"IEEE Transactions on Information Theory"},{"key":"13_CR6","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, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"issue":"1","key":"13_CR7","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":"13_CR8","doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364\u2013369 (1986)","DOI":"10.1145\/12130.12168"},{"key":"13_CR10","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":"13_CR11","doi-asserted-by":"crossref","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: CRYPTO, pp. 205\u2013210 (1982)","DOI":"10.1007\/978-1-4757-0602-4_19"},{"key":"13_CR12","unstructured":"Even, S., Yacobi, Y.: Relations among public key signature schemes. Technical Report #175, Technion Israel Institute of Technology, Computer Science Department (1980), http:\/\/www.cs.technion.ac.il\/users\/wwwb\/cgi-bin\/trinfo.cgi\/1980\/CS\/CS0175"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography - Basic Applications, vol.\u00a02. Cambridge University Press (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"13_CR14","doi-asserted-by":"crossref","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 (1987)","DOI":"10.1145\/28395.28420"},{"key":"13_CR15","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.: Fair computation of general functions in presence of immoral majority. In: Menezes, A.J., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 77\u201393. Springer, Heidelberg (1991)"},{"key":"13_CR16","unstructured":"Gordon, S.D.: On fairness in secure computation. PhD thesis, University of Maryland (2010)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. In: STOC, pp. 413\u2013422 (2008); Extended full version available on: http:\/\/eprint.iacr.org\/2008\/303 . Journal version: [18]","DOI":"10.1145\/1374376.1374436"},{"issue":"6","key":"13_CR18","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/2049697.2049698","volume":"58","author":"S.D. Gordon","year":"2011","unstructured":"Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure twoparty computation. J. ACM\u00a058(6), 24 (2011)","journal-title":"J. ACM"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-13190-5_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S.D. Gordon","year":"2010","unstructured":"Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 157\u2013176. Springer, Heidelberg (2010)"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum, B.: Convex Polytopes. In: Kaibel, V., Klee, V., Ziegler, G. (eds.) Graduate Texts in Mathematics, 2nd edn. Springer (May 2003)","DOI":"10.1007\/978-1-4613-0019-9"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: STOC, pp. 623\u2013632 (2004)","DOI":"10.1145\/1007352.1007447"},{"key":"13_CR22","first-page":"223","volume":"8","author":"J. Kahn","year":"1995","unstructured":"Kahn, J., Koml\u00f2s, J., Szemer\u00e8di, E.: On the probability that a random \u00b11-matrix is singular. Journal of Amer.\u00a0Math.\u00a0Soc.\u00a08, 223\u2013240 (1995)","journal-title":"Journal of Amer.\u00a0Math.\u00a0Soc."},{"key":"13_CR23","first-page":"7","volume":"2","author":"J. Koml\u00f2s","year":"1967","unstructured":"Koml\u00f2s, J.: On the determinant of (0,1) matrices. Studia Sci. Math. Hungar\u00a02, 7\u201321 (1967)","journal-title":"Studia Sci. Math. Hungar"},{"key":"13_CR24","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical Report TR-81, Aiken Computation Lab, Harvard University (1981)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Roman, S.: Advanced Linear Algebra, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0135, p. xviii. Springer, New York (2008)","DOI":"10.1007\/978-0-387-72831-5"},{"issue":"3","key":"13_CR27","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1017\/S0963548305007339","volume":"15","author":"T. Voigt","year":"2006","unstructured":"Voigt, T., Ziegler, G.M.: Singular 0\/1-matrices, and the hyperplanes spanned by random 0\/1-vectors. Combinatorics, Probability and Computing\u00a015(3), 463\u2013471 (2006)","journal-title":"Combinatorics, Probability and Computing"},{"key":"13_CR28","unstructured":"Wood, P.J.: On the probability that a discrete complex random matrix is singular. PhD thesis, Rutgers University, New Brunswick, NJ, USA, AAI3379178 (2009)"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"Ziegler, G.M.: Lectures on 0\/1-polytopes. Polytopes: Combinatorics and Computation, Birkhauser, Basel. DMV Seminar, vol.\u00a029, pp. 1\u201340 (2000)","DOI":"10.1007\/978-3-0348-8438-9_1"}],"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-54242-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T23:32:32Z","timestamp":1648164752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54242-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642542411","9783642542428"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54242-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}