{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T08:47:53Z","timestamp":1768639673151,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T00:00:00Z","timestamp":1621036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T00:00:00Z","timestamp":1621036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 61701086"],"award-info":[{"award-number":["No. 61701086"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["No. ZYGX2016KYQD143"],"award-info":[{"award-number":["No. ZYGX2016KYQD143"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Ministry of Science and Technology of Taiwan","award":["MOST 106-2221-E-035-013-MY3"],"award-info":[{"award-number":["MOST 106-2221-E-035-013-MY3"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s11235-021-00791-0","type":"journal-article","created":{"date-parts":[[2021,5,15]],"date-time":"2021-05-15T04:02:39Z","timestamp":1621051359000},"page":"49-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A generalized Chinese remainder theorem-based proactive multi-secret sharing scheme for global wide area network"],"prefix":"10.1007","volume":"78","author":[{"given":"Xiaoping","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7539-1451","authenticated-orcid":false,"given":"Ching-Chun","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Yanjun","family":"Liu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,5,15]]},"reference":[{"key":"791_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s11235-018-0475-8","volume":"70","author":"G Fernandes Jr","year":"2019","unstructured":"Fernandes, G, Jr., Rodrigues, J. J. P. C., et al. (2019). A comprehensive survey on networks anomaly detection. Telecommunication Systems, 70, 447\u2013489.","journal-title":"Telecommunication Systems"},{"issue":"11","key":"791_CR2","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A. (1979). How to share a secret. Communication ACM, 22(11), 612\u2013613.","journal-title":"Communication ACM"},{"key":"791_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G. R. (1979). Safeguarding cryptographic keys. Proceedings of the National Computer Conference, 48, 313\u2013317.","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"9","key":"791_CR4","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R. J., & Sarwate, D. V. (1981). On sharing secrets and Reed-Solomon codes. Communication ACM, 24(9), 583\u2013584.","journal-title":"Communication ACM"},{"key":"791_CR5","doi-asserted-by":"crossref","unstructured":"Mignotte, M. (1982). How to share a secret. Workshop on Cryptography, 371\u2013375.","DOI":"10.1007\/3-540-39466-4_27"},{"issue":"2","key":"791_CR6","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C Asmuth","year":"1983","unstructured":"Asmuth, C., & Bloom, J. (1983). A modular approach to key safegurding. IEEE Transactions on Information Theory, 29(2), 208\u2013210.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"791_CR7","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1002\/dac.2760","volume":"28","author":"Y Liu","year":"2015","unstructured":"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\u20131292.","journal-title":"International Journal of Communication Systems"},{"issue":"8","key":"791_CR8","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1109\/TIFS.2018.2806922","volume":"13","author":"X Gong","year":"2018","unstructured":"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\u20131916.","journal-title":"IEEE Transactions on Information Forensics and Security"},{"key":"791_CR9","doi-asserted-by":"publisher","first-page":"3367","DOI":"10.3934\/mbe.2019168","volume":"16","author":"C-C Chang","year":"2019","unstructured":"Chang, C.-C., & Li, C.-T. (2019). Algebraic secret sharing using privacy homomorphisms for IoT-based healthcare systems. Mathematical Bioscience Engineering, 16, 3367\u20133381.","journal-title":"Mathematical Bioscience Engineering"},{"key":"791_CR10","first-page":"692","volume":"665","author":"C Blundo","year":"1993","unstructured":"Blundo, C., Santis, A. D., & Vaccaro, U. (1993). Efficient sharing of many secrets, annual symposium on theoretical aspects of computer. Science, 665, 692\u2013703.","journal-title":"Science"},{"issue":"3","key":"791_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1049\/ip-cdt:19951874","volume":"142","author":"L Harn","year":"1995","unstructured":"Harn, L. (1995). Efficient sharing (broadcasting) of multiple secrets. IEE Proceedings Computers and Digital Technique, 142(3), 237\u2013240.","journal-title":"IEE Proceedings Computers and Digital Technique"},{"issue":"19","key":"791_CR12","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1049\/el:19941076","volume":"30","author":"J He","year":"1994","unstructured":"He, J., & Dawson, E. (1994). Multistage secret sharing based on the one-wany function. Electronics Letter, 30(19), 1591\u20131592.","journal-title":"Electronics Letter"},{"issue":"4","key":"791_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1049\/el:19950201","volume":"31","author":"L Harn","year":"1995","unstructured":"Harn, L. (1995). Comment: Multistage secret sharing based on the one-wany function. Electronics Letter, 31(4), 262\u2013262.","journal-title":"Electronics Letter"},{"issue":"1","key":"791_CR14","first-page":"2","volume":"14","author":"H Pilaram","year":"2017","unstructured":"Pilaram, H., & Eghlidos, T. (2017). An efficient lattice based multi-stage secret sharing scheme. IEEE Transactions on Dependable and Secure Computing, 14(1), 2\u20138.","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"12","key":"791_CR15","first-page":"2762","volume":"83","author":"HY Chien","year":"2000","unstructured":"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\u20132765.","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"issue":"2","key":"791_CR16","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/S0096-3003(03)00355-2","volume":"151","author":"C-C Yang","year":"2004","unstructured":"Yang, C.-C., Chang, T.-Y., & Hwang, M.-S. (2004). A $$(t, n)$$ multi-secret sharing scheme. Applied Mathematics and Computation, 151(2), 483\u2013490.","journal-title":"Applied Mathematics and Computation"},{"issue":"1","key":"791_CR17","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.csi.2006.02.004","volume":"29","author":"J Zhao","year":"2007","unstructured":"Zhao, J., Zhang, J., & Zhao, R. (2007). A practical verifiable multi-secret sharing scheme. Computer Standards and Interfaces, 29(1), 138\u2013141.","journal-title":"Computer Standards and Interfaces"},{"issue":"9","key":"791_CR18","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1016\/j.aml.2010.04.024","volume":"23","author":"A Das","year":"2010","unstructured":"Das, A., & Adhikari, A. (2010). An efficient multi-use multi-secret sharing scheme based on hash function. Applied Mathematics Letters, 23(9), 993\u2013996.","journal-title":"Applied Mathematics Letters"},{"issue":"1","key":"791_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1504\/IJSN.2018.090637","volume":"13","author":"AN Tentu","year":"2018","unstructured":"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\u20139.","journal-title":"International Journal of Security and Networks"},{"key":"791_CR20","doi-asserted-by":"crossref","unstructured":"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\u201359.","DOI":"10.1145\/112600.112605"},{"key":"791_CR21","doi-asserted-by":"crossref","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., & Yung, M. (1995). Proactive secret sharing or: How to cope with perpetual leakage. Annual International Cryptology Conference, 339\u2013352.","DOI":"10.1007\/3-540-44750-4_27"},{"issue":"3","key":"791_CR22","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1145\/1085126.1085127","volume":"8","author":"L Zhou","year":"2005","unstructured":"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\u2013286.","journal-title":"ACM Transactions on Information and System Security"},{"issue":"4","key":"791_CR23","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1880022.1880028","volume":"13","author":"D Schultz","year":"2010","unstructured":"Schultz, D., & Liskov, B. (2010). MPSS: Mobile proactive secret sharing. ACM Transaction Information System Security, 13(4), 34\u201365.","journal-title":"ACM Transaction Information System Security"},{"issue":"2","key":"791_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-019-9123-z","volume":"15","author":"KJ Meng","year":"2021","unstructured":"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\u201310.","journal-title":"Frontiers of Computer Science"},{"issue":"2","key":"791_CR25","first-page":"123","volume":"17","author":"B Feng","year":"2015","unstructured":"Feng, B., Guo, C., Li, M., & Wang, Z. H. (2015). A novel proactive multi-secret sharing scheme. IJ Network Security, 17(2), 123\u2013128.","journal-title":"IJ Network Security"},{"issue":"2","key":"791_CR26","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1109\/LSP.2014.2322200","volume":"22","author":"W Wang","year":"2015","unstructured":"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\u2013258.","journal-title":"IEEE Signal Processing Letter"},{"key":"791_CR27","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1155\/2020\/6073721"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-021-00791-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11235-021-00791-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-021-00791-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,7]],"date-time":"2021-08-07T01:18:48Z","timestamp":1628299128000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11235-021-00791-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,15]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["791"],"URL":"https:\/\/doi.org\/10.1007\/s11235-021-00791-0","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,15]]},"assertion":[{"value":"12 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}