Algebraic geometric secret sharing schemes and secure multi-party computations over small fields

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

Volumn 4117 LNCS, Issue , 2006, Pages 521-536

  Chen, Hao ^a   Cramer, Ronald ^b,c  

^a FUDAN UNIVERSITY   (China)

^b CWI   (Netherlands)

^c LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; NETWORK PROTOCOLS; NUMERICAL METHODS; SECURITY OF DATA;

INFORMATION RATE; LINEAR SECRET SHARING SCHEME (LSSS); MULTILINEAR ALGEBRAIC PROPERTY; MULTIPARTY COMPUTATIONS;

COMPUTATION THEORY;

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

References (39)

1. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proceedings of STOC 1988, ACM Press, pp. 1-10.
2. J. Bierbrauer. Universal Hashing and Geometric Codes. Designs, Codes and Cryptography, vol. 11, pp. 207-221, 1997.
3. G. R. Blakley. Safeguarding cryptographic keys. Proceedings of National Computer Conference '79, volume 48 of AFIPS Proceedings, pp. 313-317, 1979.
4. D. Chaum, C. Crépeau, and I. Damgaard. Multi-party unconditionally secure protocols. Proceedings STOC 1988, ACM Press, pp. 11-19.
5. H. Chen. Linear secret sharing from algebraic-geometric codes. Merged with [8].
6. H. Chen, R. Cramer, C. Ding, and C. Xing. Secret sharing and secure multi-party compuation from projective algebraic subsets. Work in progress.
7. H. Chen, R. Cramer, S. Goldwasser, V. Vaikuntanathan, R. de Haan. Threshold MPC in the Rabin-Ben Or broadcast model unconditionally secure against corrupt minorities based on general error correcting codes. Work in progress.
8. R. Cramer. Algebraic geometric secret sharing and secure computation over small fields. Merged with [5].
9. R. Cramer, S. Fehr, and M. Stam. Blackbox secret sharing from primitive sets in algebraic number fields. Proceedings of CRYPTO 2005, volume 3621 of LNCS, pp. 344-360, Springer-Verlag, 2005.
10. 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. Proceedings of CRYPTO 2005, volume 3621 of LNCS, pp. 327-343, Springer-Verlag, 2005.
11. R. Cramer and R. de Haan. Atomic Secure Multi-Party Multiplication with Low Communication. Manuscript, 2004.
12. R. Cramer, S. Fehr, Y. Ishai, and E. Kushilevitz. Efficient multi-party computation over rings. Proceedings of EUROCRYPT 2003, volume 2656 of LNCS, pp. 596-613, Springer-Verlag, 2003.
13. R. Cramer and S. Fehr. Optimal black-box secret sharing over arbitrary Abelian groups. Proceedings of CRYPTO 2002, volume 2442 of LNCS, pp. 272-287, Springer-Verlag, 2002.
14. R. Cramer, I. Damgaard, and S. Dziembowski. On the complexity of verifiable secret sharing and multi-party computation. Proceedings of STOC 2000, ACM Press, pp. 325-334, 2000.
15. R. Cramer, I. Damgaard, and U. Maurer. General secure multi-party computation from any linear secret sharing scheme. Proceedings of EUROCRYPT 2000, volume 1807 of LNCS, pp. 316-334, Springer-Verlag, 2000.
16. R. Cramer, I. Damgaard, S. Dziembowski, M. Hirt, and T. Rabin. Efficient multi-party computations secure against an adaptive adversary. In Proceedings of EUROCRYPT 1999, volume 1592, Springer-Verlag, 1999.
17. Y. Desmedt and Y. Frankel. Homomorphic zero-knowledge threshold schemes over any finite abelian group. SIAM Journal of Discrete Mathematics, 7 (1994), pp. 667-679.
18. R. J. McEliece and D. V. Sarvate. On sharing secrets and Reed-Solomon codes. Comm. of the ACM, 22(11), November 1979, pp. 612-613.
19. M. Franklin and M. Yung. Communication complexity of secure computation. Proceedings of STOC 1992, ACM Press.
20. W. Fulton. Algebraic Curves. Advanced Book Classics, Addission-Wesley.
21. A. García and H. Stichtenoth. On the asymptotic behavior of some towers of function fields over finite fields. J. Number Theory, vol. 61, pp. 248-273, 1996.
22. G. van der Geer and M. van der Vlugt. Tables of curves with many points Mathematics of Computation 69 (2000), 797-810. See also www.science.uva.nl/~geer for regular updates.
23. V.D. Goppa. Codes on algebraic curves. Soviet Math. Dokl. 24: 170-172, 1981.
24. M. Karchmer and A. Wigderson. On span programs. Proceedings of the Eigth Annual Structure in Complexity Theory Conference, pp. 102-111, IEEE, 1993.
25. R. Kumar, S. Rajagopalan, and A. Sahai. Coding constructions for blacklisting problems without computational assumptions. Proceedings of CRYPTO 1999, Springer-Verlag, pp. 609-623, 1999.
26. K. Y. Lam, H. X. Wang, and C. Xing. Constructions of authentication codes from algebraic curves over finite fields. IEEE Transactions in Information Theory, Vol. 46, 886-892, 2000.
27. S. Lang. Algebra. Addison-Wesley, 1997.
28. J.H. van Lint. Introduction to Coding Theory. GTM, Springer Verlag.
29. J. L. Massey. Minimal codewords and secret sharing. Proceedings of the 6-th Joint Swedish-Russian Workshop on Information Theory Molle, Sweden, August 1993, pp. 269-279.
30. J. L. Massey. Some applications of coding theory in cryptography. Codes and Ciphers: Cryptography and Coding IV, 1995, pp. 33-47.
31. H. Niederreiter, H. Wang, and C. Xing. Function fields over finite fields and their application to cryptography. In: A. Garcia and H. Stichtenoth (Ed.). Topics in geometry, coding theory and cryptography, Springer Verlag, to appear (2006).
32. T. Rabin and M. Ben-Or. Verifiable secret sharing and multiparty protocols with honest majority. In Proc. ACM STOC 1989, pages 73-85, 1989.
33. A. Shamir. How to share a secret. Comm. of the ACM, 22(11):612-613, 1979.
34. J. Silverman. The Arithmetic of Elliptic Curves. GTM, Springer Verlag.
35. K.W. Shum, I. Aleshnikov, V.P. Kumar, H. Stichtenoth, V. Deolaikar. A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound. IEEE Trans. IT 47 (2001), no. 6, 2225-2241.
36. H. Stichtenoth. Algebraic function fields and codes. Springer Verlag, 1993.
37. M. Tsfasman and S. Vladuts. Algebraic-geometric codes. Kluwer, 1991.
38. S. Vladuts. A note on authentication codes from algebraic geometry. IEEE Transactions in Information Theory 44, no. 3, pp. 1342-1345, 1998.
39. C. Xing. Authentication codes and algebraic curves. Proceedings of the 3rd European Congress of Mathematics, Bikhauser, Vol.2, pp. 239-244, 2001.