On secret sharing schemes

Information Processing Letters

Volumn 65, Issue 1, 1998, Pages 25-32

  Blundo, Carlo ^a   De Santis, Alfredo ^a   Vaccaro, Ugo ^a  

^a UNIVERSITY OF SALERNO   (Italy)

Author keywords

Cryptography; Safety security in digital systems; Secret sharing

Indexed keywords

EID: 0042854815     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00194-4     Document Type: Article

References (24)

1. C. Blundo, A. Cresti, Space requirements for broadcast encryption, in: EUROCRYPT 94, Lecture Notes in Computer Science, vol. 950, Springer, Berlin, 1995, pp. 287-298.
2. C. Blundo, A. Cresti, A. De Santis, U. Vaccaro, Fully dynamic secret sharing schemes, Theoret. Comput. Sci. 165 (1996) 407-440.
3. C. Blundo, A. Giorgio Gaggia, D.R. Stinson, On the dealer's randomness required in secret sharing schemes, Designs, Codes and Cryptography 11 (2) (1997) 107-122.
4. C. Blundo, A. De Santis, R. De Simone, U. Vaccaro, Tight bounds on the information rate of secret sharing schemes, Designs, Codes and Cryptography 11 (1) (1997) 1-25.
5. C. Blundo, A. De Santis, L. Gargano, U. Vaccaro, On the information rate of secret sharing schemes, Theoret. Comput. Sci. 154 (1996) 283-306.
6. C. Blundo, A. De Santis, A. Giorgio Gaggia, U. Vaccaro, New bounds on the information rate of secret sharing schemes, IEEE Trans. Inform. Theory 41 (1995) 549-554.
7. C. Blundo, A. De Santis, D.R. Stinson, U. Vaccaro, Graph decomposition and secret sharing schemes, J. Cryptology 8 (1995) 39-64.
8. C. Blundo, A. De Santis, U. Vaccaro, Efficient sharing of many secrets, in: STACS 93, Lecture Notes in Computer Science, vol. 665, Springer, Berlin, 1993, pp. 692-703.
9. C. Blundo, A. De Santis, U. Vaccaro, Randomness in distribution protocols, Inform. and Comput. 131 (2) (1996) 111-139.
10. E.F. Brickell, D.M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptology 4 (2) (1991) 123-124.
11. E.F. Brickell, D.R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptology 5 (3) (1992) 153-166.
12. R.M. Capocelli, A. De Santis, L. Gargano, U. Vaccaro, On the size of shares for secret sharing schemes, J. Cryptology 6 (3) (1993) 157-169.
13. T.M. Cover, J.A. Thomas, Elements of Information Theory, John Wiley & Sons, New York, 1991.
14. L. Csirmaz, The size of a share must be large, in: A. De Santis (Ed.), Advances in Cryptology - Eurocrypt'94, Lecture Notes in Computer Science, vol. 950, Springer, Berlin, 1995, pp. 13-22.
15. M. van Dijk, On the information rate of perfect secret sharing schemes, Design, Codes and Cryptography 6 (1995) 143-169.
16. W.A. Jackson, K.M. Martin, Combinatorial models for perfect secret sharing schemes, J. Combin. Math. Combin. Comput. (to appear).
17. E.D. Karnin, J.W. Greene, M.E. Hellman, On secret sharing systems, IEEE Trans. Inform. Theory 29 (1) (1983) 35-41.
18. K. Kurosawa, K. Okada, Combinatorial lower bounds for secret sharing schemes. Inform. Process. Lett. 60 (1996) 301-304.
19. G.J. Simmons, An introduction to shared secret and/or shared control schemes and their application, in: Contemporary Cryptology, IEEE Press, 1991, pp. 441-497.
20. D.R. Stinson, An explication of secret sharing schemes. Designs, Codes and Cryptography 2 (1992) 357-390.
21. D.R. Stinson, New general lower bounds on the information rate of secret sharing schemes, in: CRYPTO 92, Lecture Notes in Computer Science, vol. 740, Springer, Berlin, 1993, pp. 170-184.
22. D.R. Stinson, Decomposition constructions for secret sharing schemes, IEEE Trans. Inform. Theory 40 (1994) 118-125.
23. D.R. Stinson, Cryptography Theory and Practice, CRC Press, Inc., Boca Raton, FL, 1995.
24. D.R. Stinson, Bibliography on secret sharing, available on-line as http://bibd.unl.edu/~stinson/ssbib.html.