On matroid characterization of ideal secret sharing schemes

Journal of Cryptology

Volumn 11, Issue 2, 1998, Pages 75-86

  Golic, Jovan Dj ^a  

^a NONE

Author keywords

Access structures; Ideal secret sharing schemes; Matroids

Indexed keywords

EID: 33746013588     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001459900036     Document Type: Article

References (17)

1. A. Beimel and B. Chor, Universally ideal secret sharing schemes, Advances in Cryplology - Crypto '92, Lecture Notes in Computer Science, vol. 740, E. F. Brickell, ed., Springer-Verlag, Berlin, 1993, pp. 183-195.
2. J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, Advances in Cryptology Crypto '88, Lecture Notes in Computer Science, vol. 403, S. Goldwasser, ed., Springer-Verlag, Berlin, 1990. pp. 27-35.
3. G. R. Blakley, Safeguarding cryptographic keys, Proc. AF1PS 1979, NCC, vol. 48, New York, 1979, pp. 313-317.
4. C. Blundo, A. De Santis, D. P. Stinson, and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptology, vol. 8 (1995), pp. 39-64.
5. E. F. Brickell, Some ideal secret sharing schemes, J. Combin. Math. Combln. Comput., vol. 6 (1989), pp. 105-113.
6. E. R Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology, vol. 4 (1991), pp. 123-134.
7. E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology, vol. 5 (1992), pp. 153-166.
8. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares for secret sharing schemes, J. Cryptology, vol. 6 (1993), pp. 157-168.
9. S. Fujishige, Polymatroidal dependence structure of a set of random variables. Inform, and Control, vol. 39 (1978), pp. 55-72.
10. M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing general access structure, Proc. IEEE Globecom '87, Tokyo, 1987, pp. 99-102.
11. K. M. Martin, Discrete Structures in the Theory of Secret Sharing, Ph.D. thesis, University of London, 1991.
12. P. D. Seymour, On secret-sharing matroids, J. Combin. Theory Ser. B, vol. 56 (1992), pp. 69-73.
13. A. Shamir, How to share a secret, Comm. ACM, vol. 22 (1979), pp. 612-613.
14. T. Siegenthaler, Correlation-immunity of nonlinear combining functions for cryptographic applications, IEEE Trans. Inform. Theory, vol. 30 (1984), pp. 776-780.
15. G. J. Simmons, An introduction to shared secret and/or shared control schemes and.their applications, Contemporary Cryptology: the Science of Information Integrity, G. J. Simmons, ed., IEEE Press, New York, 1992, pp. 441-497.
16. D. R. Stinson, An explication of secret sharing schemes. Designs, Codes and Cryptography, vol. 2 (1992), pp. 357-390.
17. D. J. A. Welsh, Matroid Theory, Academic Press, London, 1976.