Skip to main content

A Secure and Efficient Secret Sharing Scheme with General Access Structures

  • Conference paper
Fuzzy Systems and Knowledge Discovery (FSKD 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4223))

Included in the following conference series:

Abstract

A new secret sharing scheme with general access structures was proposed, which is based on Shamir’s secret sharing scheme and the discrete logarithm problem. In this scheme, the dealer need not send any secret information to participants. And the shared secret, the participant set and the access structure can be changed dynamically without updating any participant’s secret shadow. The degree of the used Lagrange interpolation polynomial is only one, which makes the computational complexity of the proposed scheme very low. The proposed scheme has advantages over the existing schemes and thus provides great capabilities for many applications.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  2. Blakley, G.: Safeguarding cryptographic keys. In: Proc. AFIPS 1979 Natl. Conf., New York, pp. 313–317 (1979)

    Google Scholar 

  3. Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27–35. Springer, Heidelberg (1990)

    Google Scholar 

  4. Ren-Junn, H., Chin-Chen, C.: An on-line secret sharing scheme for multi-secrets. Computer Communications 21(13), 1170–1176 (1998)

    Article  Google Scholar 

  5. Liao-jun, P., Yu-min, W.: A new (t, n) multi-secret sharing scheme based on Shamir’s secret sharing. Applied Mathematics and Computation 167(2), 840–848 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public key crypto system. Communication of ACM 21, 120–126 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  7. Rosen, K.H.: Elementary Number Theory and Its Applications. Addison-Wesley, Reading (1993)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pang, LJ., Li, HX., Wang, YM. (2006). A Secure and Efficient Secret Sharing Scheme with General Access Structures. In: Wang, L., Jiao, L., Shi, G., Li, X., Liu, J. (eds) Fuzzy Systems and Knowledge Discovery. FSKD 2006. Lecture Notes in Computer Science(), vol 4223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11881599_77

Download citation

  • DOI: https://doi.org/10.1007/11881599_77

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45916-3

  • Online ISBN: 978-3-540-45917-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics