Graph decompositions and secret sharing schemes
- 1 December 1995
- journal article
- Published by Springer Nature in Journal of Cryptology
- Vol. 8 (1) , 39-64
- https://doi.org/10.1007/bf00204801
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Fully Dynamic Secret Sharing SchemesPublished by Springer Nature ,1994
- Size of Shares and Probability of Cheating in Threshold SchemesPublished by Springer Nature ,1994
- On the size of shares for secret sharing schemesJournal of Cryptology, 1993
- Efficient sharing of many secretsPublished by Springer Nature ,1993
- Some improved bounds on the information rate of perfect secret sharing schemesJournal of Cryptology, 1992
- The Detection of Cheaters in Thershold SchemesSIAM Journal on Discrete Mathematics, 1991
- A Protocol to Set Up Shared Secret Schemes Without the Assistance of a Mutually Trusted PartyPublished 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
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987