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

IEEE Transactions on Information Theory

Volumn 54, Issue 6, 2008, Pages 2644-2657

  Cramer, Ronald ^a   Daza, Vanesa ^b   Gracia, Ignacio ^c   Urroz, Jorge Jimenez ^c   Leander, Gregor ^c   Marti Farre, Jaume ^c   Padro, Carles ^c  

^a LEIDEN UNIVERSITY   (Netherlands)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Efficient error correction; Multiparty computation; Multiplicative linear secret sharing schemes; Self dual codes; Self dual matroids

Indexed keywords

ARTIFICIAL INTELLIGENCE; CLASSIFICATION (OF INFORMATION); CODES (STANDARDS); CODES (SYMBOLS); COMPUTATIONAL METHODS; COMPUTER NETWORKS; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; INFORMATION THEORY; NETWORK PROTOCOLS; PAPER; VECTORS;

(ALGORITHMIC) COMPLEXITY; (SPM) CLASSES; ACCESS STRUCTURE; BERLEKAMP; CONNECTIONS (STRUCTURAL); EFFICIENT METHODS; ERROR-CORRECTING CODES (ECC); GENERAL (CO); MALICIOUS FAULTS; MATROID THEORY; MULTI-PARTY COMPUTATIONS; NEW CONCEPT; OPEN PROBLEMS; PROPERTY (S); SECRET SHARING SCHEMES; SECURE MULTI PARTY COMPUTATION (SMC); SELF-DUAL; SELF-DUAL CODES; SHARING SCHEMES; SPECIAL CLASS;

MATRIX ALGEBRA;

EID: 45249107018     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.921692     Document Type: Article

References (35)

1. A. Barg, "On some polynomials related to weight enumerators of linear codes," SIAM J. Discr. Math., vol. 15, no. 2, pp. 155-164, 2002.
2. A. Beimel and N. Livne, "On matroids and non-ideal secret sharing," in Proc. 3rd Theory of Cryptography Conf., TCC 2006 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2006, vol. 3876, pp. 482-501.
3. A. Beimel, T. Tassa, and E. Weinreb, "Characterizing ideal weighted threshold secret sharing," in Proc. 2nd Theory of Cryptography Conference, TCC 2005 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2005, vol. 3378, pp. 600-619.
4. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorems for non-cryptographic fault-tolerant distributed computation," in Proc. ACM Symp. Theory of Computing (STOC 1988), Chicago, IL, May 1988, pp. 1-10.
5. E. F. Brickell, "Some ideal secret sharing schemes," J. Combin. Math. Combin. Comput., vol. 9, pp. 105-113, 1989.
6. E. F. Brickell and D. M. Davenport, "On the classification of ideal secret sharing schemes," J. Cryptol., vol. 4, pp. 123-134, 1991.
7. T. Britz, "MacWilliams identities and matroid polynomials," Electron. J. Combin., vol. 9, no. 1, 2002.
8. P. J. Cameron, "Cycle index, weight enumerator, and Tutte polynomial," Electron. J. Combin., vol. 9, no. 1, 2002.
9. R. Canetti, U. Feige, O. Goldreich, and M. Naor, "Adaptively secure multi-party computation," in Proc. ACM Symp. Theory of Computing (STOC 1996), Philadelphia, PA, May 1996, pp. 639-648.
10. D. Chaum and C. C. Damgård, "Multi-party unconditionally secure protocols," in Proc. ACM Symp. Theory of Computing (STOC 1988), Chicago, IL, May 1988, pp. 11-19.
11. R. Cramer, I. Damgård, and U. Maurer, "General secure multi-party computation from any linear secret-sharing scheme," in Advances in Cryptology, EUROCRYPT 2000 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2000, vol. 1807, pp. 316-334.
12. I. M. Duursma, "Combinatorics of the two-variable zeta function," in Finite Fields and Applications (Lecture Notes in Computer Science) Berlin, Germany: Springer-Verlag, 2004, vol. 2948, pp. 109-136.
13. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game or a completeness theorem for protocols with honest majority," in Proc. ACM Symp. Theory of Computing (STOC 1987), New York, 1987, pp. 218-229.
14. C. Greene, "Weight enumeration and the geometry of linear codes," Studies in Appl. Math., vol. 55, no. 2, pp. 119-128, 1976.
15. M. Hirt and U. Maurer, "Complete characterization of adversaries tolerable in secure multi-party computation," in Proc. PODC 1997, Santa Barbara, CA, Aug. 1997, pp. 25-34.
16. M. Ito, A. Saito, and T. Nishizeki, "Secret sharing scheme realizing any access structure," in Proc. IEEE Globecom'87, Tokyo, Japan, Nov. 1987, pp. 99-102.
17. W.-A. Jackson and K. M. Martin, "Geometric secret sharing schemes and their duals," Des., Codes, Cryptogr., vol. 4, no. 1, pp. 83-95, 1994.
18. M. Karchmer and A. Wigderson, "On span programs," in Proc. Structure in Complexity Theory Conf. 1993, San Diego, CA, May 1993, pp. 102-111.
19. E. Kunz, Introduction to Commutative Algebra and Algebraic Geometry Boston, MA: Birkhd_sauser, 1985.
20. J. Martí-Farré and C. Padró, "Secret sharing schemes on access structures with intersection number equal to one," Discr. Appl. Math., vol. 154, no. 3, pp. 552-563, 2006.
21. J. Martí-Farré and C. Padró, "On secret sharing schemes, matroids and polymatroids," in Proc. 4th Theory of Cryptography Conf., TCC 2007 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, to be published.
22. F. Matúš, "Matroid representations by partitions," Discr. Math., vol. 203, no. 1-3, pp. 169-194, 1999.
23. S.-L. Ng, "A representation of a family of secret sharing matroids," Des., Codes, Cryptogr., vol. 30, no. 1, pp. 5-19, 2003.
24. S.-L. Ng and M. Walker, "On the composition of matroids and ideal secret sharing schemes," Des., Codes, Cryptogr., vol. 24, no. 1, pp. 49-67, 2001.
25. J. G. Oxley, Matroid Theory. New York: Clarendon/Oxford Univ. Press, 1992.
26. C. Padró and I. Gracia, "Representing small identically self-dual matroids by self-dual codes," SIAM J. Discr. Math., vol. 20, no. 4, pp. 1046-1055, 2006.
27. C. Padró and G. Sáez, "Secret sharing schemes with bipartite access structure," IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2596-2604, Nov. 2000.
28. R. Pellikaan, "On decoding by error location and dependent sets of error positions," Discr. Math., vol. 106/107, pp. 369-381, 1992.
29. Z. Reichstein and 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., vol. 52, no. 5, pp. 1018-1056, 2000.
30. A. Shamir, "How to share a secret," Commun. ACM, vol. 22, no. 11, pp. 612-613, 1979.
31. G. J. Simmons, "An introduction to shared secret and/or shared control schemes and their application," in Contemporary Cryptology. The Science of Information Integrity. New York: IEEE Press, 1991, pp. 441-497.
32. J. Simonis and A. Ashikhmin, "Almost affine codes," Des., Codes, Cryptogr., vol. 14, no. 2, pp. 179-197, 1998.
33. D. R. Stinson, "An explication of secret sharing schemes," Des., Codes, Cryptogr., vol. 2, no. 4, pp. 357-390, 1992.
34. T. Tassa, "Hierarchical threshold secret sharing," in Proc. 1st Theory of Cryptography Conf., TCC 2004 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 2004, vol. 2951, pp. 473-490.
35. D. J. A. Welsh, Matroid Theory. London, U.K.: Academic, 1976.