Skip to main content
SpringerLink
Log in

A generalized Chinese remainder theorem-based proactive multi-secret sharing scheme for global wide area network

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

A generalized Chinese Remainder Theorem (GCRT)-based multi-secret sharing (MSS) scheme, which can solve a tricky problem that the correspondences between multi-secret and their remainders in each share are unclear, has been proposed recently. But potential security issues should be taken into accounts in the design and implementation of MSS. To protect long-lived multi-secret against intended attacks, in this paper, we propose a proactive multi-secret sharing (PMSS) scheme. It consists of share generation, share refreshing, and secret recovery phases. Compared with those existing MSS schemes, unordered shares in the proposed PMSS scheme are refreshed at a fixed period while the multi-secret remains intact. This can lead to a higher security level because an adversary must capture at least t shares from total n shares during a period to crack the secrets. Both the share generation and refreshing phases can be easily realized by using modular operation. What is more, the proposed PMSS scheme has a much less computational load thanks to the use of a lightweight GCRT-based algorithm in the secret recovery phase. Finally, some examples are provided to illustrate the efficiency, and some analyses regarding security are also given.

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. Fernandes, G, Jr., Rodrigues, J. J. P. C., et al. (2019). A comprehensive survey on networks anomaly detection. Telecommunication Systems, 70, 447–489.

    Article  Google Scholar 

  2. Shamir, A. (1979). How to share a secret. Communication ACM, 22(11), 612–613.

    Article  Google Scholar 

  3. Blakley, G. R. (1979). Safeguarding cryptographic keys. Proceedings of the National Computer Conference, 48, 313–317.

  4. McEliece, R. J., & Sarwate, D. V. (1981). On sharing secrets and Reed-Solomon codes. Communication ACM, 24(9), 583–584.

    Article  Google Scholar 

  5. Mignotte, M. (1982). How to share a secret. Workshop on Cryptography, 371–375.

  6. Asmuth, C., & Bloom, J. (1983). A modular approach to key safegurding. IEEE Transactions on Information Theory, 29(2), 208–210.

    Article  Google Scholar 

  7. Liu, Y., Harn, L., & Chang, C.-C. (2015). A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets. International Journal of Communication Systems, 28(7), 1282–1292.

    Article  Google Scholar 

  8. Gong, X., Hu, P., Shum, K. W., & Sung, C. W. (2018). A Zigzag-decodable ramp secret sharing scheme. IEEE Transactions on Information Forensics and Security, 13(8), 1906–1916.

    Article  Google Scholar 

  9. Chang, C.-C., & Li, C.-T. (2019). Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems. Mathematical Bioscience Engineering, 16, 3367–3381.

    Article  Google Scholar 

  10. Blundo, C., Santis, A. D., & Vaccaro, U. (1993). Efficient sharing of many secrets, annual symposium on theoretical aspects of computer. Science, 665, 692–703.

    Google Scholar 

  11. Harn, L. (1995). Efficient sharing (broadcasting) of multiple secrets. IEE Proceedings Computers and Digital Technique, 142(3), 237–240.

    Article  Google Scholar 

  12. He, J., & Dawson, E. (1994). Multistage secret sharing based on the one-wany function. Electronics Letter, 30(19), 1591–1592.

    Article  Google Scholar 

  13. Harn, L. (1995). Comment: Multistage secret sharing based on the one-wany function. Electronics Letter, 31(4), 262–262.

    Article  Google Scholar 

  14. Pilaram, H., & Eghlidos, T. (2017). An efficient lattice based multi-stage secret sharing scheme. IEEE Transactions on Dependable and Secure Computing, 14(1), 2–8.

    Google Scholar 

  15. Chien, H. Y., Jan, J.-K., & Tseng, Y.-M. (2000). A practical \((t, n)\) multi-secret sharing scheme. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 83(12), 2762–2765.

    Google Scholar 

  16. 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  Google Scholar 

  17. Zhao, J., Zhang, J., & Zhao, R. (2007). A practical verifiable multi-secret sharing scheme. Computer Standards and Interfaces, 29(1), 138–141.

    Article  Google Scholar 

  18. Das, A., & Adhikari, A. (2010). An efficient multi-use multi-secret sharing scheme based on hash function. Applied Mathematics Letters, 23(9), 993–996.

    Article  Google Scholar 

  19. Tentu, A. N., Venkaiah, V. C., & Prasad, V. K. (2018). CRT based multi-secret sharing schemes: Revisited. International Journal of Security and Networks, 13(1), 1–9.

    Article  Google Scholar 

  20. Ostrovsky, R., & Yung, M. (1991). How to withstand mobile virus attacks, Proceedings of the Tenth Annual ACM Symposium on Principles of. Distributed Computing, 91, 51–59.

  21. Herzberg, A., Jarecki, S., Krawczyk, H., & Yung, M. (1995). Proactive secret sharing or: How to cope with perpetual leakage. Annual International Cryptology Conference, 339–352.

  22. Zhou, L., Schneider, F. B., & Renesse, R. V. (2005). APSS: Proactive secret sharing in asynchronous systems. ACM Transactions on Information and System Security, 8(3), 259–286.

    Article  Google Scholar 

  23. Schultz, D., & Liskov, B. (2010). MPSS: Mobile proactive secret sharing. ACM Transaction Information System Security, 13(4), 34–65.

    Article  Google Scholar 

  24. Meng, K. J., Meng, K., Ning, Y., Huang, W., Xiong, Y., & Chang, C.-C. (2021). A proactive secret sharing scheme based on Chinese remainder theorem. Frontiers of Computer Science, 15(2), 1–10.

    Article  Google Scholar 

  25. Feng, B., Guo, C., Li, M., & Wang, Z. H. (2015). A novel proactive multi-secret sharing scheme. IJ Network Security, 17(2), 123–128.

    Google Scholar 

  26. Wang, W., Li, X. P., Xia, X.-G., & Wang, W. J. (2015). The largest dynamic range of a generalized Chinese remainder theorem for two integers. IEEE Signal Processing Letter, 22(2), 254–258.

    Article  Google Scholar 

  27. Li, X. P., Chen, H., Liu, Y., & Chang, C.-C. (2020). Unordered multi-secret sharing based on generalized Chinese remainder theorem. Security and Communication Networks, 2020, 6073721.

Download references

Acknowledgements

This work was supported in part by the National Natural Science Foundation of China (No. 61701086), the Fundamental Research Funds for the Central Universities (No. ZYGX2016KYQD143), and the Project of Ministry of Science and Technology of Taiwan under Grant MOST 106-2221-E-035-013-MY3.

Author information

Authors and Affiliations

  1. School of Mathematical Science, University of Electronic Science and Technology of China, Chengdu, 611731, China

    Xiaoping Li

  2. Department of Computer Science, University of Warwick, Coventry, CV4 7AL, UK

    Ching-Chun Chang

  3. Department of Information Engineering and Computer Science, Feng Chia University, Taichung, 407, Taiwan

    Yanjun Liu

Authors
  1. Xiaoping Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ching-Chun Chang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yanjun Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ching-Chun Chang.

Ethics declarations

Conflict of interest

The authors declare no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, X., Chang, CC. & Liu, Y. A generalized Chinese remainder theorem-based proactive multi-secret sharing scheme for global wide area network. Telecommun Syst 78, 49–56 (2021). https://doi.org/10.1007/s11235-021-00791-0

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-021-00791-0

Keywords

Search

Navigation