Improved constructions of secret sharing schemes by applying (λ, ω)-decompositions

Information Processing Letters

Volumn 99, Issue 4, 2006, Pages 154-157

  van Dijk, Marten ^a   Kevenaar, Tom ^b   Schrijen, Geert Jan ^b   Tuyls, Pim ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Cryptography; Information rate; Secret sharing

Indexed keywords

CRYPTOGRAPHY; DATA HANDLING; DECOMPOSITION; GRAPH THEORY; INFORMATION DISSEMINATION; SECURITY OF DATA; THEOREM PROVING;

INFORMATION RATE; RAMP SCHEMES; SECRET SHARING; SHARING SCHEMES;

DATA PROCESSING;

EID: 33744546371     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2006.01.016     Document Type: Article

References (9)

1. Blundo C., De Santis A., Stinson D.R., and Vaccaro U. Graph decompositions and secret sharing schemes. J. Cryptology 8 (1995) 39-64
2. Brickell E.F., and Davenport D.M. On the classification of ideal secret sharing schemes. J. Cryptology 4 (1991) 123-134
3. Brickell E.F., and Stinson D.R. Some improved bounds on the information rate of perfect secret sharing schemes. J. Cryptology 5 (1992) 153-166
4. van Dijk M. On the information rate of perfect secret sharing schemes. Des. Codes Cryptogr. 6 (1995) 143-169
5. van Dijk M. A linear construction of secret sharing schemes. Des. Codes Cryptogr. 12 (1997) 161-201
6. van Dijk M., Jackson W.-A., and Martin K.M. A general decomposition construction for incomplete secret sharing schemes. Des. Codes Cryptogr. 15 (1998) 301-321
7. Stinson D.R. An explication of secret sharing schemes. Des. Codes Cryptogr. 2 (1992) 357-390
8. Stinson D.R. New general lower bounds on the information rate of secret sharing schemes. Advances in Cryptology-CRYPTO '92. Lecture Notes in Comput. Sci. vol. 740 (1993), Springer, Berlin 168-182
9. Stinson D.R. Decomposition constructions for secret sharing schemes. IEEE Trans. Inform. Theory IT-40 (1994) 118-125