Completeness in two-party secure computation: A computational view

Journal of Cryptology

Volumn 19, Issue 4, 2006, Pages 521-552

  Harnik, Danny ^a   Naor, Moni ^a   Reingold, Omer ^a   Rosen, Alon ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Oblivious transfer; One way function; Secure function evaluation

Indexed keywords

COMPUTATIONAL ROW TRANSITIVITY; OBLIVIOUS TRANSFER; ONE WAY FUNCTION; SECURE FUNCTION EVALUATION (SFE);

COMBINATORIAL MATHEMATICS; COMPUTATION THEORY; FUNCTION EVALUATION; INFORMATION ANALYSIS; NETWORK PROTOCOLS;

SECURITY OF DATA;

EID: 33749559395     PISSN: 09332790     EISSN: 14321378     Source Type: Journal    
DOI: 10.1007/s00145-006-0346-4     Document Type: Article

References (49)

1. W. Aiello and J. Hastad. Statistical zero-knowledge languages can be recognized in two rounds. Journal of Computer and Systems Sciences, 42(3):327-345, 1991.
2. A. Beimel, T. Malkin, and S. Micali. The all-or-nothing nature of two-party secure computation. In CRYPTO '99, pages 80-97. LNCS 1666. Springer, Berlin, 1999.
3. M. Bellare and S. Micali. Non-interactive oblivious transfer and applications. In CRYPTO '89, pages 547-557. LNCS 435. Springer, Berlin, 1989.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic faulttolerant distributed computation. In Proc. 20th STOC, pages 1-10, 1988.
5. C.H. Bennett, G. Brassard, C. Crepeau, and M.H. Skubiszewska. Practical quantum oblivious transfer protocols. In CRYPTO '91, pages 351-366. LNCS 576. Springer, Berlin, 1992.
6. R. Boppana, J. Hastad, and S. Zachos. Does co-np have short interactive proofs? Information Processing Letters, 25(2):127-132, 1987.
7. C. Cachin, C. Crepeau, and J. Marcil. Oblivious transfer with a memory-bound receiver. In Proc. 39th FOCS, pages 493-502, 1995.
8. R. Canetti. Security and composition of multiparty cryptographic protocols. Journal of Cryptology, 13(1):143-202, 2000.
9. R. Canetti, E. Kushilevitz, and Y. Lindell. On the limitations of universally composable two-party computation without set-up assumptions. Journal of Cryptology, 19(2):135-167, 2006.
10. D. Chaum, C. Crepeau, and I. Damgard. Multiparty unconditionally secure protocols. In Proc. 20th STOC, pages 11-19, 1988.
11. B. Chor and E. Kushilevitz. A zero-one law for boolean privacy. SIAM Journal on Discrete Mathematics, 4(1):36-47, 1991.
12. Preliminary version in Proc 21st STOC.
13. C. Crepeau. Equivalence between two flavours of oblivious transfers. In CRYPTO '87, pages 350-354. LNCS 293. Springer, Berlin, 1987.
14. C. Crepeau and J. Kilian. Achieving oblivious transfer using weakened security assumptions. In Proc. 29th FOCS, pages 42-52, 1988.
15. I. Damgard, J. Kilian, and L. Salvail. On the (im)possibility of basing oblivious transfer and bit commitment on weakened security assumptions. In Eurocrypt '99, pages 56-73. LNCS 1592. Springer, Berlin, 1999.
16. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, 1985.
17. M. Fitzi, J.A. Garay, U.M. Maurer, and R. Ostrovsky. Minimal complete primitives for secure multi-party computation. In CRYPTO '01, pages 80-100. LNCS 2139. Springer, Berlin, 2001.
18. L. Fortnow. The complexity of perfect zero-knowledge. In Randomness and Computation (editor S. Micali), pages 327-343. Volume 5 of Advances in Computing Research. JAI Press, Greenwich, CT, 1989.
19. Y. Gertner, S. Kannan, T. Malkin, O. Reingold, and M. Viswanathan. The relationship between public key encryption and oblivious transfer. In Proc. 41st FOCS, pages 325-335, 2000.
20. O. Goldreich. Foundations of Cryptography. Cambridge University Press, Cambridge, 2001.
21. O. Goldreich. Foundations of Cryptography - Volume 2. Cambridge University Press, Cambridge, 2004.
22. O. Goldreich and L.A. Levin. A hard-core predicate for all one-way functions. In Proc. 21st STOC, pages 25-32, 1989.
23. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game - a completeness theorem for protocols with honest majority. In Proc. 19th STOC, pages 218-229, 1987.
24. O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity, or all languages in np have zero-knowledge proof systems. Journal of the ACM, 38:691-729, 1991.
25. O. Goldreich, N. Nisan, and A. Wigderson. On Yao's XOR-lemma. Electronic Colloquium on Computational Complexity, Report TR95-050, 1995. Available at http://eccc.hpi-web.de/eccc/.
26. O. Goldreich and R. Vainish. How to solve any protocol problem - an efficiency improvement. In CRYPTO '87, pages 73-86. LNCS 293. Springer, Berlin, 1987.
27. M. Hirt and U. Maurer. Player simulation and general adversary structures in perfect multiparty computation. Journal of Cryptology, 13(1):31-60, 2000.
28. R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proc. 36th FOCS, pages 538-545, 1995.
29. R. Impagliazzo. A personal view of average-case complexity. In Proc. 10th Annual Structure in Complexity Theory Conference, pages 134-147. IEEE Computer Society Press, Los Alamitos, CA, 1995.
30. R. Impagliazzo and M. Luby. One-way functions are essential for complexity based cryptography. In Proc. 30th FOCS, pages 230-235, 1989.
31. R. Impagliazzo and S. Rudich. Limits on the provable consequences of one-way permutations. In Proc. 21st STOC, pages 44-61, 1989.
32. Y. Ishai. Personal communication, 2004.
33. J. Kilian. Founding cryptography on oblivious transfer. In Proc. 20th STOC, pages 20-31, 1988.
34. J. Kilian. A general completeness theorem for two-party games. In Proc. 23rd STOC, pages 553-560, 1991.
35. J. Kilian. More general completeness theorems for secure two-party computation. In Proc. 32nd STOC, pages 316-324, 2000.
36. J. Kilian, E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in private computations. SIAM Journal of Computing, 28(4):1189-1208, 2000.
37. E. Kushilevitz. Privacy and communication complexity. SIAM Journal on Discrete Mathematics, 5(2):273-284, 1992.
38. Preliminary version in Proc. 30th FOCS.
39. E. Kushilevitz, S. Micali, and R. Ostrovsky. Reducibility and completeness in multi-party private computations. In Proc. 35th FOCS, pages 478-489, 1994.
40. L.A. Levin. One-way functions and pseudorandom generators. Combinatorica, 7:357-363, 1987.
41. U. Maurer. Information-theoretic cryptography. In CRYPTO '99, pages 47-64. LNCS 1666. Springer, Berlin, 1999.
42. S. Micali and P. Rogaway. Secure computation. In CRYPTO '91, pages 392-404. LNCS 576. Springer, Berlin, 1991.
43. M. Naor and B. Pinkas. Efficient oblivious transfer protocols. In Proc. SIAM Symposium on Discrete Algorithms (SODA 2001), pages 448-457, 2001.
44. T. Okamoto. On relationships between statistical zero-knowledge proofs. Journal of Computer and Systems Sciences, 60(1):47-108, 2000.
45. R. Ostrovsky and A. Wigderson. One-way fuctions are essential for non-trivial zero-knowledge. In Second Israel Symposium on Theory of Computing Systems, ISTCS 93, Proceedings, pages 3-17. IEEE Computer Society Press, 1993.
46. M. O. Rabin. How to exchange secrets by oblivious transfer. TR-81, Harvard University, Cambridge, MA, 1981.
47. A. C. Yao. Protocols for secure computations. In Proc. 23rd FOCS, pages 160-164, 1982.
48. A. C. Yao. Theory and application of trapdoor functions. In Proc. 23rd FOCS, pages 80-91, 1982.
49. A. C. Yao. How to generate and exchange secrets. In Proc. 21th FOCS, pages 162-167, 1986.