L. Antunes, S. Laplante, A. Pinto, and L. Salvador, Cryptographic Security of Individual Instances, LNCS, vol.4883, pp.195-210, 2009.
DOI : 10.1007/978-3-642-10230-1_17

A. Beimel and M. K. Franklin, Weakly-Private Secret Sharing Schemes, Theory of Cryptography, pp.253-272, 2007.
DOI : 10.1007/978-3-540-70936-7_14
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.77.5687

A. Beimel, N. Livne, and C. Padró, Matroids Can Be Far from Ideal Secret Sharing, TCC, pp.194-212, 2008.
DOI : 10.1007/978-3-540-78524-8_12

A. Beimel and I. Orlov, Secret sharing and non-shannon information inequalities, TCC, pp.539-557, 2009.

J. Cohen-benaloh and J. Leichter, Generalized Secret Sharing and Monotone Functions, CRYPTO, pp.27-35, 1988.
DOI : 10.1007/0-387-34799-2_3

E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, pp.10-1007, 1992.

F. Ernest, D. M. Brickell, and . Davenport, On the classification of ideal secret sharing schemes, J. Cryptology, vol.4, issue.2, pp.123-134, 1991.

R. M. Capocelli, A. De-santis, L. Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes, Journal of Cryptology, vol.6, issue.3, pp.157-168, 1993.
DOI : 10.1007/BF00198463

L. Csirmaz, The Size of a Share Must Be Large, Journal of Cryptology, vol.10, issue.4, pp.223-231, 1997.
DOI : 10.1007/s001459900029

D. Hammer, A. Romashchenko, A. Shen, and N. Vereshchagin, Inequalities for Shannon Entropy and Kolmogorov Complexity, Journal of Computer and System Sciences, vol.60, issue.2, pp.442-464, 2000.
DOI : 10.1006/jcss.1999.1677
URL : http://doi.org/10.1006/jcss.1999.1677

M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing general access structure, IEEE Globecom, pp.99-102, 1987.
DOI : 10.1002/ecjc.4430720906

E. D. Karnin, J. W. Greene, and M. E. Hellman, On secret sharing systems, IEEE Transactions on Information Theory, vol.29, issue.1, pp.35-41, 1983.
DOI : 10.1109/TIT.1983.1056621

K. Kurosawa and K. Okada, Combinatorial lower bounds for secret sharing schemes, Information Processing Letters, vol.60, issue.6, pp.301-304, 1996.
DOI : 10.1016/S0020-0190(96)00178-0

K. Kurosawa, K. Okada, K. Sakano, W. Ogata, and S. Tsujii, Nonperfect Secret Sharing Schemes and Matroids, Advances in cryptology, EUROCRYPT '93, pp.126-141, 1994.
DOI : 10.1007/3-540-48285-7_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.4987

M. Li and P. Vitányi, An Introduction to Kolmogorov complexity and its applications, 1997.

F. Matú?, Matroid representations by partitions, Discrete Mathematics, vol.203, issue.1-3, pp.169-194, 1999.
DOI : 10.1016/S0012-365X(99)00004-7

J. Ruth-metcalf-burton, Improved upper bounds for the information rates of the secret sharing schemes induced by the V??mos matroid, Discrete Mathematics, vol.311, issue.8-9, pp.8-9651, 2011.
DOI : 10.1016/j.disc.2011.01.003

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979.
DOI : 10.1145/359168.359176

K. Srinathan, N. Tharani-rajan, and C. Pandu-rangan, Non-perfect Secret Sharing over General Access Structures, Proc. Progress in Cryptology, INDOCRYPT '02, pp.409-421, 2002.
DOI : 10.1007/3-540-36231-2_32

A. K. Zvonkin and L. A. Levin, THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS, Russian Mathematical Surveys, vol.25, issue.6, p.11, 1970.
DOI : 10.1070/RM1970v025n06ABEH001269