Towards characterizing complete fairness in secure two-party computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8349 LNAI, Issue , 2014, Pages 291-316

  Asharov, Gilad ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Complete fairness; foundations; malicious adversaries; secure two party computation

Indexed keywords

COMPUTATION THEORY; CRYPTOGRAPHY; FOUNDATIONS;

COMPLETE FAIRNESS; CONVEX GEOMETRY; IMPOSSIBILITY RESULTS; MALICIOUS ADVERSARIES; NON-TRIVIAL TASKS; SECURE TWO-PARTY COMPUTATIONS; SET-MEMBERSHIP; SYMMETRIC BOOLEAN FUNCTIONS;

BOOLEAN FUNCTIONS;

EID: 84958522455     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-54242-8_13     Document Type: Conference Paper

References (30)

1. 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. 8042, pp. 259-276. Springer, Heidelberg (2013)
2. Asharov, G.: Towards characterizing complete fairness in secure two-party computation. IACR Cryptology ePrint Archive (to appear)
3. 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. 7785, pp. 243-262. Springer, Heidelberg (2013)
4. 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. 6841, pp. 277-296. Springer, Heidelberg (2011)
5. Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.L.: A fair protocol for signing contracts. IEEE Transactions on Information Theory 36(1), 40-46 (1990)
6. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1-10 (1988)
7. Canetti, R.: Security and composition of multiparty cryptographic protocols. J. Cryptology 13(1), 143-202 (2000)
8. Chaum, D., Cŕepeau, C., Damg°ard, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11-19 (1988)
9. Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: STOC, pp. 364-369 (1986)
10. Cleve, R.: Controlled gradual disclosure schemes for random bits and their applications. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 573-588. Springer, Heidelberg (1990)
11. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. In: CRYPTO, pp. 205-210 (1982)
12. 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
13. Goldreich, O.: The Foundations of Cryptography-Basic Applications, vol. 2. Cambridge University Press (2004)
14. 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-229 (1987)
15. 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. 537, pp. 77-93. Springer, Heidelberg (1991)
16. Gordon, S.D.: On fairness in secure computation. PhD thesis, University of Maryland (2010)
17. Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure twoparty computation. In: STOC, pp. 413-422 (2008); Extended full version available on: http://eprint.iacr.org/2008/303. Journal version: [18]
18. Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure twoparty computation. J. ACM 58(6), 24 (2011)
19. Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 157-176. Springer, Heidelberg (2010)
20. Gr̈unbaum, B.: Convex Polytopes. In: Kaibel, V., Klee, V., Ziegler, G. (eds.) Graduate Texts in Mathematics, 2nd edn. Springer (May 2003)
21. Halpern, J.Y., Teague, V.: Rational secret sharing and multiparty computation: extended abstract. In: STOC, pp. 623-632 (2004)
22. Kahn, J., Koml̀os, J., Szemer̀edi, E.: On the probability that a random ±1-matrix is singular. Journal of Amer. Math. Soc. 8, 223-240 (1995)
23. Koml̀os, J.: On the determinant of (0, 1) matrices. Studia Sci. Math. Hungar 2, 7-21 (1967)
24. Rabin, M.O.: How to exchange secrets with oblivious transfer. Technical Report TR-81, Aiken Computation Lab, Harvard University (1981)
25. Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, pp. 73-85 (1989)
26. Roman, S.: Advanced Linear Algebra, 3rd edn. Graduate Texts in Mathematics, vol. 135, p. xviii. Springer, New York (2008)
27. Voigt, T., Ziegler, G.M.: Singular 0/1-matrices, and the hyperplanes spanned by random 0/1-vectors. Combinatorics, Probability and Computing 15(3), 463-471 (2006)
28. Wood, P.J.: On the probability that a discrete complex random matrix is singular. PhD thesis, Rutgers University, New Brunswick, NJ, USA, AAI3379178 (2009)
29. Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: FOCS, pp. 162-167 (1986)
30. Ziegler, G.M.: Lectures on 0/1-polytopes. Polytopes: Combinatorics and Computation, Birkhauser, Basel. DMV Seminar, vol. 29, pp. 1-40 (2000)