Efficient multi-party computation over rings

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

Volumn 2656, Issue , 2003, Pages 596-613

  Cramer, Ronald ^a   Fehr, Serge ^a   Ishai, Yuval ^b   Kushilevitz, Eyal ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATION THEORY; CRYPTOGRAPHY; EFFICIENCY; FINITE ELEMENT METHOD;

ALGEBRAIC STRUCTURES; EFFICIENCY IMPROVEMENT; MULTIPARTY COMPUTATION; NOVEL APPLICATIONS; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION; TWO DIRECTIONS; UNCONDITIONALLY SECURE;

COMPUTATIONAL EFFICIENCY;

EID: 35248883422     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39200-9_37     Document Type: Article

References (38)

1. J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In Proc. of 8th PODC, pp. 201-209, 1989.
2. D. Beaver. Efficient multiparty protocols using circuit randomization. In Proc. of CRYPTO '91, LNCS 576, pp. 420-432, 1991.
3. D. Beaver. Minimal-latency secure function evaluation. In Proc. of EUROCRYPT '00, LNCS 1807, pp. 335-350, 2000.
4. D. Beaver, J. Feigenbaum, J. Kilian, and P. Rogaway. Security with low communication overhead (extended abstract). In Proc. of CRYPTO '90, LNCS 537, pp. 62-76, 1990.
5. D. Beaver, S. Micali, and P. Rogaway. The round complexity of secure protocols (extended abstract). In Proc. of 22nd STOC, pp. 503-513, 1990.
6. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proc. of 20th STOC, pp. 1-10, 1988.
7. R. Canetti. Security and composition of multiparty cryptographic protocols. In J. of Cryptology, 13(1):143-202, 2000.
8. R. Canetti. Universally Composable Security: A New Paradigm for Cryptographic Protocols. In Proc. of 42nd FOCS, pp. 136-145, 2001.
9. R. Canetti, U. Feige, O. Goldreich and M. Naor. Adaptively secure computation. In Proc. of 28th STOC, pp. 639-648, 1996.
10. D. Chaum, C. Crepeau, and I. Damgård. Multiparty unconditional secure protocols. In Proc. of 20th STOC, pp. 11-19, 1988.
11. C. Cachin, J. Camenisch, J. Kilian, and J. Muller. One-round secure computation and secure autonomous mobile agents. In Proc. of 27th ICALP, pp. 512-523, 2000.
12. R. Cleve. Towards Optimal Simulations of Formulas by Bounded-Width Programs. In Computational Complexity 1: 91-105, 1991.
13. R. Cramer, I. Damgård, and U. Maurer. General secure multi-party computation from any linear secret-sharing scheme. In Proc. of EUROCRYPT '00, LNCS 1807, pp. 316-334, 2000.
14. R. Cramer, I. Damgård, and J. Nielsen. Multiparty computation from threshold homomorphic encryption. In Proc. of EUROCRYPT '01, LNCS 2045, pp. 280-299, 2001.
15. R. Cramer and S. Fehr. Optimal black-box secret sharing over arbitrary Abelian groups. In Proc. of CRYPTO '02, LNCS 2442, 272-287, 2002.
16. R. Cramer, S. Fehr, Y. Ishai, and E. Kushilevitz. Efficient multi-party computation over rings. Cryptology ePrint Archive, Report 2003/030, 2003.
17. A. De Santis, Y. Desmedt, Y. Frankel, and M. Yung. How to share a function securely. In Proc. of 26th STOC, pp. 522-533, 1994.
18. Y. G. Desmedt and Y. Frankel. Homomorphic zero-knowledge threshold schemes over any finite Abelian group. In SIAM Journal on Discrete Mathematics, 7(4):667-679, 1994.
19. M. Fitzi, M. Hirt, and U. Maurer. Trading correctness for privacy in unconditional multi-party computation. In Proc. of CRYPTO '98, LNCS 1462, pp. 121-136, 1998.
20. U. Feige, J. Kilian, and M. Naor. A minimal model for secure computation. In Proc. of 26th STOC, pp. 554-563, 1994.
21. M. Fitzi and U. Maurer Efficient Byzantine agreement secure against general adversaries. In Proc. of DISC '98, LNCS 1499, pp. 134-148, 1998.
22. M. Franklin and M. Yung. Communication complexity of secure computation. In Proc. of 24th STOC, pp. 699-710, 1992.
23. R. Gennaro, M. O. Rabin, and T. Rabin. Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In Proc. of 17th PODC, pp. 101-111, 1998.
24. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game (extended abstract). In Proc. of 19th STOC, pp. 218-229, 1987.
25. M. Hirt and U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In Proc. of 16th PODC, 1997, pp. 25-34.
26. M. Hirt and U. Maurer. Robustness for free in unconditional multi-party computation. In Proc. of CRYPTO '01, LNCS 2139, pp. 101-118, 2001.
27. M. Hirt, U. Maurer, and B. Przydatek. Efficient secure multi-party computation. In Proc. of ASIACRYPT '00, LNCS 1976, pp. 143-161, 2000.
28. Y. Ishai and E. Kushilevitz. Randomizing polynomials: A new representation with applications to round-efficient secure computation. In Proc. of 41th FOCS, pp. 294-304, 2000.
29. Y. Ishai and E. Kushilevitz. Perfect constant-round secure computation via perfect randomizing polynomials. In Proc. of 29th ICALP, pp. 244-256, 2002.
30. M. Karchmer and A. Wigderson. On span programs. In Proc. of 8th Conference on Structure in Complexity Theory, pp. 102-111, 1993.
31. J. Kilian. Founding cryptography on oblivious transfer. In Proc. of 20th STOC, pp. 20-31, 1988.
32. Y. Lindell. Parallel coin-tossing and constant-round secure two-party Computation. In Proc. of CRYPTO '01, LNCS 2139, pp. 171-189, 2001.
33. M. Naor, and K. Nissim. Communication Preserving Protocols for Secure Function Evaluation. In Proc. of 33rd STOC, pp. 590-599, 2001.
34. R. Ostrovsky and M. Yung. How to withstand mobile virus attacks. In Proc. of 10th PODC, pp. 51-59, 1991.
35. 1. In Proc. of 40th FOCS, pp. 554-567, 1999.
36. A. Shamir. How to share a secret. CACM, 22(11):612-613, 1979.
37. A. C. Yao. Protocols for secure computations. In Proc. of 23th FOCS, pp. 160-164, 1982.
38. A. C. Yao. How to generate and exchange secrets. In Proc. of 27th FOCS, pp. 162-167, 1986.