{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:56:53Z","timestamp":1776117413545,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T00:00:00Z","timestamp":1663027200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T00:00:00Z","timestamp":1663027200000},"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":["J Syst Sci Complex"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11424-022-1292-4","type":"journal-article","created":{"date-parts":[[2022,9,13]],"date-time":"2022-09-13T10:22:41Z","timestamp":1663064561000},"page":"129-150","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Ramp Scheme Based on CRT for Polynomial Ring over Finite Field"],"prefix":"10.1007","volume":"36","author":[{"given":"Jian","family":"Ding","sequence":"first","affiliation":[]},{"given":"Pinhui","family":"Ke","sequence":"additional","affiliation":[]},{"given":"Changlu","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Huaxiong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,13]]},"reference":[{"key":"1292_CR1","first-page":"313","volume":"48","author":"G R Blakley","year":"1979","unstructured":"Blakley G R, Safeguarding cryptographic keys, Proceedings of the National Computer Conference\u2019 1979, AFIPS Proceedings, 1979, 48: 313\u2013317.","journal-title":"AFIPS Proceedings"},{"issue":"11","key":"1292_CR2","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"},{"issue":"2","key":"1292_CR3","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1109\/TIT.1983.1056651","volume":"29","author":"C Asmuth","year":"1983","unstructured":"Asmuth C and Bloom J, A modular approach to key safeguarding, IEEE Trans. Inf. Theory, 1983, 29(2): 208\u2013210.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1292_CR4","first-page":"420","volume":"16","author":"L Harn","year":"2014","unstructured":"Harn L and Miao F, Weighted secret sharing based on the Chinese Remainder Theorem, Int. Netw. Secur., 2014, 16(6): 420\u2013425.","journal-title":"Int. Netw. Secur."},{"issue":"9","key":"1292_CR5","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.ipl.2014.04.006","volume":"114","author":"L Harn","year":"2014","unstructured":"Harn L and Miao F, Multilevel threshold secret sharing based on the Chinese Remainder Theorem, Inf. Process. Lett., 2014, 114(9): 504\u2013509.","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"1292_CR6","doi-asserted-by":"publisher","first-page":"1282","DOI":"10.1002\/dac.2760","volume":"28","author":"Y Liu","year":"2015","unstructured":"Liu Y, Harn L, and Chang C C, A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets, Int. J. Commun. Syst., 2015, 28(7): 1282\u20131292.","journal-title":"Int. J. Commun. Syst."},{"key":"1292_CR7","first-page":"242","volume-title":"Advances in Cryptology-CRYPTO 1984, Lecture Notes in Computer Science","author":"G R Blakley","year":"1985","unstructured":"Blakley G R and Meadows C, Security of ramp schemes, Eds. by Blakley G R, Chaum D. Advances in Cryptology-CRYPTO 1984, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 1985, 196: 242\u2013268."},{"issue":"12","key":"1292_CR8","doi-asserted-by":"publisher","first-page":"7195","DOI":"10.1109\/TIT.2016.2616144","volume":"62","author":"W Huang","year":"2016","unstructured":"Huang W, Langberg M, Kliewer J, et al., Communication efficient secret sharing, IEEE Trans. Inf. Theory, 2016, 62(12): 7195\u20137206.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1292_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-030-03332-3_12","volume-title":"Advances in Cryptology-ASIACRYPT 2018","author":"Y Ning","year":"2018","unstructured":"Ning Y, Miao F, Huang W, et al., Constructing ideal secret sharing schemes based on Chinese Remainder Theorem, Eds. by Peyrin T, Galbraith S. Advances in Cryptology-ASIACRYPT 2018, Lecture Notes in Computer Science, Springer, Cham, 2018, 11274: 310\u2013331."},{"key":"1292_CR10","first-page":"177","volume":"1587","author":"K M Martin","year":"1999","unstructured":"Martin K M, Pieprzyk J, Safavi-Naini R, et al., Changing thresholds in the absence of secure channels, Information Security and Privacy, ACISP 1999, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, 1999, 1587: 177\u2013191.","journal-title":"Information Security and Privacy, ACISP 1999, Lecture Notes in Computer Science, Springer, Berlin, Heidelberg"},{"issue":"1","key":"1292_CR11","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1109\/TIT.2007.911179","volume":"54","author":"H Wang","year":"2008","unstructured":"Wang H and Wong D S, On secret reconstruction in secret sharing schemes, IEEE Trans. Inf. Theory, 2008, 54(1): 473\u2013480.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1292_CR12","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.tcs.2011.09.027","volume":"418","author":"Z Zhang","year":"2012","unstructured":"Zhang Z, Chee Y M, Ling S, et al., Threshold changeable secret sharing schemes revisited, Theor. Compu. Sci., 2012, 418: 106\u2013115.","journal-title":"Theor. Compu. Sci."},{"issue":"6","key":"1292_CR13","doi-asserted-by":"crossref","first-page":"4191","DOI":"10.1109\/TIT.2018.2823326","volume":"64","author":"R Bitar","year":"2018","unstructured":"Bitar R and Rouayheb S E, Staircase codes for secret sharing with optimal communication and read overheads, IEEE Trans. Inf. Theory, 2018, 64(6): 4191\u20134206.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1292_CR14","series-title":"Lecture Notes in Computer Science","first-page":"308","volume-title":"Cryptology and Network Security, CANS 2019","author":"F Lin","year":"2019","unstructured":"Lin F, Ling S, Wang H, et al., Threshold changeable ramp secret sharing, Eds. by Mu Y, Deng R, Huang X. Cryptology and Network Security, CANS 2019, Lecture Notes in Computer Science, Springer, Cham, 2019, 11829: 308\u2013327."},{"issue":"4","key":"1292_CR15","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ffa.2005.04.007","volume":"12","author":"R Steinfeld","year":"2006","unstructured":"Steinfeld R, Pieprzyk J, and Wang H, Lattice-based threshold-changeability for standard crt secret-sharing schemes, Finite Fields Their Appl., 2006, 12(4): 653\u2013680.","journal-title":"Finite Fields Their Appl."},{"issue":"7","key":"1292_CR16","doi-asserted-by":"publisher","first-page":"2542","DOI":"10.1109\/TIT.2007.899541","volume":"53","author":"R Steinfeld","year":"2007","unstructured":"Steinfeld R, Pieprzyk J, and Wang H, Lattice-based threshold changeability for standard shamir secret-sharing schemes, IEEE Trans. Inf. Theory, 2007, 53(7): 2542\u20132559.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1292_CR17","doi-asserted-by":"crossref","unstructured":"Ding J, Lin C, and Lin F, Optimal threshold changeable secret sharing with new threshold change range, Eds. by Nguyen K, et al., ProvSec 2020, LNCS, 2020, 12505: 361\u2013378.","DOI":"10.1007\/978-3-030-62576-4_18"},{"issue":"9","key":"1292_CR18","doi-asserted-by":"publisher","first-page":"1893","DOI":"10.1109\/TC.2012.251","volume":"62","author":"L Harn","year":"2013","unstructured":"Harn L, Group authentication, IEEE Trans. Comput., 2013, 62(9): 1893\u20131898.","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"1292_CR19","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1002\/sec.758","volume":"7","author":"L Harn","year":"2014","unstructured":"Harn L, Secure secret reconstruction and multi-secret sharing schemes with unconditional security, Security Comm. Networks, 2014, 7(3): 567\u2013573.","journal-title":"Security Comm. Networks"},{"issue":"11","key":"1292_CR20","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.ipl.2015.06.014","volume":"115","author":"L Harn","year":"2015","unstructured":"Harn L and Hsu C F, Dynamic threshold secret reconstruction and its application to the threshold cryptography, Inf. Process. Lett., 2015, 115(11): 851\u2013857.","journal-title":"Inf. Process. Lett."},{"key":"1292_CR21","doi-asserted-by":"publisher","first-page":"105994","DOI":"10.1016\/j.ipl.2020.105994","volume":"163","author":"S Jamshidpour","year":"2020","unstructured":"Jamshidpour S and Ahmadian Z, Security analysis of a dynamic threshold secret sharing scheme using linear subspace method, Inf. Process. Lett., 2020, 163: 105994.","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1292_CR22","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1109\/TIFS.2017.2757454","volume":"13","author":"Z Ahmadian","year":"2019","unstructured":"Ahmadian Z and Jamshidpour S, Linear subspace cryptanalysis of a secret sharing-based group authentication scheme, IEEE Trans. Inf. Forensics Secur., 2019, 13(2): 502\u2013510.","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"1292_CR23","first-page":"313","volume":"47","author":"X Jia","year":"2019","unstructured":"Jia X, Wang D, Nie D, et al., A new threshold changeable secret sharing scheme based on the Chinese Remainder Theorem, Inf. Sci., 2019, 47: 313\u2013330.","journal-title":"Inf. Sci."},{"key":"1292_CR24","volume-title":"Algebra, Graduate Texts in Mathematics","author":"S Lang","year":"2002","unstructured":"Lang S, Algebra, Graduate Texts in Mathematics, 3rd Ed., Springer, New York, vol. 211, 2002.","edition":"3rd Ed."},{"key":"1292_CR25","volume-title":"A Course in Algorithmic Algebraic Number Theory","author":"H Cohen","year":"1993","unstructured":"Cohen H, A Course in Algorithmic Algebraic Number Theory, Springer, Heidelberg, vol. 138. 1993."},{"key":"1292_CR26","volume-title":"Cryptography, Theory and Practice","author":"D R Stinson","year":"2006","unstructured":"Stinson D R, Cryptography, Theory and Practice, 3rd Ed., Chapman and Hall\/CRC, Boca Raton, 2006.","edition":"3rd Ed."}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-022-1292-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11424-022-1292-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-022-1292-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T16:13:41Z","timestamp":1677687221000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11424-022-1292-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,13]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1292"],"URL":"https:\/\/doi.org\/10.1007\/s11424-022-1292-4","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,13]]},"assertion":[{"value":"12 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}