Nonperfect secret sharing schemes and matroids

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 765 LNCS, Issue , 1994, Pages 126-141

  Kurosawa, Kaoru ^a   Okada, Koji ^a   Sakano, Keiichi ^a   Ogata, Wakaha ^a   Tsujii, Shigeo ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; ENTROPY;

ACCESS LEVELS; DIRECT LINKS; LOWER BOUNDS; RANK FUNCTIONS; SECRET SHARING; SECRET SHARING SCHEMES;

COMBINATORIAL MATHEMATICS;

EID: 84985848633     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48285-7_11     Document Type: Conference Paper

References (20)

1. G.R. Blakley: Safeguarding cryptographic keys. Proc. of the AFIPS 1979 National Computer Conference, vol.48, pp.313–317 (1979)
2. A. Shamir: How to share a secret. Communications of the ACM, 22,(11), pp.612–613 (1979)
3. M. Itoh, A. Saito, T. Nishizeki: Secret sharing scheme realizing general access structure. Proc. of IEEE Globecom’ 87, Tokyo, pp.99–102 (1987)
4. J.C. Benaloh, J. Leichter: Generalized secret sharing and monotone functions. Crypto’88, pp.27–36 (1990)
5. E.F. Brickell, D.M. Davenport: On the classification of ideal secret sharing schemes. Journal of Cryptology, vol.4, No.2, pp.123–134 (1991)
6. R.M. Capocelli, A. De Santis, L. Gargano, U. Vaccaro: On the size of shares for secret sharing schemes. Crypto’91, pp.101–113 (1991)
7. E.D. Karnin, J.W. Green, M.E. Hellman: On secret sharing systems. IEEE Trans. IT-29, No.1, pp.35–41 (1982)
8. E.F. Brickell, D.R. Stinson: Some improved bounds on the information rate of perfect secret sharing schemes. Crypto’90, pp.242–252 (1990)
9. C. Blund, A. De Santis, D.R. Stinson, U. Vaccaro: Graph decomposition and secret sharing schemes. Eurocrypt’92, pp.1–20 (1992)
10. Y. Frankel, Y. Desmedt: Classification of ideal homomorphic threshold schemes over finite Abelian groups. Eurocrypt’92, pp.21–29 (1992)
11. C. Blund, A. De Santis, L. Gargano, U. Vaccaro: On the information rate of secret sharing schemes. Crypto’92 (1992)
12. D.R. Stinson: New general bounds on the information rate of secret sharing schemes. Crypto’92 (1992)
13. A. Beimel, B. Chor: Universally ideal secret sharing schemes. Crypt’92 (1992)
14. W.A. Jackson, K.M. Martin: Cumulative arrays and geometric secret sharing schemes. Auscrypt’92 (1992)
15. M. Bertilsson, I. Ingemarsson: A construction of practical secret sharing schemes using linear block codes. Auscrypt’92 (1992)
16. G.R. Blakley, C. Meadows: Security of ramp schemes. Crypto’84, pp.242–268 (1984)
17. D.J.A. Welsh: Matroid theory. Academic Press (1976)
18. W. Ogata, K. Kurosawa, S. Tsujii: Nonperfect secret sharing schemes. Auscrypt’92 (1992)
19. R.G. Gallager: Information Theory and Reliable Communications. John Wiley & Sons, New York, NY, (1968)
20. S. Fujishige: Polymatroidal dependence structure of a set of random variables. Information and Control 39, pp. 55–72, (1978)