Decomposition constructions for secret-sharing schemes
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 40 (1) , 118-125
- https://doi.org/10.1109/18.272461
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- Some Ideal Secret Sharing SchemesPublished by Springer Nature ,2001
- New General Lower Bounds on the Information Rate of Secret Sharing SchemesPublished by Springer Nature ,2001
- Graph Decompositions and Secret Sharing SchemesPublished by Springer Nature ,1993
- On the Information Rate of Secret Sharing SchemesPublished by Springer Nature ,1993
- An explication of secret sharing schemesDesigns, Codes and Cryptography, 1992
- Some improved bounds on the information rate of perfect secret sharing schemesJournal of Cryptology, 1992
- On secret-sharing matroidsJournal of Combinatorial Theory, Series B, 1992
- On the classification of ideal secret sharing schemesJournal of Cryptology, 1991
- Secret sharing scheme realizing general access structureElectronics and Communications in Japan (Part III: Fundamental Electronic Science), 1989
- How to share a secretCommunications of the ACM, 1979