Secret sharing schemes on access structures with intersection number equal to one
- 1 March 2006
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 154 (3), 552-563
- https://doi.org/10.1016/j.dam.2005.09.003
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Secret Sharing Schemes with Three or Four Minimal Qualified SubsetsDesigns, Codes and Cryptography, 2005
- 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
- Perfect secret sharing schemes on five participantsDesigns, Codes and Cryptography, 1996
- 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
- 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