On secret sharing schemes, matroids and polymatroids

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

Volumn 4392 LNCS, Issue , 2007, Pages 273-290

  Martí Farré, Jaume ^a   Padró, Carles ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Ideal access structures; Ideal secret sharing schemes; Information rate; Matroids; Polymatroids; Secret sharing

Indexed keywords

DATA STRUCTURES; INFORMATION THEORY; PROBLEM SOLVING;

IDEAL ACCESS STRUCTURES; IDEAL SECRET SHARING SCHEMES; INFORMATION RATE; POLYMATROIDS; SECRET SHARING;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38049036249     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70936-7_15     Document Type: Conference Paper

References (39)

1. A. Beimel, Y. Ishai. On the power of nonlinear secret sharing schemes. SIAM J. Discrete Math. 19 (2005) 258-280.
2. 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.
3. 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.
4. A. Beimel, E. Weinreb. Separating the power of monotone span programs over different fields. SIAM J. Comput. 34 (2005) 1196-1215.
5. G.R. Blakley. Safeguarding cryptographic keys. AFIPS Conference Proceedings. 48 (1979) 313-317.
6. 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.
7. 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.
8. C. Blundo, A. De Santis, D.R. Stinson, U. Vaccaro. Graph decompositions and secret sharing schemes. J. Cryptology 8 (1995) 39-64.
9. E.F. Brickell. Some ideal secret sharing schemes. J. Combin. Math. and Combin. Comput. 9 (1989) 105-113.
10. E.F. Brickell, D.M. Davenport. On the classification of ideal secret sharing schemes. J. Cryptology 4 (1991) 123-134.
11. E.F. Brickell, D.R. Stinson. Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptology 5 (1992) 153-166.
12. 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.
13. L. Csirmaz. The size of a share must be large. J. Cryptology 10 (1997) 223-231.
14. S. Fehr. Efficient Construction of the Dual Span Program. Manuscript.
15. S. Fujishige. Entropy functions and polymatroids-combinatorial structures in information theory. Electron. Comm. Japan 61 (1978) 14-18.
16. S. Fujishige. Polymatroidal Dependence Structure of a Set of Random Variables. Information and Control 39 (1978) 55-72.
17. A. Gal. A characterization of span program size and improved lower bounds for monotone span programs. Proceedings of 30th ACM Symposium on the Theory of Computing, STOC 1998 (1998) 429-437.
18. M. Ito, A. Saito, T. Nishizeki. Secret sharing scheme realizing any access structure. Proc. IEEE Globecom'87 (1987) 99-102.
19. W.-A. Jackson, K.M. Martin. Perfect secret sharing schemes on five participants. Des. Codes Cryptogr. 9 (1996) 267-286.
20. E.D. Kamin, J.W. Greene, M.E. Hellman. On secret sharing systems. IEEE Trans. Inform. Theory 29 (1983) 35-41.
21. A. Lehman. A solution of the Shannon switching game. J. Soc. Indust. Appl. Math. 12 (1964) 687-725.
22. A. Lehman. Matroids and Ports. Notices Amer. Math. Soc. 12 (1965) 356-360.
23. J.Martí-Farré, C. Padró. Secret sharing schemes on sparse homogeneous access structures with rank three. Electronic Journal of Combinatorics 11(1) (2004) Research Paper 72, 16 pp. (electronic).
24. J. Martí-Farré, C. Padró. Secret sharing schemes with three or four minimal qualified subsets. Des. Codes Cryptogr. 34 (2005) 17-34.
25. 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.
26. J. Martí-Farré, C. Padró. Secret sharing schemes on access structures with intersection number equal to one. Discrete Applied Mathematics 154 (2006) 552-563.
27. F. Matúš. Matroid representations by partitions. Discrete Math. 203 (1999) 169-194.
28. V. Nikov, S. Nikova, B. Preneel. On the Size of Monotone Span Programs. Fourth Conference on Security in Communication Networks - SCN 2004. Lecture Notes in Comput. Sci. 3352 (2004) 252-265.
29. J.G. Oxley. Matroid theory. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1992.
30. C. Padró, G. Sáez. Secret sharing schemes with bipartite access structure. IEEE Trans. Inform. Theory 46 (2000) 2596-2604.
31. C. Padró, G. Sáez. Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. Inform. Process. Lett. 83 (2002) 345-351. Quoting Marc Heymann Pignolo ¡mheymann@ma4.upc.edu¿:
32. P.D. Seymour. A forbidden minor characterization of matroid ports. Quart. J. Math. Oxford Ser. 27 (1976) 407-413.
33. P.D. Seymour. On secret-sharing matroids. J. Combin. Theory Ser. B 56 (1992) 69-73.
34. A. Shamir. How to share a secret. Commun, of the ACM 22 (1979) 612-613.
35. J. Simonis, A. Ashikhmin. Almost affine codes. Des. Codes Cryptogr. 14 (1998) 179-197.
36. D.R. Stinson. An explication of secret sharing schemes. Des. Codes Cryptogr. 2 (1992) 357-390.
37. D.R. Stinson. New general lower bounds on the information rate of secret sharing schemes. Advances in Cryptology - CRYPTO'92. Lecture Notes in Comput. Sci. 740 (1993) 168-182.
38. D.R. Stinson. Decomposition constructions for secret-sharing schemes. IEEE Trans. Inform. Theory 40 (1994) 118-125.
39. D.J.A. Welsh. Matroid Theory. Academic Press, London, 1976.