Scalable secure multiparty computation

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

Volumn 4117 LNCS, Issue , 2006, Pages 501-520

  Damgård, Ivan ^a   Ishai, Yuval ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK PROTOCOLS; RANDOM PROCESSES; SECURITY OF DATA;

MULTIPARTY COMPUTATION; NATURAL SETTINGS; PSEUDORANDOM GENERATOR;

COMPUTATION THEORY;

EID: 33749557660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11818175_30     Document Type: Conference Paper

References (40)

1. 0. In Proc. FOCS 2004, pages 165-175.
2. B. Applebaum, Y. Ishai, and E. Kushilevitz. Computationally private randomizing polynomials and their applications. In Proc. CCC 2005, pages 260-274.
3. 0. In Proc. RANDOM 2006.
4. O. Barkol and Y. Ishai. Secure Computation of Constant-Depth Circuits with Applications to Database Search Problems. In Proc. Crypto 2005, pages 395-411.
5. D. Beaver. Efficient Multiparty Protocols Using Circuit Randomization. In Proc. Crypto 1991, pages 420-432.
6. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead. In Proc. Crypto 1990, pages 62-76.
7. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. STOC 1990, pages 503-513.
8. Z. Beerliova and M. Hirt. Efficient Multi-Party Computation with Dispute Control. In Proc. TCC 2006, pages 305-328.
9. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proc. STOC 1988, pages 1-10.
10. R. Canetti. Security and composition of multiparty cryptographic protocols. In J. of Cryptology, 13(1):143-202, 2000.
11. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proc. FOCS 2001, pages 136-145.
12. D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols (extended abstract). In Proc. STOC 1988, pages 11-19.
13. Richard Cleve. Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract). In Proc. STOC 1986, pages 364-369.
14. R. Cramer, I. Damgård, and Y. Ishai. Share conversion, pseudorandom secret-sharing and applications to secure computation. In Proc. TCC 2005, pages 342-362.
15. R. Cramer, I. Damgård, and J. Nielsen. Multiparty computation from threshold homomorphic encryption. In Proc. Eurocrypt 2001, pages 280-299.
16. I. Damgård and Y. Ishai. Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In Proc. Crypto 2005, pages 378-394.
17. I. Damgard, and J. Nielsen. Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption. In Proc. Crypto 2003, pages 247-264.
18. S. Even, O. Goldreich and A. Lempel. A Randomized Protocol for Signing Contracts. In Communications of the ACM, 28(6):637-647, 1985.
19. P. Feldman and S. Micali. An Optimal Algorithm for Synchronous Byzantine Agreement. SIAM. J. Computing, 26(2):873-933, 1997.
20. M. K. Franklin and S. Haber. Joint Encryption and Message-Efficient Secure Computation. In Proc. Crypto 1993, pages 266-277.
21. Full version in Journal of Cyptoglogy 9(4): 217-232 (1996).
22. M. K. Franklin and M. Yung. Communication Complexity of Secure Computation. In Proc. STOC 1992, pages 699-710.
23. R. Gennaro, Y. Ishai, E. Kushilevitz and T. Rabin. The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In Proc. STOC 2001, pages 580-589.
24. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game (extended abstract). In Proc. STOC 1987, pages 218-229.
25. M. Hirt and U. M. Maurer. Robustness for Free in Unconditional Multi-party Computation. In Proc. Crypto 2001, pages 101-118.
26. M. Hirt, U. M. Maurer, and B. Przydatek. Efficient Secure Multi-party Computation. In Proc. Asiacrypt 2000, pages 143-161.
27. M. Hirt and J. B. Nielsen. Upper Bounds on the Communication Complexity of Optimally Resilient Cryptographic Multiparty Computation. In Proc. Asiacrypt 2005, pages 79-99.
28. M. Hirt and J. B. Nielsen. Robust Multiparty Computation with Linear Communication Complexity. These proceedings.
29. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. FOCS 2000, pages 294-304.
30. M. Jakobsson and A. Juels. Mix and Match: Secure Function Evaluation via Ciphertexts. Proc. Asiacrypt 2000, pages 162-177.
31. J. Katz and C.-Y. Koo. On Expected Constant-Round Protocols for Byzantine Agreement. These proceedings.
32. Y. Lindell, A. Lysyanskaya, and T. Rabin. Sequential composition of protocols without simultaneous termination. In Proc. PODC 2002, pages 203-212.
33. 0. In Proc. FOCS 2003, pages 136-145.
34. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. SIAM J. Comput., 22(4):838-856, 1993.
35. Preliminary version in Proc. STOC '90.
36. M. Naor and K. Nissim. Communication preserving protocols for secure function evaluation. In Proc. STOC 2001, pages 590-599.
37. M. Naor, B. Pinkas, and R. Sumner. Privacy preserving auctions and mechanism design. In Proc. 1st ACM Conference on Electronic Commerce, pages 129-139, 1999.
38. A. Shamir. How to share a secret. Commun. ACM, 22(6):612-613, June 1979.
39. A. C. Yao. How to generate and exchange secrets. In Proc. FOCS 1986, pages 162-167.
40. Z. Zhang, M. Liu, and L. Xiao. Parallel Multi-Party Computation from Linear Multi-Secret Sharing Schemes. In Proc. Asiacrypt 2005.