Secure computation from random error correcting codes

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

Volumn 4515 LNCS, Issue , 2007, Pages 291-310

  Chen, Hao ^a   Cramer, Ronald ^b   Goldwasser, Shafi ^c,d   De Haan, Robbert ^e   Vaikuntanathan, Vinod ^c  

^a FUDAN UNIVERSITY   (China)

^b LEIDEN UNIVERSITY   (Netherlands)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^e CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); CRYPTOGRAPHY; INFORMATION DISSEMINATION; RANDOM PROCESSES; REED-SOLOMON CODES;

ALGEBRAIC GEOMETRY CODES; ERROR CORRECTING CODES; SECURE COMPUTATION;

NETWORK SECURITY;

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

References (31)

1. D. Beaver. Efficient multiparty protocols using circuit randomization. In Proceedings of CRYPTO '91, volume 576, pages 420-432. Springer Verlag LNCS, 1992.
2. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for noncryptographic fault-tolerant distributed computation. In Proceedings of STOC 1988, pages 1-10. ACM Press, 1988.
3. G. R. Blakley. Safeguarding cryptographic keys. In Proceedings of National Computer Conference '79, volume 48 of AFIPS Proceedings, pages 313-317, 1979.
4. G. R. Blakley and C Meadows. Security of ramp schemes. In Proceedings CRYPTO '85, volume 196, pages 242-269. Springer Verlag LNCS, 1985.
5. D. Chaum, C Crépeau, and I. Damgaard. Multi-party unconditionally secure protocols. In Proceedings of STOC 1988, pages 11-19. ACM Press, 1988.
6. H. Chen and R. Cramer. Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computation over Small Fields. In Proceedings of 26th Annual IACR CRYPTO, volume 4117, pages 516-531, Santa Barbara, Ca., USA, August 2006. Springer Verlag LNCS.
7. R. Cramer, I. Damgaard, and R. de Haan. Atomic Secure Multi-Party Multiplication with Low Communication. In Proceedings of EUROCRYPT 2007, May 2007.
8. R. Cramer, I. Damgaard, and S. Dziembowski. On the complexity of verifiable secret sharing and multi-party computation. In Proceedings of STOC 2000, pages 325-334. ACM Press, 2000.
9. R. Cramer, I. Damgaard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient MultiParty Computations with Dishonest Minority. In Proceedings of 18th Annual IACR EUROCRYPT, volume 1592, pages 311-326, Prague, Czech Republic, May 1999. Springer Verlag LNCS.
10. R. Cramer, I. Damgaard, and U. Maurer. General secure multi-party computation from any linear secret sharing scheme. In Proceedings of EUROCRYPT 2000, volume 1807 of LNCS, pages 316-334. Springer Verlag, 2000.
11. R. Cramer, V. Daza, I. Gracia, J. Jimenez Urroz, G. Leander, J. Martí-Farré, and C. Padró. On codes, matroids and secure multi-party computation from linear secret sharing schemes. In Proceedings of CRYPTO 2005, volume 3621 of LNCS, pages 327-343. Springer-Verlag, 2005.
12. R. Cramer, I. Damgård, and S. Fehr. On the Cost of Reconstructing a Secret- Or: VSS with Optimal Reconstruction. In Proceedings of 21th Annual IACR CRYPTO, volume 2139, pages 503-523, Santa Barbara, Ca., USA, August 2001. Springer Verlag LNCS.
13. M. Franklin and M. Yung. Communication complexity of secure computation. In Proceedings of STOC 1992, pages 699-710. ACM Press, 1992.
14. P. Gaborit and A. Otmani. Experimental constructions of self-dual codes. Manuscript. Available from http://www.unilim.fr/pages_perso/philippe.gaborit/ SD/, 2002.
15. A. Garcia and H. Stichtenoth. On the asymptotic behavior of some towers of function fields over finite fields. J. Number Theory, 61:248-273, 1996.
16. O. Goldreich, S. Micali, and A. Wigderson. How to Play Any Mental Game. In Proceedings of STOC 1987, pages 218-229. ACM Press, 1987.
17. V. D. Goppa. Codes on algebraic curves. Soviet Math. Dokl, 24:170-172, 1981.
18. M. Karchmer and A. Wigderson. On span programs. In Proceedings of the Eight Annual Structure in Complexity Theory Conference, pages 102-111. IEEE, 1993.
19. K. Kurosawa, K. Okada, K. Sakano, W. Ogata, and S. Tsujii. Nonperfect Secret Sharing Schemes and Matroids. In Proceedings EUROCRYPT 1993, pages 126-141. Springer Verlag, 1993.
20. S. Lang. Algebra. Addison-Wesley Publishing Company, 1997.
21. F. J. MacWilliams, N. J. A. Sloane, and J. G. Thompson. Good self-dual codes exist. Discrete Math., 3:153-162, 1972.
22. J. L. Massey. Minimal codewords and secret sharing. In Proceedings of the 6-th Joint Swedish-Russian Workshop on Information Theory, pages 269-279, Molle, Sweden, August 1993.
23. J. L. Massey. Some applications of coding theory in cryptography. Codes and Ciphers: Cryptography and Coding IV, pages 33-47, 1995.
24. W. Ogata and K. Kurosawa. Some Basic Properties of General Nonperfect Secret Sharing Schemes. J. UCS, 4(8):690-704, 1998.
25. L. H. Ozarow and A. D. Wyner. "Wire-tap-channel II". AT&T Bell Labs Tech. J., 63:2135-2157, 1984.
26. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proceedings of ACM STOC 1989, pages 73-85, 1989.
27. E. M. Rains and N. J. A. Sloane. Self-Dual Codes. A long survey article written for the Handbook of Coding Theory. Available from http://www.research. att.com/~njas/, 1998.
28. A. Shamir. How to share a secret. Communications of the ACM, 22(11):612-613, 1979.
29. J. G. Thompson. Weighted averages associated to some codes. Scripta Math., 29:449-452, 1973.
30. J. H. van Lint. Introduction to Coding Theory. Graduate Texts in Mathematics. Springer Verlag, 1999.
31. V. K. Wei. Generalized Hamming Weights for Linear Codes. IEEE Transactions on Information Theory, 37(5):1412-1418, 1991.