On codes, matroids and secure multi-party computation from linear secret sharing schemes

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

Volumn 3621 LNCS, Issue , 2006, Pages 327-343

  Cramer, Ronald ^a   Daza, Vanesa ^b   Gracia, Ignacio ^b   Urroz, Jorge Jiménez ^b   Leander, Gregor ^c   Martí Farré, Jaume ^b   Padró, Carles ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^c RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Efficient error correction; Identically self dual matroids; Multi party computation; Multiplicative linear secret sharing schemes; Self dual codes

Indexed keywords

EFFICIENT ERROR CORRECTION; IDENTICALLY SELF-DUAL MATROIDS; MULTI-PARTY COMPUTATION; MULTIPLICATIVE LINEAR SECRET SHARING SCHEMES; SELF-DUAL CODES;

CODES (STANDARDS); COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; CRYPTOGRAPHY; HARMONIC ANALYSIS; MATRIX ALGEBRA; PROBLEM SOLVING; SECURITY OF DATA;

ERROR CORRECTION;

EID: 33745134732     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (31)

1. A. Barg. On some polynomials related to weight enumerators of linear codes. SIAM J. Discrete Math. 15 (2002) 155-164.
2. A. Beimel, T. Tassa, E. Weinreb. Characterizing Ideal Weighted Threshold Secret Sharing. Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005. Lecture Notes in Comput. Sci. 3378 (2005) 600-619.
3. M. Ben-Or, S. Goldwasser, A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. Proc. ACM STOC'88 (1988) 1-10.
4. E.F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput. 9 (1989) 105-113.
5. E.F. Brickell, D.M. Davenport. On the classification of ideal secret sharing schemes. J. Cryptology. 4 (1991) 123-134.
6. T. Britz. MacWilliams identities and matroid polynomials. Electron. J. Combin. 9 (2002), Research Paper 19, 16 pp.
7. P.J. Cameron. Cycle index, weight enumerator, and Tutte polynomial. Electron. J. Combin. 9 (2002), Note 2, 10 pp.
8. R. Canetti, U. Feige, O. Goldreich, M. Naor. Adaptively secure multi-party computation. Proc. ACM STOC'96 (1996) 639-648.
9. D. Chaum, C. Crépeau, I. Damgård. Multi-party unconditionally secure protocols. Proc. ACM STOC'88 (1988) 11-19.
10. R. Cramer, I. Damgård, U. Maurer. General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme. Advances in Cryptology - EUROCRYPT 2000, Lecture Notes in Comput. Sci. 1807 (2000) 316-334.
11. O. Goldreich, M. Micali, A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. Proc. 19th ACM Symposium on the Theory of Computing STOC'87 (1987) 218-229.
12. C. Greene. Weight enumeration and the geometry of linear codes. Studies in Appl. Math. 55 (1976) 119-128.
13. M. Hirt, U. Maurer. Complete characterization of adversaries tolerable in secure multi-party computation. Proc. 16th Symposium on Principles of Distributed Computing PODC '97 (1997) 25-34.
14. M. Ito, A. Saito, T. Nishizeki. Secret sharing scheme realizing any access structure. Proc. IEEE Globecom'87. (1987) 99-102.
15. W.-A. Jackson, K.M. Martin. Geometric secret sharing schemes and their duals. Des. Codes Cryptogr. 4 (1994) 83-95.
16. M. Karchmer, A. Wigderson. On span programs. Proceedings of the Eighth Annual Structure in Complexity Theory Conference (San Diego, CA, 1993), 102-111, 1993.
17. E. Kunz. Introduction to Commutative Algebra and Algebraic Geometry. Birkhäuser, Boston, 1985.
18. J. Martí-Farré, C. Padro. Secret sharing schemes on access structures with intersection number equal to one. In Proceedings of the Third Conference on Security in Communication Networks '02, Lecture Notes in Comput. Sci. 2576 (2003) 354-363. Amain, Italy, 2002.
19. F. Matúš. Matroid representations by partitions. Discrete Mathematics 203 (1999) 169-194.
20. S.-L. Ng. A Representation of a Family of Secret Sharing Matroids. Des. Codes Cryptogr. 30 (2003) 5-19.
21. S.-L. Ng, M. Walker. On the composition of matroids and ideal secret sharing schemes. Des. Codes Cryptogr. 24 (2001) 49-67.
22. J.G. Oxley. Matroid theory. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1992.
23. C. Padró, G. Sáez. Secret sharing schemes with bipartite access structure. IEEE Transactions on Information Theory. 46 (2000) 2596-2604.
24. A previous version appeared in Advances in Cryptology - EUROCRYPT'98, Lecture Notes in Comput. Sci. 1403 (1998) 500-511.
25. R. Pellikaan. On decoding by error location and dependent sets of error positions. Discrete Math. 106/107 (1992) 369-381.
26. Z. Reichstein, B. Youssin. Essential dimensions of algebraic groups and a resolution theorem for G-varieties. With an appendix by János Kollár and Endre Szabó. Canad. J. Math. 52 (2000) 1018-1056.
27. A. Shamir. How to share a secret. Commun. of the ACM. 22 (1979) 612-613.
28. G.J. Simmons. An introduction to shared secret and/or shared control schemes and their application. Contemporary Cryptology. The Science of Information Integrity. IEEE Press (1991), 441-497.
29. J. Simonis, A. Ashikhmin. Almost affine codes. Des. Codes Cryptogr. 14 (1998) 179-197.
30. D.R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr. 2 (1992) 357-390.
31. T. Tassa. Hierarchical Threshold Secret Sharing. Theory of Cryptography, First Theory of Cryptography Conference, TCC 2004- Lecture Notes in Comput. Sci. 2951 (2004) 473-490.