Secret sharing schemes with three or four minimal qualified subsets

Designs, Codes, and Cryptography

Volumn 34, Issue 1, 2005, Pages 17-34

  Martí FARRÉ, Jaume ^a   Padró, Carles ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Cryptography; Ideal schemes; Information rate; Secret sharing schemes

Indexed keywords

CHARACTERIZATION; CRYPTOGRAPHY; DATA PROCESSING; OPTIMIZATION; RANDOM PROCESSES; SET THEORY; THEOREM PROVING;

IDEAL SCHEMES; INFORMATION RATE; SECRET SHARING SCHEMES; SUBSETS;

SECURITY OF DATA;

EID: 14644407439     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-003-4192-1     Document Type: Article

References (17)

1. G. R. Blakley, Safeguarding cryptographic keys, AFIPS Conf. Proc. Vol. 48 (1979) pp. 313-317.
2. C. Blundo, A. De Santis, R. De Simone and U. Vaccaro, Tight bounds on the information rate of secret sharing schemes, Designs, Codes Cryptography. Vol. 11 (1997) pp. 107-122.
3. C. Blundo, A. De Santis, L. Gargano and U. Vaccaro, On the information rate of secret sharing schemes. Advances in Cryptology CRYPTO'92, Lecture Notes in Comput. Sci. Vol. 740 pp. 148-167.
4. C. Blundo, A. De Santis, D. R. Stinson and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptol. Vol. 8 (1995) pp. 39-64.
5. E. F. Brickell, Some ideal secret sharing schemes, J. Comb. Math. Comb. Comput. Vol. 9 (1989) pp. 105-113.
6. E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes, J. Cryptol. Vol. 4 (1991) pp. 123-134.
7. E. F. Brickell, D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptol. Vol. 5 (1992) pp. 153-166.
8. R. M. Capocelli, A. De Santis, L. Gargano and U. Vaccaro, On the size of shares of secret sharing schemes, J. Cryptol. Vol. 6 (1993) pp. 157-168.
9. M. Ito, A. Saito and T. Nishizeki, Secret sharing scheme realizing any access structure, Proc. IEEE Globecom.'Vol 87. (1987) pp. 99-102.
10. W. A. Jackson and K. M. Martin, Geometric secret sharing schemes and their duals, Designs, Codes Cryptograph. Vol. 4 (1994) pp. 83-95.
11. W. A. Jackson and K. M. Martin, Perfect secret sharing schemes on five participants, Designs, Codes Cryptograph. Vol. 9 (1996) pp. 267-286.
12. C. Padró and G. Sáez, Secret sharing schemes with bipartite access structure, IEEE Trans. Inform. Theory, Vol. 46, No. 7 (2000) pp. 2596-2604.
13. A. Shamir, How to share a secret, Commun. ACM, Vol. 22 (1979) pp. 612-613.
14. G. J. Simmons, An introduction to shared secret and/or shared control schemes and their application, Contemporary Cryptology. The Science of Information Integrity, IEEE Press (1991) pp. 441-497.
15. D.R. Stinson, An explication of secret sharing schemes, Design, Codes Cryptograph. Vol. 2 (1992) pp. 357-390.
16. D. R. Stinson, Decomposition constructions for secret-sharing schemes, IEEE Trans. Inform. Theory, Vol. 40 (1994) pp. 118-125.
17. D. R. Stinson, Cryptography: Theory and Practice. CRC Press Inc., Boca Raton (1995).