Perfect secret sharing schemes on five participants

Designs, Codes, and Cryptography

Volumn 9, Issue 3, 1996, Pages 267-286

  Jackson, Wen Ai ^a   Martin, Keith M ^a  

^a UNIVERSITY OF ADELAIDE   (Australia)

Author keywords

Information rates; Secret sharing

Indexed keywords

EID: 0001652944     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf00129769     Document Type: Article

References (21)

1. J. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, Adv. in Cryptology-CRYPTO '88, Lecture Notes in Computer Science, 403 (1990) pp. 27-35.
2. G. R. Blakley, Safeguarding cryptographic keys, Proceedings of AFIPS 1979 National Computer Conference, 48 (1979) pp. 313-317.
3. C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph decompositions and secret sharing schemes, J.Cryptology, Vol. 8 (1995) pp. 39-64.
4. C. Blundo and A. De Santis, L. Gargano and U. Vaccaro, On the information rate of secret sharing schemes, Adv. in Cryptology-CRYPTO '92, Lecture Notes in Computer Science, 740 (1993) pp. 149-169.
5. E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology, Vol. 2 (1991) pp. 123-134.
6. E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology, Vol. 2 (1992) pp. 153-166.
7. 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-167.
8. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, A note on secret sharing schemes. In Sequences II: Methods in Communications, Security and Computer Science, pp. 335-344. Springer Verlag, 1993.
9. M. van Dijk, On the information rate of perfect secret sharing schemes, Des. Codes Cryptogr., Vol. 6 (1995) pp. 143-169.
10. M. van Dijk, W.-A. Jackson and K. M. Martin, A general decomposition construction for incomplete secret sharing schemes, In preparation.
11. R. G. Gallager, Information Theory and Reliable Communication. John Wiley and Sons, New York (1968).
12. J. W. P. Hirschfeld, Projective Geometries over Finite Fields. Clarendon Press, Oxford (1979).
13. M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing general access structure. Proceedings IEEE Global Telecom. Conf., GLOBECOM '87, IEEE Comm. Soc. Press, (1987) pp. 99-102.
14. W.-A. Jackson and K. M. Martin, Geometric secret sharing schemes and their duals, Des. Codes Cryptogr., Vol. 4 (1994) pp. 83-95.
15. K. M. Martin, New secret sharing schemes from old,J. Combin. Math. Combin. Comput., Vol. 14 (1993) pp. 65-77.
16. A. Shamir, How to share a secret, Comm. ACM, Vol. 22, No.11 (1979) pp. 612-613.
17. G. J. Simmons, W.-A. Jackson, and K. Martin, The geometry of shared secret schemes, Bull. Inst. Combin. Appl., Vol. 1 (1991) pp. 71-88.
18. D. R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 118-125.
19. D. R. Stinson, An explication of secret sharing schemes, Des. Codes Cryptogr., Vol. 2 (1992) pp. 357-390.
20. D. R. Stinson, New general lower bounds on the information rate of secret sharing schemes, Adv. in Cryptology-CRYPTO '92, Lecture Notes in Computer Science, 740 (1993) pp. 168-182.
21. D. Welsh, Codes and Cryptography, Clarendon Press, Oxford (1988).