On secret sharing schemes, matroids and polymatroids

Journal of Mathematical Cryptology

Volumn 4, Issue 2, 2010, Pages 95-120

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

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Ideal secret sharing schemes; Matroids; Optimization of secret sharing schemes for general access structures; Polymatroids; Secret sharing

Indexed keywords

EID: 79959310457     PISSN: 18622976     EISSN: 18622984     Source Type: Journal    
DOI: 10.1515/JMC.2010.004     Document Type: Article

References (48)

1. A. Beimel and Y. Ishai, On the power of nonlinear secret sharing schemes, SIAM J. Discrete Math. 19 (2005), 258-280.
2. A. Beimel and 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. (Pubitemid 43979864)
3. A. Beimel, N. Livne, and C. Padró, Matroids Can Be Far From Ideal Secret Sharing, Fifth Theory of Cryptography Conference, TCC 2008, Lecture Notes in Comput. Sci. 4948 (2008), 194-212.
4. A. Beimel and I. Orlov, Secret Sharing and Non-Shannon Information Inequalities, Sixth Theory of Cryptography Conference, TCC 2009, Lecture Notes in Comput. Sci. 5444 (2009), 539-557.
5. A. Beimel, T. Tassa, and E. Weinreb, Characterizing Ideal Weighted Threshold Secret Sharing, Second Theory of Cryptography Conference, TCC 2005, Lecture Notes in Comput. Sci. 3378 (2005), 600-619. (Pubitemid 41231185)
6. A. Beimel and E. Weinreb, Separating the power of monotone span programs over different fields, SIAM J. Comput. 34 (2005), 1196-1215. (Pubitemid 41495292)
7. J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, Advances in Cryptology, CRYPTO'88, Lecture Notes in Comput. Sci. 403 (1990), 27-35.
8. G. R. Blakley, Safeguarding cryptographic keys, AFIPS Conference Proceedings 48 (1979), 313-317.
9. G. R. Blakley and G.A. Kabatianski, On General Perfect Secret Sharing Schemes, Advances in Cryptology, CRYPTO'95, Lecture Notes in Comput. Sci. 963 (1995), 367-371.
10. C. Blundo, A. De Santis, R. De Simone, and U. Vaccaro, Tight bounds on the information rate of secret sharing schemes, Des. Codes Cryptogr. 11 (1997), 107-122. (Pubitemid 127502285)
11. C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the information rate of secret sharing schemes, Advances in Cryptology, CRYPTO'92. Lecture Notes in Comput. Sci. 740 (1993), 148-167.
12. C. Blundo, A. De Santis, D.R. Stinson, and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptology 8 (1995), 39-64.
13. E. F. Brickell, Some ideal secret sharing schemes, J. Combin. Math. and Combin. Comput. 9 (1989), 105-113.
14. E. F. Brickell and D.M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology 4 (1991), 123-134.
15. E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology 5 (1992), 153-166. (Pubitemid 23607284)
16. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares of secret sharing schemes, J. Cryptology 6 (1993), 157-168.
17. T. M. Cover, J. A. Thomas, Elements of Information Theory, 2nd ed. Wiley, New York, 2006.
18. L. Csirmaz, The size of a share must be large, J. Cryptology 10 (1997), 223-231. (Pubitemid 127754573)
19. M. van Dijk, T. Kevenaar, G. Schrijen, and P. Tuyls, Improved constructions of secret sharing schemes by applying .-decompositions, Inf. Process. Lett. 99 (2006), 154-157. (Pubitemid 43816995)
20. R. Dougherty, C. Freiling, and K. Zeger, Six new non-Shannon information inequalities, In IEEE International Symposium on Information Theory (ISIT) (2006) 233-236. (Pubitemid 351244088)
21. S. Fehr, Efficient Construction of the Dual Span Program, Manuscript.
22. S. Fujishige, Entropy functions and polymatroids-combinatorial structures in information theory, Electron. Comm. Japan 61 (1978), 14-18. (Pubitemid 10441095)
23. S. Fujishige, Polymatroidal Dependence Structure of a Set of Random Variables, Information and Control 39 (1978), 55-72. (Pubitemid 9408951)
24. A. Gál, 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.
25. M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing any access structure, Proc. IEEE Globecom'87 (1987), 99-102. (Pubitemid 18628648)
26. W.-A. Jackson and K. M. Martin, Geometric secret sharing schemes and their duals, Des. Codes Cryptogr. 4 (1994), 83-95.
27. W.-A. Jackson and K. M. Martin, Perfect secret sharing schemes on five participants, Des. Codes Cryptogr. 9 (1996), 267-286. (Pubitemid 126708419)
28. E. D. Karnin, J.W. Greene, and M. E. Hellman, On secret sharing systems, IEEE Trans. Inform. Theory 29 (1983), 35-41.
29. A. Lehman, A solution of the Shannon switching game, J. Soc. Indust. Appl. Math. 12 (1964), 687-725.
30. A. Lehman, Matroids and Ports, Notices Amer. Math. Soc. 12 (1965), 356-360.
31. K. Makarychev, Y. Makarychev, A. Romashchenko, and N. Vereshchagin, A new class of non-Shannon type inequalities for entropies, Communications in Information and Systems 2 (2002), 147-166.
32. J. Martí-Farré and C. Padró, Secret sharing schemes with three or four minimal qualified subsets, Des. Codes Cryptogr. 34 (2005), 17-34. (Pubitemid 40308070)
33. J. Martí-Farré and C. Padró, Secret sharing schemes on access structures with intersection number equal to one, Discrete Applied Mathematics 154 (2006), 552-563. (Pubitemid 43207392)
34. F. Matúš, Matroid representations by partitions, Discrete Math. 203 (1999), 169-194. (Pubitemid 129604254)
35. F. Matúš, Infinitely many information inequalities, IEEE International Symposium on Information Theory 2007, pp. 41-44, 2007.
36. J. R. Metcalf-Burton, Improved Upper Bounds for the Information Rates of the Secret Sharing Schemes Induced by the Vamos Matroid, Preprint, available at http://arxiv.org/abs/0809.3010 (2008).
37. J. G. Oxley, Matroid theory. Oxford Science Publications. The Clarendon Press, Oxford University Press, New York, 1992.
38. C. Padró and G. Sáez, Secret sharing schemes with bipartite access structure, IEEE Trans. Inform. Theory 46 (2000), 2596-2604. (Pubitemid 32090036)
39. C. Padró and G. Sáez, Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. Inform. Process. Lett. 83 (2002), 345-351. (Pubitemid 34808434)
40. P. D. Seymour, A forbidden minor characterization of matroid ports, Quart. J. Math. Oxford Ser. 27 (1976), 407-413.
41. P. D. Seymour, On secret-sharing matroids, J. Combin. Theory Ser. B 56 (1992), 69-73.
42. A. Shamir, How to share a secret, Commun. of the ACM 22 (1979), 612-613.
43. J. Simonis and A. Ashikhmin, Almost affine codes, Des. Codes Cryptogr. 14 (1998), 179-197. (Pubitemid 128507639)
44. D. R. Stinson, An explication of secret sharing schemes, Des. Codes Cryptogr. 2 (1992), 357-390.
45. 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.
46. D. R. Stinson, Decomposition constructions for secret-sharing schemes, IEEE Trans. Inform. Theory 40 (1994), 118-125.
47. D. J. A. Welsh, Matroid Theory. Academic Press, London, 1976.
48. Z. Zhang and R.W. Yeung, On characterization of entropy function via information inequalities, IEEE Trans. Inform. Theory 44 (1998), 1440-1452. (Pubitemid 128736707)