Matroids can be far from ideal secret sharing

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

Volumn 4948 LNCS, Issue , 2008, Pages 194-212

  Beimel, Amos ^a   Livne, Noam ^b   Padró, Carles ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; GRAPH THEORY; SET THEORY;

(E ,2E) THEORY; ACCESS STRUCTURE; COMBINATORIAL THEORY; CRYPTOLOGY; LOWER BOUNDS; MATROID; NON-TRIVIAL; OPTIMAL LENGTH; SECRET SHARING; SECRET VALUES; SHARING SCHEMES;

MATRIX ALGEBRA;

EID: 40249109897     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78524-8_12     Document Type: Conference Paper

References (36)

1. Beimel, A., Chor, B.: Universally ideal secret sharing schemes. IEEE Trans. on Information Theory 40(3), 786-794 (1994)
2. Beimel, A., Livne, N.: On matroids and non-ideal secret sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 482-501, Springer, Heidelberg (2006)
3. Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Proc. of the 14th conference on Computer and communications security, pp. 172-184 (2007)
4. Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol 403, pp. 27-35. Springer, Heidelberg (1990)
5. Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. of the 1979 AFIPS National Computer Conference, pp. 313-317 (1979)
6. Blundo, C., De Santis, A., Vaccaro, U.: On secret sharing schemes. Inform. Process. Lett. 65(1), 25-32 (1998)
7. Brickell, E.F.: Some ideal secret sharing schemes. Journal of Combin. Math, and Combin. Comput. 6, 105-113 (1989)
8. Brickell, E.F., Davenport, D.M.: On the classification of ideal secret sharing schemes. J. of Cryptology 4(73), 123-134 (1991)
9. Brickell, E.F., Stinson, D.R.: Some improved bounds on the information rate of perfect secret sharing schemes. J. of Cryptology 5(3), 153-166 (1992)
10. Capocelli, R.M., De Santis, A., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. J. of Cryptology 6(3), 157-168 (1993)
11. Chor, B., Kushilevitz, E.: Secret sharing over infinite domains. J. of Cryptology 6(2), 87-96 (1993)
12. Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Chichester (1991)
13. Csirmaz, L.: The size of a share must be large. J. of Cryptology 10(4), 223-231 (1997)
14. van Dijk, M., Jackson, W.A., Martin, K.M.: A note on duality in linear secret sharing schemes. Bull, of the Institute of Combinatorics and its Applications 19, 98-101 (1997)
15. Dougherty, R., Freiling, C., Zeger, K.: Six new non-Shannon information inequalities. In: IEEE International Symposium on Information Theory (ISIT), pp. 233-236 (2006)
16. Dougherty, R., Freiling, C., Zeger, K.: Networks, matroids, and non-Shannon information inequalities. IEEE Trans. on Information Theory 53(6), 1949-1969 (2007)
17. Ingleton, A.W.: Conditions for representability and transversability of matroids. In: Proc. Fr. Br. Conf 1970, pp. 62-67. Springer, Heidelberg (1971)
18. Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. of the IEEE Global Telecommunication Conf., Globecom 1987, pp. 99-102 (1987)
19. Karchmer, M., Wigderson, A.: On span programs. In: Proc. of the 8th IEEE Structure in Complexity Theory, pp. 102-111 (1993)
20. Karnin, E.D., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. on Information Theory 29(1), 35-41 (1983)
21. Kurosawa, K., Okada, K., Sakano, K., Ogata, W., Tsujii, S.: Nonperfect secret sharing schemes and matroids. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 126-141, Springer, Heidelberg (1994)
22. Livne, N.: On matroids and non-ideal secret sharing. Master's thesis, Ben-Gurion University, Beer-Sheva (2005)
23. Martí-Farré, J., Padró, C.: Secret sharing schemes with three or four minimal qualified subsets. Designs, Codes and Cryptography 34(1), 17-34 (2005)
24. Martí-Farré, J., Padró, C.: On secret sharing schemes, matroids and polymatroids. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 253-272. Springer, Heidelberg (2007)
25. Martí-Farré, J., Padró, C.: On secret sharing schemes, matroids and polymatroids. Journal version of [24]. Technical Report 2006/077, Cryptology ePrint Archive (2006), http://eprint.iacr.org/
26. Matúš, F.: Matroid representations by partitions. Discrete Mathematics 203, 169-194 (1999)
27. Matúš, F.: Two constructions on limits of entropy functions. IEEE Trans. on Information Theory 53(1), 320-330 (2007)
28. Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)
29. Seymour, P.D.: A forbidden minor characterization of matroid ports. Quart. J. Math, Oxford Ser. 27, 407-413 (1976)
30. Seymour, P.D.: On secret-sharing matroids. J. of Combinatorial Theory, Series B 56, 69-73 (1992)
31. Shamir, A.: How to share a secret. Communications of the ACM 22, 612-613 (1979)
32. Simmons, G.J., Jackson, W., Martin, K.M.: The geometry of shared secret schemes. Bulletin of the ICA 1, 71-88 (1991)
33. Simonis, J., Ashikhmin, A.: Almost affine codes. Designs, Codes and Cryptography 14(2), 179-197 (1998)
34. Vamos, P.: On the representation of independence structures (1968)(unpublished manuscript)
35. Welsh, D.J.A.: Matroid Theory. Academic press, London (1976)
36. Zhang, Z., Yeung, R. W.: On characterization of entropy function via information inequalities. IEEE Trans. on Information Theory 44(4), 1440-1452 (1998)