Revisiting the efficiency of malicious two-party computation

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

Volumn 4515 LNCS, Issue , 2007, Pages 79-96

  Woodruff, David P ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Efficiency; Expander graphs; Malicious model; Secure function evaluation

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; CRYPTOGRAPHY; FUNCTION EVALUATION; PROBLEM SOLVING;

EXPANDER GRAPHS; MALICIOUS MODELS; SECURE FUNCTION EVALUATION; TWO PARTY COMPUTATION;

SECURITY OF DATA;

EID: 38049107739     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_5     Document Type: Conference Paper

References (34)

1. N. Alon, Eigenvalues and expanders, Combinatorica 6, 1986, pp. 86-96.
2. N. Alon, J. Bruck, J. Naor, M. Naor, and R. Roth, Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs, IEEE Transactions on Information Theory 38 (192), pp. 509-516.
3. N. Alon and V. D. Milman. Eigenvalues, expanders, and superconcentrators, FOCS, 1984.
4. N. Alon and J. Spencer. The Probabilistic Method, 2000.
5. D. Beaver. Correlated pseudorandomness and the complexity of private computations, STOC, 1996.
6. M. Capalbo, O. Reingold, S. Vadhan, and A. Wigderson. Randomness conductors and constant-degree lossless expanders, STOC, 2002.
7. F. Chung, Spectral Graph Theory, CBMS Lecture Notes, AMS Publications, 1997.
8. F. Chung and L. Lu. Concentration inequalities and martingale inequalities - a survey, Internet Mathematics, to appear.
9. R. Diestel. Graph Theory, Springer-Verlag, 2005.
10. I. Dinur. The PCP Theorem by Gap Amplification, STOC, 2006.
11. S. Even, O. Goldreich and A. Lempel. A randomized protocol for signing contracts, Communications of the ACM, 1985.
12. W. Feller, Stirling's Formula, Section 2.9 in An Introduction to Probability Theory and its Applications 1, 3rd edition, New York: Wiley, pp. 50 -53, 1968.
13. J. Friedman, A Proof of Alon's Second Eigenvalue Conjecture, STOC, 2003.
14. O. Gabber and Z. Galil. Explicit constructions of linear-sized superconcentrators, JCSS, 22(3):407-420, 1981.
15. O. Goldreich, S. Micali, and C. Rackoff. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proofs, FOCS, 1986.
16. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority, STOC, 1987.
17. O. Goldreich. Foundations of cryptography - volume 2, ch. 7, 2004.
18. Y. Ishai, J. Kilian, K. Nissim, and E. Petrank. Extending oblivious transfers efficiently, Crypto, 2003.
19. J. Kilian and E. Petrank. An efficient noniteractive zero-knowledge proof system for NP with general assumptions, Journal of Cryptology, 11:1-27, 1998.
20. M. Kiraz and B. Schoenmakers, A protocol issue for the malicious case of Yao's garbled circuit construction, in the 27th Symposium on information theory in the BENELUX (WIC), 2006.
21. Y. Lindell, and B. Pinkas. A proof of Yao's protocol for secure two-party computation, Cryptology ePrint Archive, Report 2004/175, 2004.
22. Y. Lindell, and B. Pinkas. An efficient protocol for secure two-party computation in the presence of malicious adversaries, to appear in these proceedings, Eurocrypt, 2007.
23. A. Lubotzky, R. Phillips, and P. Sarnak. Explicit expanders and the Ramanujan conjectures, STOC, 1986. See also: A. Lubotzky, R. Phillips, and P. Sarnak, Ramanujan graphs, Combinatorica 8, 1988, pp. 261-277.
24. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system, Usenix, 2004.
25. G. A. Margulis. Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators, Problemy Peredachi Informatsii 24: 51-60 (Russian). English translation in Problems of Information Transmission 24, 1988, 39-46.
26. P. Mohassel and M. Franklin. Efficiency Tradeoffs for Malicious Two-Party Computation, PKC, 2006.
27. M. Naor and B. Pinkas. Efficient oblivious transfer. SODA, 2001.
28. B. Pinkas. Fair secure two-party computation, Eurocrypt, 2003.
29. M. Rabin. How to exchange secrets by oblivious transfer, Technical Report Tech., Memo. TR-81, Aiken Computation Laboratory, Harvard University, 1981.
30. H. Robbins. A remark of Stirling's Formula., Amer. Math Monthly 62, pp. 26-29, 1955.
31. R. M. Tanner. Explicit Construction of Concentrators from Generalized N-Gons, SIAM J. Alg. Discr. Math 5, 1984, pp. 287-293.
32. L. Trevisan. Inapproximability of Combinatorial Optimization Problems, Optimisation Combinatiore 2.
33. D. Woodruff Revisiting the efficiency of malicious two-party computation, Cryptology ePrint Archive, Report 2006/397, 2006.
34. A. C. Yao. How to generate and exchange secrets, FOCS, 1986.