On the Composition of Matroids and Ideal Secret Sharing Schemes

Designs, Codes, and Cryptography

Volumn 24, Issue 1, 2001, Pages 49-67

  Ng, Siaw Lynn ^a   Walker, Michael ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Ideal secret sharing schemes; Matroids; Minimal authorised sets

Indexed keywords

EID: 0035452614     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1011225330458     Document Type: Article

References (12)

1. E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology, Vol. 4 (1991) pp. 123-134.
2. W.-A. Jackson and K. M. Martin, Perfect secret sharing schemes on five participants, Des. Codes. Cryptogr., Vol. 9 (1996) pp. 267-286.
3. W.-A. Jackson and K. M. Martin, Combinatorial models for perfect secret sharing schemes. To appear in J. Comb. Math. Comb. Comp.
4. C. J. Mitchell, M. Walker and P. R. Wild, The combinatorics of perfect authentication schemes, SIAM J. Discrete Math., Vol. 7, No. 1 (1994) pp. 102-107.
5. P. D. Seymour, On secret-sharing matroids, Journal of Combin. Theory B, Vol. 56 (1992) pp. 69-73.
6. A. Shamir, How to share a secret, Commun, of the ACM, Vol. 22 (1979) pp. 612-613.
7. G. J. Simmons, An introduction to shared secret and/or shared control schemes and their application, In (G. J. Simmons, ed.) Contemporary Cryptology, The Science of Information Integrity, IEEE Press, New York (1991) pp. 441-497.
8. J. Simonis and A. Ashikhmin, Almost affine codes, Des. Codes. Cryptogr., Vol. 14 (1998) pp. 179-197.
9. D. R. Stinson, An explication of secret sharing schemes, Des. Codes. Cryptogr., Vol. 2 (1992) pp. 357-390.
10. V. D. Tonchev, Codes, In (C. J. Colbourn and J. H. Dinitz, eds.) The CRC Handbook of Combinatorial Designs, CRC Press (1996) pp. 517-543.
11. D. J. A. Welsh, Matroid Theory, Academic Press, London (1976).
12. D. J. A. Welsh, Codes and Cryptography, Clarendon Press, Oxford (1988).