Secret Sharing Schemes with Three or Four Minimal Qualified Subsets
- 1 January 2005
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 34 (1), 17-34
- https://doi.org/10.1007/s10623-003-4192-1
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Secret sharing schemes with bipartite access structureIEEE Transactions on Information Theory, 2000
- Tight Bounds on the Information Rate of Secret Sharing SchemesDesigns, Codes and Cryptography, 1997
- Graph decompositions and secret sharing schemesJournal of Cryptology, 1995
- Geometric secret sharing schemes and their dualsDesigns, Codes and Cryptography, 1994
- On the size of shares for secret sharing schemesJournal of Cryptology, 1993
- On the Information Rate of Secret Sharing SchemesLecture Notes in Computer Science, 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 the classification of ideal secret sharing schemesJournal of Cryptology, 1991
- How to share a secretCommunications of the ACM, 1979