{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T01:37:34Z","timestamp":1776217054706,"version":"3.50.1"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T00:00:00Z","timestamp":1601596800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T00:00:00Z","timestamp":1601596800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s11704-019-9123-z","type":"journal-article","created":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T12:03:01Z","timestamp":1601640181000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A proactive secret sharing scheme based on Chinese remainder theorem"],"prefix":"10.1007","volume":"15","author":[{"given":"Keju","family":"Meng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuyou","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu","family":"Ning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenchao","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Chen","family":"Chang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,2]]},"reference":[{"issue":"11","key":"9123_CR1","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A. How to share a secret. Communications of the ACM, 1979, 22(11): 612\u2013613","journal-title":"Communications of the ACM"},{"key":"9123_CR2","doi-asserted-by":"crossref","unstructured":"Blakley G R. Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference. 1979, 313\u2013317","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"6","key":"9123_CR3","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1109\/TC.2010.40","volume":"59","author":"L Harn","year":"2010","unstructured":"Harn L, Lin C. Authenticated group key transfer protocol based on secret sharing. IEEE Transactions on Computers, 2010, 59(6): 842\u2013846","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"9123_CR4","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1007\/s11704-011-0197-5","volume":"5","author":"X Lv","year":"2011","unstructured":"Lv X, Li H, Wang B. Identity-based key distribution for mobile Ad Hoc networks. Frontiers of Computer Science, 2011, 5(4): 442\u2013447","journal-title":"Frontiers of Computer Science"},{"issue":"5","key":"9123_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1049\/ip-cdt:19941293","volume":"141","author":"L Harn","year":"1994","unstructured":"Harn L. Group-oriented (t, n) threshold digital signature scheme and digital multisignature. IEE Proceedings-Computers and Digital Techniques, 1994, 141(5): 307\u2013313","journal-title":"IEE Proceedings-Computers and Digital Techniques"},{"issue":"2","key":"9123_CR6","first-page":"259","volume":"1","author":"S Tang","year":"2004","unstructured":"Tang S. Simple secret sharing and threshold RSA signature schemes. Journal of Information and Computational Science, 2004, 1(2): 259\u2013262","journal-title":"Journal of Information and Computational Science"},{"key":"9123_CR7","unstructured":"Kamal A A A M, Iwamura K. Conditionally secure multiparty computation using secret sharing scheme for n < 2 k \u2212 1. In: Proceedings of the 15th Annual Conference on Privacy, Security and Trust. 2017, 225\u2013230"},{"issue":"1","key":"9123_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00145-013-9172-7","volume":"28","author":"A Patra","year":"2015","unstructured":"Patra A, Choudhury A, Rangan C P. Efficient asynchronous verifiable secret sharing and multiparty computation. Journal of Cryptology, 2015, 28(1): 49\u2013109","journal-title":"Journal of Cryptology"},{"issue":"5","key":"9123_CR9","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1007\/s11704-015-3255-6","volume":"9","author":"Y Song","year":"2015","unstructured":"Song Y, Li Z, Li Y, Xin R. The optimal information rate for graph access structures of nine participants. Frontiers of Computer Science, 2015, 9(5): 778\u2013787","journal-title":"Frontiers of Computer Science"},{"key":"9123_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ins.2018.09.024","volume":"473","author":"X Jia","year":"2019","unstructured":"Jia X, Wang D, Nie D, Luo X, Sun J Z. A new threshold changeable secret sharing scheme based on the Chinese Remainder Theorem. Information Sciences, 2019, 473: 13\u201330","journal-title":"Information Sciences"},{"issue":"9","key":"9123_CR11","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R J McEliece","year":"1981","unstructured":"McEliece R J, Sarwate D V. On sharing secrets and Reed-Solomon codes. Communications of the ACM, 1981, 24(9): 583\u2013584","journal-title":"Communications of the ACM"},{"key":"9123_CR12","doi-asserted-by":"crossref","unstructured":"Mignotte M. How to share a secret. In: Proceedings of Workshop on Cryptography. 1982, 371\u2013375","DOI":"10.1007\/3-540-39466-4_27"},{"issue":"2","key":"9123_CR13","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. A modular approach to key safeguarding. IEEE Transactions on Information Theory, 1983, 29(2): 208\u2013210","journal-title":"IEEE Transactions on Information Theory"},{"key":"9123_CR14","doi-asserted-by":"crossref","unstructured":"Ning Y, Miao F, Huang W, Meng K, Xiong Y, Wang X. Constructing ideal secret sharing schemes based on Chinese Remainder Theorem. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security. 2018, 310\u2013331","DOI":"10.1007\/978-3-030-03332-3_12"},{"key":"9123_CR15","doi-asserted-by":"crossref","unstructured":"Ostrovsky R, Yung M. How to withstand mobile virus attacks. In: Proceedings of the 10th ACM Conference on Principles of Distributed Systems. 1991, 51\u201359","DOI":"10.1145\/112600.112605"},{"key":"9123_CR16","doi-asserted-by":"crossref","unstructured":"Herzberg A, Jarecki S, Krawczyk H, Yung M. Proactive secret sharing or: how to cope with perpetual leakage. In: Proceedings of Annual International Cryptology Conference. 1995, 339\u2013352","DOI":"10.1007\/3-540-44750-4_27"},{"issue":"1","key":"9123_CR17","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s11277-018-6032-7","volume":"104","author":"M H Dehkordi","year":"2019","unstructured":"Dehkordi M H, Mashhadi S, Oraei H. A proactive multi stage secret sharing scheme for any given access structure. Wireless Personal Communications, 2019, 104(1): 491\u2013503","journal-title":"Wireless Personal Communications"},{"key":"9123_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.ins.2016.10.040","volume":"378","author":"S Mashhadi","year":"2017","unstructured":"Mashhadi S. Secure publicly verifiable and proactive secret sharing schemes with general access structure. Information Sciences, 2017, 378: 99\u2013108","journal-title":"Information Sciences"},{"key":"9123_CR19","first-page":"141","volume":"2002","author":"V Nikov","year":"2002","unstructured":"Nikov V, Nikova S, Preneel B, Vandewalle, J. Applying general access structure to proactive secret sharing schemes. IACR Cryptology ePrint Archive, 2002, 2002: 141","journal-title":"IACR Cryptology ePrint Archive"},{"key":"9123_CR20","doi-asserted-by":"crossref","unstructured":"Zou H, Wang J. Multi-level threshold multi-secret sharing scheme with proactive security. Journal of Computer Applications, 2009","DOI":"10.1109\/ETCS.2009.610"},{"issue":"2","key":"9123_CR21","first-page":"123","volume":"17","author":"B Feng","year":"2015","unstructured":"Feng B, Guo C, Li M, Wang Z. A novel proactive multi-secret sharing scheme. International Journal of Network Security, 2015, 17(2): 123\u2013128","journal-title":"International Journal of Network Security"},{"key":"9123_CR22","unstructured":"Cachin C, Kursawe K, Lysyanskaya A, Strobl R. Method of verifiably sharing a secret in potentially asynchronous networks. U.S. Patent 7, 389, 416. 2008-6-17"},{"issue":"3","key":"9123_CR23","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, Van Renesse R. APSS: proactive secret sharing in asynchronous systems. ACM Transactions on Information and System Security, 2005, 8(3): 259\u2013286","journal-title":"ACM Transactions on Information and System Security"},{"key":"9123_CR24","doi-asserted-by":"crossref","unstructured":"Schultz D A, Liskov B, Liskov M. MPSS: mobile proactive secret sharing. In: Proceedings of the 27th ACM Symposium on Principles of Distributed Computing. 2008, 458","DOI":"10.1145\/1400751.1400856"},{"key":"9123_CR25","doi-asserted-by":"crossref","unstructured":"Baron J, El Defrawy K, Lampkins J, Ostrovsky R. Communication-optimal proactive secret sharing for dynamic groups. In: Proceedings of International Conference on Applied Cryptography and Network Security. 2015, 23\u201341","DOI":"10.1007\/978-3-319-28166-7_2"},{"key":"9123_CR26","unstructured":"Numao M. A secure key registration system based on proactive secret-sharing scheme. In: Proceedings of the 4th International Symposium on Autonomous Decentralized Systems-Integration of Heterogeneous Systems. 1999, 230\u2013237"},{"key":"9123_CR27","doi-asserted-by":"crossref","unstructured":"Yang J P, Rhee K H, Sakurai K. A proactive secret sharing for server assisted threshold signatures. In: Proceedings of International Conference on High Performance Computing and Communications. 2006, 250\u2013259","DOI":"10.1007\/11847366_26"},{"key":"9123_CR28","volume-title":"Graduate Texts in Mathematics 111","author":"S A F W G K A Ribet","year":"1987","unstructured":"Ribet S A F W G K A. Graduate Texts in Mathematics 111. USA: Springer, 1987"},{"issue":"3","key":"9123_CR29","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R M Capocelli","year":"1993","unstructured":"Capocelli R M, De Santis A, Gargano L, Vaccaro U. On the size of shares for secret sharing schemes. Journal of Cryptology, 1993, 6(3): 157\u2013167","journal-title":"Journal of Cryptology"},{"key":"9123_CR30","doi-asserted-by":"crossref","unstructured":"Feldman P. A practical scheme for non-interactive verifiable secret sharing. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science. 1987, 427\u2013438","DOI":"10.1109\/SFCS.1987.4"},{"key":"9123_CR31","doi-asserted-by":"crossref","unstructured":"Pedersen T P. Non-interactive and information-theoretic secure verifiable secret sharing. In: Proceedings of Annual International Cryptology Conference. 1991, 129\u2013140","DOI":"10.1007\/3-540-46766-1_9"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-9123-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-019-9123-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-019-9123-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,27]],"date-time":"2023-02-27T07:23:24Z","timestamp":1677482604000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-019-9123-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,2]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9123"],"URL":"https:\/\/doi.org\/10.1007\/s11704-019-9123-z","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,2]]},"assertion":[{"value":"9 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"152801"}}