Skip to main content
SpringerLink
Log in
Book cover

International Conference on the Theory and Application of Cryptology

ASIACRYPT 1991: Advances in Cryptology — ASIACRYPT '91 pp 149–158Cite as

A generalized secret sharing scheme with cheater detection

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 739))

Abstract

A new secret sharing scheme is presented in this paper to realize the generalized secret sharing policy. Different from most of previous works, it is computationally secure and each participant holds only one single shadow. Any honest participant in this scheme can detect and identify who is cheating even when all of the other participants corrupt together. An extended algorithm is also proposed to protect the secret form dishonest participant without the assumption of simultaneous release of the shadows. With (x,x)-homomorphism property, it can also be used to protect individual secrets while revealing the product of these secrets.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. Akl, G.S. and P.D. Taylor, “Cryptographic Solution to A Multilevel Security Problem”, Proc. Crypto '82, Plenum Press, 237–250.

    Google Scholar 

  2. Benaloh, J., “Secret Sharing Homomorphisms: Keeping Shares of a secret secret”, Proc. Crypto '86, Springer-Verlag, 251–260.

    Google Scholar 

  3. Benaloh, J. and J. Leichter, “Generalized Secret Sharing and Monotone Functions”, Proc. Crypto '88, 27–35.

    Google Scholar 

  4. Blackly, G., “Safeguarding Cryptographic Keys”, Proc. NCC, Vol. 48, AFIP Press, 1979, 313–317.

    Google Scholar 

  5. Brickle, E.f., and D.R. Stinson, “The Detection of Cheaters in Threshold Schemes”, Proc. Crypto '88, Springer-Verlag, 564–577.

    Google Scholar 

  6. Chor, B., S. Goldwasser, S. Micali,, and B. Awerbuch, “Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults”, Proc. 26th IEEE Symp. on Fooundations of Computer Science, 1985, 383–395.

    Google Scholar 

  7. Ito, M., A. Saito, and T. Nishizeki, “Secret Sharing Scheme Realizing General Access Structure”, Proc. Glob. Com(1987).

    Google Scholar 

  8. Lubell, D., J. Comb. Th.1(1966), 299.

    Google Scholar 

  9. Shamir, A. “How to Share a Secret”, Comm. of the ACM 22, 11, Nov. 1979, 612–613.

    Article  Google Scholar 

  10. Tompa, M., and H. Woll, “How to share a secret with cheaters”, J. of Cryptology 1(1988), 133–138.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Telecommunications Program, University of Missouri-Kansas City, 64110, Kansas City, MO

    Hung-Yu Lin & Lein Harn

Authors
  1. Hung-Yu Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lein Harn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, HY., Harn, L. (1993). A generalized secret sharing scheme with cheater detection. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57332-6

  • Online ISBN: 978-3-540-48066-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation