On the Information Rate of Secret Sharing Schemes
- 1 January 1993
- book chapter
- Published by Springer Nature
- p. 148-167
- https://doi.org/10.1007/3-540-48071-4_11
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Generalized Linear Threshold SchemePublished by Springer Nature ,2000
- Graph Decompositions and Secret Sharing SchemesPublished by Springer Nature ,1993
- Clique partitions, graph compression and speeding-up algorithmsPublished by Association for Computing Machinery (ACM) ,1991
- Some Improved Bounds on the Information Rate of Perfect Secret Sharing SchemesPublished by Springer Nature ,1991
- On the classification of ideal secret sharing schemesJournal of Cryptology, 1991
- Generalized Secret Sharing and Monotone FunctionsPublished by Springer Nature ,1990
- Covering of graphs by complete bipartite subgraphs; Complexity of 0–1 matricesCombinatorica, 1984
- On secret sharing systemsIEEE Transactions on Information Theory, 1983
- How to share a secretCommunications of the ACM, 1979
- Safeguarding cryptographic keysPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979