Ideal multipartite secret sharing schemes

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

Volumn 4515 LNCS, Issue , 2007, Pages 448-465

  Farràs, Oriol ^a   Martí Farré, Jaume ^a   Padró, Caries ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Discrete polymatroids; Ideal access structures; Ideal secret sharing schemes; Multipartite matroids; Multipartite secret sharing; Secret sharing

Indexed keywords

ACCESS CONTROL; CRYPTOGRAPHY; HIERARCHICAL SYSTEMS; INFORMATION RETRIEVAL; PROBLEM SOLVING;

DISCRETE POLYMATROIDS; IDEAL ACCESS STRUCTURES; IDEAL SECRET SHARING SCHEMES; MULTIPARTITE MATROIDS; MULTIPARTITE SECRET SHARING; SECRET SHARING;

INFORMATION SYSTEMS;

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

References (37)

1. A. Beimel, N. Livne. On Matroids and Non-ideal Secret Sharing. Third Theory of Cryptography Conference, TCC 2006. Lecture Notes in Comput. Sci. 3876 (2006) 482-501.
2. A. Beimel, T. Tassa, E. Weinreb. Characterizing Ideal Weighted Threshold Secret Sharing. Second Theory of Cryptography Conference, TCC 2005. Lecture Notes in Comput. Sci. 3378 (2005) 600-619.
3. J. Benaloh, J. Leichter. Generalized secret sharing and monotone functions. Advances in Cryptology, CRYPTO'88. Lecture Notes in Comput. Sci. 403 (1990) 27-35.
4. G.R. Blakley. Safeguarding cryptographic keys. AFIPS Conference Proceedings. 48 (1979) 313-317.
5. C. Blundo, A. De Santis, R. De Simone, U. Vaccaro. Tight bounds on the information rate of secret sharing schemes. Des. Codes Cryptogr. 11 (1997) 107-122.
6. C Blundo, A. De Santis, L. Gargano, U. Vaccaro. On the information rate of secret sharing schemes. Advances in Cryptology, CRYPTO'92. Lecture Notes in Comput. Sci. 740 (1993) 148-167.
7. E.F. Brickell. Some ideal secret sharing schemes. J. Combin. Math, and Combin. Comput. 9 (1989) 105-113.
8. E.F. Brickell, D.M. Davenport. On the classification of ideal secret sharing schemes. J. Cryptology 4 (1991) 123-134.
9. R.M. Capocelli, A. De Santis, L. Gargano, U. Vaccaro. On the size of shares of secret sharing schemes. J. Cryptology 6 (1993) 157-168.
10. M.J. Collins. A Note on Ideal Tripartite Access Structures. Cryptology ePrint Archive, Report 2002/193, http://eprint.iacr.org/2002/193.
11. L. Csirmaz. The size of a share must be large. J. Cryptology 10 (1997) 223-231.
12. J. Herranz, G. Sáez. New Results on Multipartite Access Structures. IEE Proceedings on Information Security 153 (2006) 153-162.
13. J. Herzog, T. Hibi. Discrete polymatroids. J. Algebraic Combin. 16 (2002) 239-268.
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. Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9 (1996) 267-286.
16. E.D. Kamin, J.W. Greene, M.E. Hellman. On secret sharing systems. IEEE Trans. Inform. Theory 29 (1983) 35-41.
17. A. Lehman. A solution of the Shannon switching game. J. Soc. Indust. Appl. Math. 12 (1964) 687-725.
18. J. Martí-Farré, C. Padró. Secret sharing schemes with three or four minimal qualified subsets. Des. Codes Cryptogr. 34 (2005) 17-34.
19. J. Martí-Farré, C. Padró. Secret sharing schemes on access structures with intersection number equal to one. Discrete Applied Mathematics 154 (2006) 552-563.
20. J.Martí-Farré, C. Padró. Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. Fifth Conference on Security and Cryptography for Networks, SCN 2006, Lecture Notes in Comput. Sci., 4116 (2006) 201-215.
21. J. Martí-Farré, C. Padró. On Secret Sharing Schemes, Matroids and Polymatroids. Fourth IACR Theory of Cryptography Conference TCC 2007, Lecture Notes in Comput. Sci. 4392 (2007) 273-290.
22. F. Matúš. Matroid representations by partitions. Discrete Math. 203 (1999) 169-194.
23. P. Morillo, C. Padró, G. Sáez, J. L. Villar. Weighted Threshold Secret Sharing Schemes. Inf. Process. Lett. 70 (1999) 211-216.
24. S.-L. Ng. A Representation of a Family of Secret Sharing Matroids. Des. Codes Cryptogr. 30 (2003) 5-19.
25. S.-L. Ng. Ideal secret sharing schemes with multipartite access structures. IEE Proc.-Commun. 153 (2006) 165-168.
26. S.-L. Ng, M. Walker. On the composition of matroids and ideal secret sharing schemes. Des. Codes Cryptogr. 24 (2001) 49-67.
27. J.G. Oxley. Matroid theory. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1992.
28. C. Padró, G. Sáez. Secret sharing schemes with bipartite access structure. IEEE Trans. Inform. Theory 46 (2000) 2596-2604.
29. P.D. Seymour. A forbidden minor characterization of matroid ports. Quart. J. Math. Oxford Ser. 27 (1976) 407-413.
30. P.D. Seymour. On secret-sharing matroids. J. Combin. Theory Ser. B, 56 (1992) pp. 69-73.
31. A. Shamir. How to share a secret. Commun. of the ACM, 22 (1979) pp. 612-613.
32. G. J. Simmons. How to (Really) Share a Secret. Advances in Cryptology CRYPTO'88, Lecture Notes in Comput. Sci. 403 (1990) 390-448.
33. J. Simonis, A. Ashikhmin. Almost affine codes. Des. Codes Cryptogr. 14 (1998) pp. 179-197.
34. D.R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr. 2 (1992) 357-390.
35. 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.
36. T. Tassa, N. Dyn. Multipartite Secret Sharing by Bivariate Interpolation. 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006 - Lecture Notes in Comput. Sci. 4052 (2006) 288-299.
37. D.J.A. Welsh. Matroid Theory. Academic Press, London, 1976.