Advertisement

Journal of Cryptology

, Volume 1, Issue 3, pp 133–138 | Cite as

How to share a secret with cheaters

  • Martin Tompa
  • Heather Woll
Article

Abstract

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.

Key words

Secret sharing Cheating Security Interpolation Reconstruction 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. M. Adleman and M.-D. A. Huang, Recognizing primes in random polynomial time,Proc. 19th Annual ACM Symp. Theory Comput., pp. 462–469, May 1987.Google Scholar
  2. [2]
    A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.Google Scholar
  3. [3]
    J. C. Benaloh, Secret sharing homomorphisms: keeping shares of a secret secret,Advances in Cryptology—CRYPTO '86, pp. 251–260, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin, 1987.Google Scholar
  4. [4]
    B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, Verifiable secret sharing and achieving simultaneity in the presence of faults,Proc. 26th Symp. Found. Comp. Sci., pp. 383–395, October 1985.Google Scholar
  5. [5]
    P. Feldman, A practical scheme for noninteractive verifiable secret sharing,Proc. 28th Symp. Found. Comp. Sci., pp. 427–437, October 1987.Google Scholar
  6. [6]
    O. Goldreich, S. Micali, and A. Wigderson, How to prove all NP statements in zero-knowledge and a methodology of cryptographic protocol design,Advances in Cryptology—CRYPTO '86, pp. 171–185, Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin, 1987.Google Scholar
  7. [7]
    S. Goldwasser, S. Micali, and R. L. Rivest, A “paradoxical” solution to the signature problem,Proc. 25th Symp. Found. Comp. Sci., pp. 441–448, October 1984.Google Scholar
  8. [8]
    J.D. Lipson,Elements of Algebra and Algebraic Computing, Addison-Wesley, Reading, MA, 1981.Google Scholar
  9. [9]
    M. O. Rabin, Randomized Byzantine generals,Proc. 24th Symp. Found. Comp. Sci., pp. 403–409, November 1983.Google Scholar
  10. [10]
    A. Shamir, How to share a secret,Comm. ACM,22(11): 612–613, November 1979.Google Scholar

Copyright information

© International Association for Cryptologic Research 1988

Authors and Affiliations

  • Martin Tompa
    • 1
  • Heather Woll
    • 2
  1. 1.IBM Thomas J. Watson Research CenterYorktown HeightsU.S.A.
  2. 2.Department of Computer Science, FR35University of WashingtonSeattleU.S.A.

Personalised recommendations