How many oblivious transfers are needed for secure multiparty computation?

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

Volumn 4622 LNCS, Issue , 2007, Pages 284-302

  Harnik, Danny ^a   Ishai, Yuval ^a   Kushilevitz, Eyal ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DATA TRANSFER; INFORMATION THEORY; NETWORK PROTOCOLS; PROBLEM SOLVING; SECURITY OF DATA;

ARBITRARY FUNCTIONS; COMMUNICATION COMPLEXITY; OBLIVIOUS TRANSFER (OT); SECURITY PARAMETER;

COMPUTATION THEORY;

EID: 38049107215     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74143-5_16     Document Type: Conference Paper

References (48)

1. 0 In: 45th FOCS, pp. 166-175 (2004)
2. Barkol, O., Ishai, Y.: Secure computation of constant-depth circuits with applications to database search problems. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 395-411. Springer, Heidelberg (2005)
3. Beaver, D.: Precomputing oblivious transfer. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 97-109. Springer, Heidelberg (1995)
4. Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: 28th STOC, pp. 479-488 (1996)
5. Beimel, A., Malkin, T.: A quantitative approach to reductions in secure computation. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 238-257. Springer, Heidelberg (2004)
6. Beimel, A., Malkin, T., Micali, S.: The all-or-nothing nature of two-party secure computation. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 80-97. Springer, Heidelberg (1999)
7. BenOr, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: 20th STOC, pp. 1-10 (1988)
8. Berman, P., Garay, J., Perry, K.: Bit optimal distributed consensus. In: Computer Science Research, pp. 313-332. Plenum Publishing Corporation (1992)
9. Bracha, G.: An o(log n) expected rounds randomized byzantine generals protocol. Journal of the ACM 34(4), 910-920 (1987)
10. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)
11. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: 20th STOC, pp. 11-19 (1988)
12. Coan, B., Welch, J.: Modular construction of a byzantine agreement protocol with optimal message bit complexity. Information and Computation, 97(1) (1992)
13. Crépeau, C., Kilian, J.: Achieving oblivious transfer using weakened security assumptions. In: 29th FOCS, pp. 42-52 (1988)
14. Damgård, I., Kilian, J., Salvail, L.: On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 56-73. Springer, Heidelberg (1999)
15. Dodis, Y., Micali, S.: Lower bounds for oblivious transfer reductions. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 42-55. Springer, Heidelberg (1999)
16. Erdos, P., Simonovits, M.: A limit theorem in graph theory. Stud. Sci. Math. Hung 1, 51-57 (1966)
17. Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM 28(6), 637-647 (1985)
18. Fitzi, M., Franklin, M., Garay, J., Vardhan, H.: Towards optimal and efficient perfectly secure message transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, Springer, Heidelberg (2007)
19. Franklin, M., Haber, S.: Joint encryption and message-efficient secure computation. J. Cryptology 9(4), 217-232 (1996)
20. Gabber, O., Galil, Z.: Explicit constructions of linear-sized superconcentrators. JCSS 22(3), 407-420 (1981)
21. Goldreich, O.: Foundations of Cryptography, vol. 2. Cambridge University Press, Cambridge (2004)
22. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game - a completeness theorem for protocols with honest majority. In: 19th STOC, pp. 218-229 (1987)
23. Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity, or all languages in NP have zero-knowledge proof system. Journal of the ACM 38(1), 691-729 (1991)
24. Goldreich, O., Vainish, R.: How to solve any protocol problem - an efficiency improvement. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol. 293, pp. 73-86. Springer, Heidelberg (1988)
25. Goldreich, O., Wigderson, A.: Tiny families of functions with random properties: A quality-size trade-off for hashin. Rand. Structs. and Algs. 11(4), 315-343 (1997)
26. Gradwohl, R., Kindler, G., Reingold, O., Ta-Shma, A.: On the error parameter of dispersers. In: APPROX-RANDOM, pp. 294-305 (2005)
27. Harnik, D., Kilian, J., Naor, M., Reingold, O., Rosen, A.: On tolerant combiners for oblivious transfer and other primitives. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 96-113. Springer, Heidelberg (2005)
28. Harnik, D., Naor, M., Reingold, O., Rosen, A.: Completeness in two-party secure computation - a computational view. In: 36th STOC, pp. 252-261 (2004)
29. Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology 13(1), 31-60 (2000)
30. Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: 21st STOC, pp. 44-61 (1989)
31. Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145-161. Springer, Heidelberg (2003)
32. Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In: 44th FOCS, pp. 92-101 (2003)
33. Kilian, J.: Founding cryptography on oblivious transfer. In: 20th STOC, pp. 20-31 (1988)
34. Kilian, J.: A general completeness theorem for two-party games. In: 23rd STOC, pp. 553-560 (1991)
35. King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in peer-to-peer networks. In: 47th FOCS, pp. 87-98 (2006)
36. Margulis, G.: Explicit constructions of concentrators. Problemy peredaci informacii 9(4), 71-80 (1973)
37. Meier, R., Przydatek, B., Wullschleger, J.: Robuster combiners for oblivious transfer. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, Springer, Heidelberg (2007)
38. Naor, M., Pinkas, B.: Efficient oblivious transfer protocols. In: SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 448-457 (2001)
39. Ostrovsky, R., Rajagopalan, S., Vazirani, U.: Simple and efficient leader election in the full information model. In: 26th STOC, pp. 234-242 (1994)
40. Rabin, M.O.: How to exchange secrets by oblivious transfer. TR-81, Harvard (1981)
41. Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors, and depth-two superconcentrators. SIAM J. Discrete Math. 13(1), 2-24 (2000)
42. Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors. ECCC, 8(18) (2001)
43. Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS 77, 67-95 (2002)
44. Wiesner, S.: Conjugate coding. SIGACT News 15(1), 78-88 (1983)
45. Wullschleger, J.: Oblivious transfer amplification. In: Naor, M. (ed.) EUROCRYPT 2007, vol. 4515, pp. 555-572. Springer, Heidelberg (2007)
46. Yao, A.C.: Protocols for secure computations. In: 23rd FOCS, pp. 160-164 (1982)
47. Yao, A.C.: How to generate and exchange secrets. In: 27th FOCS, pp. 162-167 (1986)
48. Zuckerman, D.: Randomness-optimal sampling, extractors, and constructive leader election. In: 28th STOC, pp. 286-295 (1996)