t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 410-423
- https://doi.org/10.1007/3-540-44750-4_33
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- The Detection of Cheaters in Thershold SchemesSIAM Journal on Discrete Mathematics, 1991
- New bounds and constructions for authentication/secrecy codes with splittingJournal of Cryptology, 1991
- How to share a secret with cheatersJournal of Cryptology, 1989
- Verifiable secret sharing and multiparty protocols with honest majorityPublished by Association for Computing Machinery (ACM) ,1989
- Some constructions and bounds for authentication codesJournal of Cryptology, 1988
- On secret sharing systemsIEEE Transactions on Information Theory, 1983
- On sharing secrets and Reed-Solomon codesCommunications of the ACM, 1981
- How to share a secretCommunications of the ACM, 1979