Skip to main content
Log in

A secret sharing scheme based on (t, n) threshold and adversary structure

  • Regular Contribution
  • Published:
International Journal of Information Security Aims and scope Submit manuscript

Abstract

The existing secret sharing schemes cannot be applied directly if the threshold and the adversary structures are both needed to meet. A secret sharing scheme which can meet the requirements of both the (t, n) threshold and the adversary structure is proposed basing on the existing (t, n) threshold schemes and the knowledge of set theory, and the validity of the proposed scheme is proved perfectly. The scheme does not need to traverse the whole set of participants to get the qualified or unqualified subsets, and can distribute the shadows according to the requirements of threshold and adversary structure directly. The scheme can prevent the participants from cheating, and does not need the participants to provide their real shadows when the shared secret is reconstructed. The shadows do not need to be renewed when the shared secret is changed. The comparisons to the existing schemes show that, the proposed scheme is more efficient when the threshold and the adversary structure are both required.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Shamir A.: How to share a secret. Commun. ACM 11, 612–613 (1979)

    Article  MathSciNet  Google Scholar 

  2. Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of AFIPS National Computer Conference, pp. 313–317. New York (1979)

  3. Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proceedings of IEEE Global Telecommunication Conference, pp. 99–102. IEEE Press, New Jersey (1987)

  4. Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Proceedings of Crypto’88, Lecture Notes in Computer Science, pp. 213–222. Springer-Verlag, Berlin (1989)

  5. Chang, C.C., Lee H.C.: A new generalized group-oriented cryptoscheme without trusted centers. IEEE J. Select. Areas Commun. 5, 725–729 (1993)

    Article  Google Scholar 

  6. Hwang R.J., Chang C.C.: An on-line secret sharing scheme for multi-secrets. Comput. Commun. 13, 1170–1176 (1998)

    Article  Google Scholar 

  7. Tan K.J., Zhu H.W.: General secret sharing scheme. Comput. Commun. 8, 755–757 (1999)

    Article  Google Scholar 

  8. Wang S.J.: Direct construction of a secret in generalized group-oriented cryptography. Comput. Stand. Interf. 5, 455–460 (2004)

    Article  Google Scholar 

  9. Pang L.J., Jiang Z.T., Wang Y.M.: A multi-secret sharing scheme based on the general access structure. J. Comput. Res. Dev. 1, 33–38 (2006)

    Article  Google Scholar 

  10. Guo Y.B., Ma J.F.: Practical secret sharing scheme realizing generalized adversary structure. J. Comput. Sci. Technol. 4, 564–569 (2004)

    Article  MathSciNet  Google Scholar 

  11. Sun, H.M., Shieh, S.P.: Secret sharing in graph-based prohibited structures. In: Proceedings of IEEE INFOCOM’97, pp. 718–724. IEEE Press, Japan (1997)

  12. Sun H.M., Shieh S.P.: An efficient construction of perfect secret sharing for graph-based structures. J. Comput. Math. Appl. 7, 129–135 (1996)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Huawang Qin.

Additional information

The research is supported by the Natural Science Foundation of China (No. 60374066).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qin, H., Dai, Y. & Wang, Z. A secret sharing scheme based on (t, n) threshold and adversary structure. Int. J. Inf. Secur. 8, 379–385 (2009). https://doi.org/10.1007/s10207-009-0085-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10207-009-0085-2

Keywords

Navigation