Abstract
This paper demonstrates that Shamir’s scheme (“How to share a secret”, Communications of the ACM, vol. 22, no. 11, November 1979, 612–613) is not secure against cheating. A small modification to his scheme retains the security and efficiency of the original, is secure against cheating, and preserves the property that its security does not depend on any unproven assumptions such as the intractability of computing number-theoretic functions.
Cite
CITATION STYLE
Tompa, M., & Woll, H. (1987). How to share a secret with cheaters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 263 LNCS, pp. 261–265). Springer Verlag. https://doi.org/10.1007/3-540-47721-7_20
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
