Anonymous secret sharing schemes

Discrete Applied Mathematics

Volumn 77, Issue 1, 1997, Pages 13-28

  Blundo, C ^a   Stinson, D R ^b  

^a UNIVERSITY OF SALERNO   (Italy)

^b UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040096107     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)89208-6     Document Type: Article

References (26)

1. J.C. Benaloh and J. Leichter, Generalized secret sharing and monotone functions, in: S. Goldwasser, ed., Advances in Cryptology - CRYPTO '88, Lecture Notes in Computer Science, Vol. 403 (Springer, Berlin, 1990) 27-35.
2. G.R. Blakley, Safeguarding cryptographic keys, Proc. AFIPS 1979 National Computer Conf., Vol. 48, New York (1979) 313-317.
3. C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, On the information rate of secret sharing schemes, in: E. Brickell, ed., Advances in Cryptology - CRYPTO '92, Lecture Notes in Computer Science, Vol. 740 (Springer, Berlin, 1993) 149-169.
4. C. Blundo, A. De Santis, D.R. Stinson and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptology 8 (1995) 39-64.
5. E.F. Brickell and D.M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology 4 (1991) 123-134.
6. E.F. Brickell and D.R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology 5 (1992) 153-166.
7. R.M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, A note on secret sharing schemes, in: R. Capocelli, A. De Santis and U. Vaccaro, eds., Sequences II: Methods in Communication, Security and Computer Science (Springer, Berlin, 1993) 335-344.
8. R.M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, On the size of shares for secret sharing schemes, J. Cryptology 6 (1993) 157-169.
9. D. Chen and D.R. Stinson, Recent results on combinatorial constructions for threshold schemes, Australasian J. Combin. 1 (1990) 29-48.
10. C.J. Colbourn and J.H. Dinitz, eds., CRC Handbook of Combinatorial Designs (CRC Press, Boca Raton, 1996).
11. M. Garey and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, (W.H. Freeman, New York, 1979).
12. O. Goldreich, S. Micali and A. Wigderson, How to play any mental game, Proc. 19th ACM STOC (1987) 218-229.
13. H. Hanani, D.K. Ray-Chaudhuri and R.M. Wilson, On resolvable designs, Discrete Math. 3 (1972) 343-357.
14. M. Ito, A. Saito and T. Nishizeki, Secret sharing scheme realizing general access structure, Proc. Globecom '87, Tokyo, Japan (1987) 99-102.
15. W.-A. Jackson and K.M. Martin, Combinatorial models for perfect secret sharing schemes, J. Combin. Math. Combin. Comput., to appear.
16. K. Kurosawa and K. Okada, Combinatorial interpretation of secret sharing schemes, in: J. Pieprzyk and R. Safavi-Naini, eds., Advances in Cryptology - ASIACRYPT '94, Lecture Notes in Computer Science, Vol. 917 (Springer, Berlin, 1995) 55-64.
17. K.M. Martin, New secret sharing schemes from old, J. Combin. Math. Combin. Comput. 14 (1993) 65-77.
18. S.J. Phillips and N.C. Phillips, Strongly ideal secret sharing schemes, J. Cryptology 5 (1992) 185-191.
19. D.K. Ray-Chaudhuri and R.M. Wilson, Solution of Kirkman' s Schoolgirl Problem, Amer. Math. Soc. Proc. Symp. Pure Math. 19 (1971) 187-204.
20. P.J. Schellenberg and D.R. Stinson, Threshold schemes from combinatorial designs, J. Combin. Math. Combin. Comput. 5 (1989) 143-160.
21. A. Shamir, How to share a secret, Comm. ACM 22 (1979) 612-613.
22. G.J. Simmons, An introduction to shared secret and/or shared control schemes and their application, in: G.J. Simmons, ed., Contemporary Cryptology (IEEE Press, New York, 1991) 441-497.
23. D.R. Stinson, An explication of secret sharing schemes, Designs, Codes and Cryptography 2 (1992) 357-390.
24. D.R. Stinson, New general lower bounds on the information rate of secret sharing schemes, in: E. Brickell, ed., Advances in Cryptology - CRYPTO '92, Lecture Notes in Computer Science, Vol. 740 (Springer, Berlin, 1993) 170-184.
25. D.R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory 40 (1994) 118-125.
26. D.R. Stinson and S.A. Vanstone, A combinatorial approach to threshold schemes, SIAM J. Discrete Math. 1 (1988) 230-236.