Advertisement

A Secure and Efficient Secret Sharing Scheme with General Access Structures

  • Liao-Jun Pang
  • Hui-Xian Li
  • Yu-Min Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4223)

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.

Keywords

Secret Sharing Access Structure Secret Sharing Scheme Secret Information Threshold Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Blakley, G.: Safeguarding cryptographic keys. In: Proc. AFIPS 1979 Natl. Conf., New York, pp. 313–317 (1979)Google Scholar
  3. 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. 4.
    Ren-Junn, H., Chin-Chen, C.: An on-line secret sharing scheme for multi-secrets. Computer Communications 21(13), 1170–1176 (1998)CrossRefGoogle Scholar
  5. 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)MATHCrossRefMathSciNetGoogle Scholar
  6. 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)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Rosen, K.H.: Elementary Number Theory and Its Applications. Addison-Wesley, Reading (1993)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Liao-Jun Pang
    • 1
  • Hui-Xian Li
    • 2
  • Yu-Min Wang
    • 1
  1. 1.The Ministry of Edu. Key Lab. of Computer, Networks and Information SecurityXidian Univ.Xi’anChina
  2. 2.Department of Computer Science and EngineeringDalian Univ. of TechnologyDalianChina

Personalised recommendations