Skip to main content
SpringerLink
Log in

Verifiable Threshold Scheme in Multi-Secret Sharing Distributions upon Extensions of ECC

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

In this paper, we propose a verifiable multi-secret sharing scheme. Some secrets are protected by distributing them among many participants, whereby only an authorized group of participants can reconstruct the secrets. In our scheme, the secret will change periodically and the dealer will periodically publish some of the information to increase the robustness of system, in addition, the participants can verify the information which they have received. Each participant holds only one permanent, private secret, and some of them use it during different time periods to reconstruct the corresponding shared secrets without revealing their own private information. Because some public information is renewed in our scheme, the old information has nothing to do with the next secret. We also compare our scheme to the same technique-based studies in the fields promoting the benefits we achieve in this paper.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  MATH  MathSciNet  Google Scholar 

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

  3. Jackson, W. A., Martin, K. M., & O’keefe, C. M. (1994). On sharing many secrets. Asiacrypt’94 (pp. 42–54).

  4. He J., Dawson E. (1995) Multistages secret sharing based on one-way function. Electronics Letters 31(2): 1591–1592

    Article  Google Scholar 

  5. Yang C. C., Chang T. Y., Hwang M. S. (2004) A (t, n) multi-secret sharing scheme. Applied Mathematics and Computation 151(2): 483–490

    Article  MATH  MathSciNet  Google Scholar 

  6. Chang, T. Y., Hwang, M. S., & Yang, W. P. (2005). A new multi-stage secret sharing scheme using one-way function. Association for computing Machinery, SIGOPS Operating Systems Review. (Vol. 39, pp. 48–55). New York.

  7. Geng, Y. J., Fan, X. H., & Hong, F. (2007). A new multi-secret sharing scheme with multi-policy. In International Conference on Advanced Communication Technology (pp. 1515–1517).

  8. Koblitz N. (1984) Introduction to elliptic curves and modular forms. Springer, Berlin

    MATH  Google Scholar 

  9. Chen, W., Long, X., Bai, Y. B., & Gao, X. P. (2007). A new dynamic threshold secret sharing scheme from bilinear maps. In International Conference on Parallel Processing Workshops (p. 19).

  10. Shi, R. H., Zhong, H., & Huang, L. S. (2007). A (t, n)-threshold verified multi-secret sharing scheme based on ECDLP. In Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (pp. 9–13).

Download references

Author information

Authors and Affiliations

  1. Department of Information Management, Central Police University, TaoYuan, 33304, Taiwan

    Shiuh-Jeng Wang

  2. Institute of Communications Engineering, National Tsing Hua University, Hsinchu, 30013, Taiwan

    Yuh-Ren Tsai & Chien-Chih Shen

Authors
  1. Shiuh-Jeng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuh-Ren Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chien-Chih Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shiuh-Jeng Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, SJ., Tsai, YR. & Shen, CC. Verifiable Threshold Scheme in Multi-Secret Sharing Distributions upon Extensions of ECC. Wireless Pers Commun 56, 173–182 (2011). https://doi.org/10.1007/s11277-009-9875-0

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-009-9875-0

Keywords

Search

Navigation