Lower bounds for robust secret sharing schemes
- 29 September 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 63 (6) , 317-321
- https://doi.org/10.1016/s0020-0190(97)00135-x
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On a Fallacious Bound for Authentication CodesJournal of Cryptology, 1999
- Decomposition constructions for secret-sharing schemesIEEE Transactions on Information Theory, 1994
- An explication of secret sharing schemesDesigns, Codes and Cryptography, 1992
- New bounds and constructions for authentication/secrecy codes with splittingJournal of Cryptology, 1991
- How to share a secret with cheatersJournal of Cryptology, 1989
- How to share a secretCommunications of the ACM, 1979