{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T20:23:53Z","timestamp":1775161433172,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:00:00Z","timestamp":1634601600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T00:00:00Z","timestamp":1634601600000},"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":[[2022,2]]},"DOI":"10.1007\/s11704-021-0483-9","type":"journal-article","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T08:30:41Z","timestamp":1634632241000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A simple construction of CRT-based ideal secret sharing scheme and its security extension based on common factor"],"prefix":"10.1007","volume":"16","author":[{"given":"Lei","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuyou","family":"Miao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keju","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"issue":"11","key":"483_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":"483_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":"483_CR3","doi-asserted-by":"publisher","first-page":"955","DOI":"10.1007\/s11704-013-3051-0","volume":"7","author":"X Zhang","year":"2013","unstructured":"Zhang X, Xu C, Zhang W, Li W. Threshold public key encryption scheme resilient against continual leakage without random oracles. Frontiers of Computer Science, 2013, 7(6): 955\u2013968","journal-title":"Frontiers of Computer Science"},{"issue":"3","key":"483_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11704-018-8106-9","volume":"14","author":"Y Zhang","year":"2020","unstructured":"Zhang Y, He D, Zhang M, Choo K K. A provable-secure and practical two-party distributed signing protocol for SM2 signature algorithm. Frontiers of Computer Science, 2020, 14(3): 1\u20134","journal-title":"Frontiers of Computer Science"},{"key":"483_CR5","doi-asserted-by":"crossref","unstructured":"Roy P. A homomorphism based zero knowledge proof of authentication for chinese remainder theorem based secret sharing. In: Proceedings of Annual Convention of the Computer Society of India. 2018, 562\u2013572","DOI":"10.1007\/978-981-13-1343-1_47"},{"key":"483_CR6","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":"483_CR7","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":"483_CR8","first-page":"933","volume":"2018","author":"F L Tiplea","year":"2018","unstructured":"Tiplea F L, Dragan C C. Asymptotically ideal CRT-based secret sharing schemes for multilevel and compartmented access structures. IACR Cryptology ePrint Archive, 2018, 2018: 933","journal-title":"IACR Cryptology ePrint Archive"},{"key":"483_CR9","doi-asserted-by":"crossref","unstructured":"Shyu S J, Chen Y R. Threshold secret image sharing by Chinese remainder theorem. In: Proceedings of IEEE Asia-Pacific Services Computing Conference. 2008, 1332\u20131337","DOI":"10.1109\/APSCC.2008.223"},{"key":"483_CR10","doi-asserted-by":"crossref","unstructured":"Yan X, Lu Y, Liu L, Wan S, Ding W, Liu H. Chinese remainder theorem-based secret image sharing for (k, n) threshold. In: Proceedings of International Conference on Cloud Computing and Security. 2017, 433\u2013440","DOI":"10.1007\/978-3-319-68542-7_36"},{"key":"483_CR11","doi-asserted-by":"crossref","unstructured":"Meng K, Miao F, Yu Y, Lu C. A universal secret sharing scheme with general access structure based on CRT. In: Proceedings of the 17th IEEE International Conference on Trust, Security And Privacy In Computing And Communications\/12th IEEE International Conference on Big Data Science And Engineering. 2018, 142\u2013148","DOI":"10.1109\/TrustCom\/BigDataSE.2018.00031"},{"key":"483_CR12","doi-asserted-by":"crossref","unstructured":"Brickell E F. Some ideal secret sharing schemes. In: Proceedings of Workshop on the Theory and Application of Cryptographic Techniques. 1989, 468\u2013475","DOI":"10.1007\/3-540-46885-4_45"},{"key":"483_CR13","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":"483_CR14","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.compeleceng.2016.02.017","volume":"52","author":"K Mahmood","year":"2016","unstructured":"Mahmood K, Chaudhry S A, Naqvi H, Shon T, Ahmad H F. A lightweight message authentication scheme for Smart Grid communications in power sector. Computers & Electrical Engineering, 2016, 52: 114\u2013124","journal-title":"Computers & Electrical Engineering"},{"key":"483_CR15","unstructured":"Gopal V, Brandt J W. Keyed-hash message authentication code processors, methods, systems, and instructions. U.S. Patent 10, 313, 129. 2019-6-4"},{"key":"483_CR16","unstructured":"Alomair B S. Residue message authentication code. U.S. Patent 10, 243, 744. 2019-3-26"},{"issue":"6","key":"483_CR17","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie W, Hellman M. New directions in cryptography. IEEE transactions on Information Theory, 1976, 22(6): 644\u2013654","journal-title":"IEEE transactions on Information Theory"},{"key":"483_CR18","doi-asserted-by":"crossref","unstructured":"Barker E, Chen L, Keller S, Roginsky A, Vassilev A, Pavis R. Recommendation for pair-wise key-establishment schemes using discrete logarithm cryptography. National Institute of Standards and Technology, 2017","DOI":"10.6028\/NIST.SP.800-56Ar3"},{"key":"483_CR19","first-page":"210","volume":"65","author":"P Li","year":"2018","unstructured":"Li P, Liu Z, Yang C N. A construction method of (t, k, n)-essential secret image sharing scheme. Signal Processing: Image Communication, 2018, 65: 210\u2013220","journal-title":"Signal Processing: Image Communication"},{"key":"483_CR20","doi-asserted-by":"publisher","first-page":"2387358","DOI":"10.1155\/2019\/2387358","volume":"2019","author":"H Chen","year":"2019","unstructured":"Chen H, Chang C C. A novel secret sharing scheme based upon euler\u2019s theorem. Security and Communication Networks, 2019, 2019: 2387358","journal-title":"Security and Communication Networks"},{"issue":"5","key":"483_CR21","first-page":"711","volume":"60","author":"A Kawachi","year":"2017","unstructured":"Kawachi A, Okamoto Y, Tanaka K, Yasunaga K. General constructions of rational secret sharing with expected constant-round reconstruction. The Computer Journal, 2017, 60(5): 711\u2013728","journal-title":"The Computer Journal"},{"issue":"1","key":"483_CR22","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. A practical verifiable multi-secret sharing scheme. Computer Standards & Interfaces, 2007, 29(1): 138\u2013141","journal-title":"Computer Standards & Interfaces"},{"issue":"2","key":"483_CR23","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1007\/s11277-016-3862-z","volume":"95","author":"L Harn","year":"2017","unstructured":"Harn L, Hsu C F. (t, n) multi-secret sharing scheme based on bivariate polynomial. Wireless Personal Communications, 2017, 95(2): 1495\u20131504","journal-title":"Wireless Personal Communications"},{"key":"483_CR24","unstructured":"Hedayat A S, Sloane N J A, Stufken J. Orthogonal Arrays: Theory and Applications. Springer Science & Business Media, 2012"},{"issue":"2","key":"483_CR25","first-page":"471","volume":"6","author":"J Pieprzyk","year":"2004","unstructured":"Pieprzyk J, Zhang X M. Characterisations of ideal threshold schemes. Discrete Mathematics and Theoretical Computer Science, 2004, 6(2): 471\u2013482","journal-title":"Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-021-0483-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-021-0483-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-021-0483-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,22]],"date-time":"2023-03-22T22:13:45Z","timestamp":1679523225000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-021-0483-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,19]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["483"],"URL":"https:\/\/doi.org\/10.1007\/s11704-021-0483-9","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,10,19]]},"assertion":[{"value":"27 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"161811"}}