{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T15:14:05Z","timestamp":1784301245666,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":33,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551248","type":"print"},{"value":"9789819551255","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-5125-5_1","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:42:11Z","timestamp":1765107731000},"page":"3-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Construction of\u00a0Evolving k-Threshold Secret Sharing Scheme over\u00a0A Polynomial Ring"],"prefix":"10.1007","author":[{"given":"Qi","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hongru","family":"Cao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sian-Jheng","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nenghai","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yunghsiang S.","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xianhong","family":"Xie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"issue":"11","key":"1_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. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: 1979 International Workshop on Managing Requirements Knowledge (MARK), p. 313 (1979). https:\/\/doi.org\/10.1109\/MARK.1979.8817296","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"5","key":"1_CR3","doi-asserted-by":"publisher","first-page":"4441","DOI":"10.1109\/TDSC.2022.3209011","volume":"20","author":"Z Yang","year":"2023","unstructured":"Yang, Z., He, D., Qu, L., Xu, J.: On the security of a lattice-based multi-stage secret sharing scheme. IEEE Trans. Dependable Secure Comput. 20(5), 4441\u20134442 (2023). https:\/\/doi.org\/10.1109\/TDSC.2022.3209011","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"2882","DOI":"10.1109\/TDSC.2022.3194321","volume":"20","author":"X Chen","year":"2023","unstructured":"Chen, X., Zhang, L., Liu, J.: Verifiable homomorphic secret sharing for low degree polynomials. IEEE Trans. Dependable Secure Comput. 20(4), 2882\u20132895 (2023). https:\/\/doi.org\/10.1109\/TDSC.2022.3194321","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"5725","DOI":"10.1109\/TIFS.2024.3403489","volume":"19","author":"L Huo","year":"2024","unstructured":"Huo, L., Wu, L., Zhang, Z., Li, C., He, D., Wang, J.: Libras: a fair, secure, verifiable and scalable outsourcing computation scheme based on blockchain. IEEE Trans. Inf. Forensics Secur. 19, 5725\u20135737 (2024). https:\/\/doi.org\/10.1109\/TIFS.2024.3403489","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"5","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1924","DOI":"10.1109\/TSC.2024.3390396","volume":"17","author":"Y Xie","year":"2024","unstructured":"Xie, Y., Li, R., Huang, Y., Zhang, C., Wei, L., Sun, Y.: A monitoring-free bitcoin payment channel scheme with support for real-time settlement. IEEE Trans. Serv. Comput. 17(5), 1924\u20131937 (2024). https:\/\/doi.org\/10.1109\/TSC.2024.3390396","journal-title":"IEEE Trans. Serv. Comput."},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-662-53644-5_19","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2016","unstructured":"Komargodski, I., Naor, M., Yogev, E.: How to share a secret, infinitely. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 485\u2013514. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_19"},{"issue":"6","key":"1_CR8","doi-asserted-by":"publisher","first-page":"4179","DOI":"10.1109\/TIT.2017.2779121","volume":"64","author":"I Komargodski","year":"2017","unstructured":"Komargodski, I., Naor, M., Yogev, E.: How to share a secret, infinitely. IEEE Trans. Inf. Theory 64(6), 4179\u20134190 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2779121","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-01689-0_13","volume-title":"Cyberspace Safety and Security","author":"P D\u2019Arco","year":"2018","unstructured":"D\u2019Arco, P., De Prisco, R., De Santis, A.: On the equivalence of 2-threshold secret sharing schemes and prefix codes. In: Castiglione, A., Pop, F., Ficco, M., Palmieri, F. (eds.) CSS 2018. LNCS, vol. 11161, pp. 157\u2013167. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01689-0_13"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2021.01.019","volume":"859","author":"P D\u2019Arco","year":"2021","unstructured":"D\u2019Arco, P., De Prisco, R., De Santis, A.: Secret sharing schemes for infinite sets of participants: a new design technique. Theoret. Comput. Sci. 859, 149\u2013161 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.01.019","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/TIT.1975.1055349","volume":"21","author":"P Elias","year":"1975","unstructured":"Elias, P.: Universal codeword sets and representations of the integers. IEEE Trans. Inf. Theory 21(2), 194\u2013203 (1975). https:\/\/doi.org\/10.1109\/TIT.1975.1055349","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1_CR12","doi-asserted-by":"publisher","first-page":"3718","DOI":"10.1109\/TIT.2024.3379278","volume":"70","author":"C Xing","year":"2024","unstructured":"Xing, C., Yuan, C.: Evolving secret sharing schemes based on polynomial evaluations and algebraic geometry codes. IEEE Trans. Inf. Theory 70(5), 3718\u20133728 (2024). https:\/\/doi.org\/10.1109\/TIT.2024.3379278","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"29","author":"E Karnin","year":"1983","unstructured":"Karnin, E., Greene, J., Hellman, M.: On secret sharing systems. IEEE Trans. Inf. Theory 29(1), 35\u201341 (1983). https:\/\/doi.org\/10.1109\/TIT.1983.1056621","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-53644-5_18","volume-title":"Theory of Cryptography","author":"A Bogdanov","year":"2016","unstructured":"Bogdanov, A., Guo, S., Komargodski, I.: Threshold secret sharing requires a linear size alphabet. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 471\u2013484. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_18"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/3-540-45708-9_18","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002","author":"R Cramer","year":"2002","unstructured":"Cramer, R., Fehr, S.: Optimal black-box secret sharing over arbitrary abelian groups. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 272\u2013287. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45708-9_18"},{"issue":"5","key":"1_CR16","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1109\/LSP.2019.2907010","volume":"26","author":"H Cao","year":"2019","unstructured":"Cao, H., Lin, S., Zhang, W., Han, Y.: On the security of secret sharing over a ring and the fast implementation. IEEE Signal Process. Lett. 26(5), 705\u2013709 (2019). https:\/\/doi.org\/10.1109\/LSP.2019.2907010","journal-title":"IEEE Signal Process. Lett."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-39466-4_27","volume-title":"Cryptography","author":"M Mignotte","year":"1983","unstructured":"Mignotte, M.: How to share a secret. In: Beth, T. (ed.) EUROCRYPT 1982. LNCS, vol. 149, pp. 371\u2013375. Springer, Heidelberg (1983). https:\/\/doi.org\/10.1007\/3-540-39466-4_27"},{"issue":"2","key":"1_CR18","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 Trans. Inf. Theory 29(2), 208\u2013210 (1983). https:\/\/doi.org\/10.1109\/TIT.1983.1056651","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"1_CR19","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.: A novel verifiable secret sharing mechanism using theory of numbers and a method for sharing secrets. Int. J. Commun. Syst. 28(7), 1282\u20131292 (2015). https:\/\/doi.org\/10.1002\/dac.2760","journal-title":"Int. J. Commun. Syst."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.ins.2016.06.006","volume":"367","author":"L Harn","year":"2016","unstructured":"Harn, L., Hsu, C., Zhang, M., He, T., Zhang, M.: Realizing secret sharing with general access structure. Inf. Sci. 367, 209\u2013220 (2016). https:\/\/doi.org\/10.1016\/j.ins.2016.06.006","journal-title":"Inf. Sci."},{"key":"1_CR21","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 \u2013 ASIACRYPT 2018","author":"Yu Ning","year":"2018","unstructured":"Ning, Yu., Miao, F., Huang, W., Meng, K., Xiong, Y., Wang, X.: Constructing ideal secret sharing schemes based on Chinese remainder theorem. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 310\u2013331. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_12"},{"key":"1_CR22","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 101\u2013111 (1998). https:\/\/doi.org\/10.1145\/277697.277716","DOI":"10.1145\/277697.277716"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"R Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_22"},{"issue":"7","key":"1_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-018-9705-x","volume":"62","author":"Yu Wang","year":"2019","unstructured":"Wang, Yu., Tian, C., Su, Q., Wang, M., Su, X.: Measurement-device-independent quantum secret sharing and quantum conference based on Gaussian cluster state. SCIENCE CHINA Inf. Sci. 62(7), 1\u201314 (2019). https:\/\/doi.org\/10.1007\/s11432-018-9705-x","journal-title":"SCIENCE CHINA Inf. Sci."},{"key":"1_CR25","doi-asserted-by":"publisher","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: 26th Annual Symposium on Foundations of Computer Science, pp. 27\u201335 (1985). https:\/\/doi.org\/10.1109\/SFCS.1985.64","DOI":"10.1109\/SFCS.1985.64"},{"key":"1_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-48329-2_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"H Krawczyk","year":"1994","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 136\u2013146. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_12"},{"issue":"1","key":"1_CR27","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TIT.2021.3123692","volume":"68","author":"J Ding","year":"2021","unstructured":"Ding, J., Lin, C., Wang, H., Xing, C.: Communication efficient secret sharing with small share size. IEEE Trans. Inf. Theory 68(1), 659\u2013669 (2021). https:\/\/doi.org\/10.1109\/TIT.2021.3123692","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1_CR28","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10623-011-9540-y","volume":"63","author":"L Csirmaz","year":"2012","unstructured":"Csirmaz, L., Tardos, G.: On-line secret sharing. Des. Codes Crypt. 63(6), 127\u2013147 (2012). https:\/\/doi.org\/10.1007\/s10623-011-9540-y","journal-title":"Des. Codes Crypt."},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-319-70503-3_12","volume-title":"Theory of Cryptography","author":"I Komargodski","year":"2017","unstructured":"Komargodski, I., Paskin-Cherniavsky, A.: Evolving secret sharing: dynamic thresholds and robustness. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10678, pp. 379\u2013393. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_12"},{"key":"1_CR30","unstructured":"Okamura, R., Koga, H.: New constructions of an evolving 2-threshold scheme based on binary or D-ary prefix codes. In: 2020 International Symposium on Information Theory and Its Applications, pp. 432\u2013436 (2020)"},{"issue":"5","key":"1_CR31","doi-asserted-by":"publisher","first-page":"2906","DOI":"10.1109\/TCOMM.2023.3253720","volume":"71","author":"W Yan","year":"2023","unstructured":"Yan, W., Lin, S., Han, Y.: A new metric and the construction for evolving 2-threshold secret sharing schemes based on prefix coding of integers. IEEE Trans. Commun. 71(5), 2906\u20132915 (2023). https:\/\/doi.org\/10.1109\/TCOMM.2023.3253720","journal-title":"IEEE Trans. Commun."},{"key":"1_CR32","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3493802","author":"P D\u2019Arco","year":"2024","unstructured":"D\u2019Arco, P., Prisco, R.D., Santis, A.D.: Constructions and lower bounds for evolving 2-threshold secret sharing schemes. IEEE Trans. Commun. (2024). https:\/\/doi.org\/10.1109\/TCOMM.2024.3493802","journal-title":"IEEE Trans. Commun."},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Alon, B., Beimel, A., Ben David, T.B., Omri, E., Paskin-Cherniavsky, A.: New upper bounds for evolving secret sharing via infinite branching programs. In: Boyle, E., Mahmoody, M. (eds.) Theory of Cryptography. TCC 2024, LNCS, vol. 15367, pp. 548\u2013580. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_18","DOI":"10.1007\/978-3-031-78023-3_18"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5125-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:42:12Z","timestamp":1765107732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5125-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551248","9789819551255"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5125-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}