Secret sharing schemes with bipartite access structure

IEEE Transactions on Information Theory

Volumn 46, Issue 7, 2000, Pages 2596-2604

  Padrö, Carles ^a   Sâez, German ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; CRYPTOGRAPHY; DATA PRIVACY; PROBABILITY DISTRIBUTIONS; SET THEORY; VECTORS;

BIPARTITE ACCESS STRUCTURE; IDEAL SCHEMES; INFORMATION RATE; SECRET SHARING SCHEMES; VECTOR SPACE CONSTRUCTION;

SECURITY OF DATA;

EID: 0034315039     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.887867     Document Type: Article

References (19)

1. A. Beutelspacher and F. Wettl, On 2-level secret sharing, Des., Codes Cryptogr.. vol. 3, pp. 127-134, 1993.
2. G. R. Blakley, Safeguarding cryptographic keys, AFIPS Conf. Proc., vol. 48, 1979, pp. 313-317.
3. C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, Tight bounds on the information rate of secret sharing schemes, Des., Codes Cryptogr., vol. 11, pp. 107-122, 1997.
4. On the information rate of secret sharing schemes, Advances in CryptologyCRYPTO'92 (LectureNotes in Computer Science). New York: Springer-Verlag, vol. 740, pp. 148-167.
5. C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph decompositions and secret sharing schemes, J. Cryptol., vol. 8, pp. 39-64, 1995.
6. E. F. Brickell, Some ideal secret sharing schemes, J. Combin. Math. Combin. Comput., vol. 9, pp. 105-113, 1989.
7. E. F. Brickell and D. M. Davenport, On the classification of ideal secret sharing schemes,"/ Cryptol., vol. 4, pp. 123-134, 1991.
8. E. F. Brickell and D. R. Stinson, Some improved bounds on the information rate of perfect secret sharing schemes, J. Cryptol., vol. 5, pp. 153-166, 1992.
9. R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the size of shares of secret sharing schemes, J. Cryptol., vol. 6, pp. 157-168, 1993.
10. M. Ito, A. Saito, and T. Nishizeki, Secret sharing scheme realizing any access structure, Proc. IEEE GLOBECOM'87, 1987, pp. 99-102.
11. E. D. Karnin, J. W. Greene, and M. E. Hellman, On secret sharing systems, IEEE Trans. Inform. Theory, vol. IT-29, pp. 351, Jan. 1983.
12. S. Lang, Linear Algebra. New York: Springer-Verlag, 1989.
13. P. Morillo, C. Padro, G. Sâez, and J. L. Villar, Weighted threshold secret sharing schemes, Inform. Processing Lett., vol. 70, pp. 211-216, 1999.
14. A. Shamir, How to share a secret, Commun. ACM, vol. 22, pp. 612-613, 1979.
15. G. J. Simmons, An introduction to shared secret and/or shared control schemes and their application, Contemporary Cryptology. The Science of Information Integrity. New York: IEEE Press, 1991, pp. 441-497.
16. D. R. Stinson, An explication of secret sharing schemes, Des., Codes Cryptogr, vol. 2, pp. 357-390, 1992.
17. Decomposition constructions for secret-sharing schemes, IEEE Trans. Inform. Theory, vol. 40, pp. 118-125, Jan. 1994.
18. Cryptography: Theory and Practice. Boca Raton, FL: CRC, 1995.
19. D. Welsh, Codes and Cryptography. Oxford, U.K.: Oxford Univ. Press, 1988.