Robust vector space secret sharing schemes
- 1 November 1998
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 68 (3) , 107-111
- https://doi.org/10.1016/s0020-0190(98)00149-5
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Lower bounds for robust secret sharing schemesInformation Processing Letters, 1997
- Tight Bounds on the Information Rate of Secret Sharing SchemesDesigns, Codes and Cryptography, 1997
- Graph decompositions and secret sharing schemesJournal of Cryptology, 1995
- A perfect threshold secret sharing scheme to identify cheatersDesigns, Codes and Cryptography, 1995
- Decomposition constructions for secret-sharing schemesIEEE Transactions on Information Theory, 1994
- How to avoid the cheaters succeeding in the key sharing schemeDesigns, Codes and Cryptography, 1993
- An explication of secret sharing schemesDesigns, Codes and Cryptography, 1992
- The Detection of Cheaters in Thershold SchemesSIAM Journal on Discrete Mathematics, 1991
- How to share a secret with cheatersJournal of Cryptology, 1989
- How to share a secretCommunications of the ACM, 1979