This paper demonstrates that Shamir's scheme [10] is not secure against certain forms of cheating. A small modification to his scheme retains the security and efficiency of the original, is secure against these forms of cheating, and preserves the property that its security does not depend on any unproven assumptions such as the intractability of computing number-theoretic functions. © 1988 International Association for Cryptologic Research.
CITATION STYLE
Tompa, M., & Woll, H. (1989). How to share a secret with cheaters. Journal of Cryptology, 1(3), 133–138. https://doi.org/10.1007/BF02252871
Mendeley helps you to discover research relevant for your work.