{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T05:47:40Z","timestamp":1782712060432,"version":"3.54.5"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the Open Project Program of Anhui Provincial Key Laboratory of Industrial Intelligent Data Security","award":["AHIIDS2025001"],"award-info":[{"award-number":["AHIIDS2025001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071446"],"award-info":[{"award-number":["62071446"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10623-026-01864-4","type":"journal-article","created":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T08:35:13Z","timestamp":1780475713000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A construction of evolving 3-threshold secret sharing scheme with perfect security and smaller share size"],"prefix":"10.1007","volume":"94","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":"Leilei","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sian-Jheng","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,3]]},"reference":[{"key":"1864_CR1","doi-asserted-by":"crossref","unstructured":"Alon B., Beimel A., Ben\u00a0David T., Omri E., Paskin-Cherniavsky A.: New upper bounds for evolving secret sharing via infinite branching programs. In: Theory of Cryptography Conference, pp. 548\u2013580. Springer, Berlin (2025).","DOI":"10.1007\/978-3-031-78023-3_18"},{"issue":"2","key":"1864_CR2","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).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1864_CR3","doi-asserted-by":"crossref","unstructured":"Beimel A., Othman H.: Evolving ramp secret sharing with a small gap. In: EUROCRYPT, pp. 529\u2013555. Springer, Berlin (2020).","DOI":"10.1007\/978-3-030-45721-1_19"},{"key":"1864_CR4","doi-asserted-by":"crossref","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: International Workshop Manager Requirements Knowledge, pp. 313\u2013313 (1979).","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"5","key":"1864_CR5","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.-J., Zhang W., Han Y.S.: On the security of secret sharing over a ring and the fast implementation. IEEE Signal Process. Lett. 26(5), 705\u2013709 (2019).","journal-title":"IEEE Signal Process. Lett."},{"issue":"12","key":"1864_CR6","doi-asserted-by":"publisher","first-page":"3936","DOI":"10.1007\/s10773-020-04644-5","volume":"59","author":"SS Chaudhury","year":"2020","unstructured":"Chaudhury S.S.: A quantum evolving secret sharing scheme. Int. J. Theor. Phys. 59(12), 3936\u20133950 (2020).","journal-title":"Int. J. Theor. Phys."},{"issue":"2","key":"1864_CR7","first-page":"978","volume":"19","author":"B Chen","year":"2020","unstructured":"Chen B., Lu W., Huang J., Weng J., Zhou Y.: Secret sharing based reversible data hiding in encrypted images with multiple data-hiders. IEEE Trans. Dependable Secure Comput. 19(2), 978\u2013991 (2020).","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"1864_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11432-019-2858-8","volume":"64","author":"Z Chen","year":"2021","unstructured":"Chen Z., Tian Y., Peng C.: An incentive-compatible rational secret sharing scheme using blockchain and smart contract. Sci. China Inf. Sci 64, 1\u201321 (2021).","journal-title":"Sci. China Inf. Sci"},{"key":"1864_CR9","doi-asserted-by":"crossref","unstructured":"Cheng Q., Cao H., Lin S.-J., Yu N.: A construction of evolving $$ k $$-threshold secret sharing scheme over a polynomial ring. In: ASIACRYPT 2025 (2025).","DOI":"10.1007\/978-981-95-5125-5_1"},{"key":"1864_CR10","unstructured":"Cohen E., Paskin-Cherniavsky A.: Quantum evolving secret sharing for general access structures. Cryptology ePrint Archive (2024)."},{"key":"1864_CR11","doi-asserted-by":"crossref","unstructured":"Cramer R., Fehr S.: Optimal black-box secret sharing over arbitrary abelian groups. In: CRYPTO, pp. 272\u2013287. Springer, Berlin (2002).","DOI":"10.1007\/3-540-45708-9_18"},{"key":"1864_CR12","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 Cryptogr. 63, 127\u2013147 (2012).","journal-title":"Des. Codes Cryptogr."},{"key":"1864_CR13","doi-asserted-by":"crossref","unstructured":"D\u2019Arco P., Prisco R.D., Santis A.D.: On the equivalence of 2-threshold secret sharing schemes and prefix codes. In: International Symposium on Cyberspace Safety and Security, pp. 157\u2013167. Springer, Berlin (2018).","DOI":"10.1007\/978-3-030-01689-0_13"},{"key":"1864_CR14","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. Theor. Comput. Sci. 859, 149\u2013161 (2021).","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"1864_CR15","doi-asserted-by":"publisher","first-page":"3240","DOI":"10.1109\/TCOMM.2024.3493802","volume":"73","author":"P D\u2019Arco","year":"2024","unstructured":"D\u2019Arco P., De Prisco R., De Santis A.: Constructions and lower bounds for evolving 2-threshold secret sharing schemes. IEEE Trans. Commun. 73(5), 3240\u20133253 (2024).","journal-title":"IEEE Trans. Commun."},{"key":"1864_CR16","doi-asserted-by":"crossref","unstructured":"Desmedt Y., Dutta S., Morozov K.: Evolving perfect hash families: a combinatorial viewpoint of evolving secret sharing. In: International Conference on Cryptology and Network Security, pp. 291\u2013307. Springer, Berlin (2019).","DOI":"10.1007\/978-3-030-31578-8_16"},{"key":"1864_CR17","doi-asserted-by":"crossref","unstructured":"Dutta S., Roy P.S., Fukushima K., Kiyomoto S., Sakurai K.: Secret sharing on evolving multi-level access structure. In: International Workshop on Information Security Applications, pp. 180\u2013191. Springer, Berlin (2019).","DOI":"10.1007\/978-3-030-39303-8_14"},{"issue":"2","key":"1864_CR18","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).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1864_CR19","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10623-024-01496-6","volume":"93","author":"M Gyarmati","year":"2025","unstructured":"Gyarmati M., Ligeti P., Sziklai P., Tak\u00e1ts M.: Conjunctive hierarchical secret sharing by finite geometry. Des. Codes Cryptogr. 93(2), 423\u2013428 (2025).","journal-title":"Des. Codes Cryptogr."},{"key":"1864_CR20","doi-asserted-by":"crossref","unstructured":"Komargodski I., Paskin-Cherniavsky A.: Evolving secret sharing: dynamic thresholds and robustness. In: Theory of Cryptography Conference, pp. 379\u2013393. Springer, Berlin (2017).","DOI":"10.1007\/978-3-319-70503-3_12"},{"key":"1864_CR21","doi-asserted-by":"crossref","unstructured":"Komargodski I, Naor M, Yogev E.: How to share a secret, infinitely. In: Theory of Cryptography Conference, pp. 485\u2013514. Springer, Berlin (2016).","DOI":"10.1007\/978-3-662-53644-5_19"},{"issue":"6","key":"1864_CR22","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).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1864_CR23","doi-asserted-by":"publisher","first-page":"2288","DOI":"10.1109\/TIFS.2023.3348229","volume":"19","author":"J Lai","year":"2023","unstructured":"Lai J., Susilo W., Deng R.H., Guo F.: SDSS: Sequential Data Sharing System in IoT. IEEE Trans. Inf. Forensics Secur. 19, 2288\u20132299 (2023).","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"9","key":"1864_CR24","doi-asserted-by":"publisher","first-page":"2067","DOI":"10.1007\/s10623-021-00900-9","volume":"89","author":"P Ligeti","year":"2021","unstructured":"Ligeti P., Sziklai P., Tak\u00e1ts M.: Generalized threshold secret sharing and finite geometry. Des. Codes Cryptogr. 89(9), 2067\u20132078 (2021).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1864_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3591354","volume":"26","author":"Y Lu","year":"2023","unstructured":"Lu Y., Yu Z., Suri N.: Privacy-preserving decentralized federated learning over time-varying communication graph. ACM Trans. Privacy Secur. 26(3), 1\u201339 (2023).","journal-title":"ACM Trans. Privacy Secur."},{"key":"1864_CR26","doi-asserted-by":"crossref","unstructured":"Mignotte M.: How to share a secret. In: Proceedings of the Workshop on Cryptography, pp. 371\u2013375 (1983).","DOI":"10.1007\/3-540-39466-4_27"},{"key":"1864_CR27","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: ASIACRYPT, pp. 310\u2013331. Springer, Berlin (2018).","DOI":"10.1007\/978-3-030-03332-3_12"},{"key":"1864_CR28","unstructured":"Okamura R., Koga H.: New constructions of an evolving 2-threshold scheme based on binary or D-ary prefix codes. In: International Symposium on Information Theory and Its Applications, pp. 432\u2013436. IEEE (2020)."},{"key":"1864_CR29","doi-asserted-by":"crossref","unstructured":"Phalakarn K., Suppakitpaisarn V., Attrapadung N., Matsuura K.: Evolving homomorphic secret sharing for hierarchical access structures. In: Advances in Information and Computer Security, pp. 77\u201396. Springer, Berlin (2021).","DOI":"10.1007\/978-3-030-85987-9_5"},{"key":"1864_CR30","doi-asserted-by":"crossref","unstructured":"Pramanik J., Adhikari A.: Evolving secret sharing in almost semi-honest model. In: International Conference on Security and Privacy, pp. 123\u2013131. Springer, Berlin (2021).","DOI":"10.1007\/978-3-030-90553-8_9"},{"key":"1864_CR31","doi-asserted-by":"crossref","unstructured":"Pramanik J., Adhikari A.: Evolving secret sharing with essential participants. In: Proceedings of International Conference on Frontiers in Computing and Systems, pp. 691\u2013699. Springer, Berlin (2021).","DOI":"10.1007\/978-981-15-7834-2_64"},{"issue":"11","key":"1864_CR32","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).","journal-title":"Commun. ACM"},{"issue":"5","key":"1864_CR33","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).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1864_CR34","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.-J., Han Y.S.: 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).","journal-title":"IEEE Trans. Commun."},{"issue":"6","key":"1864_CR35","doi-asserted-by":"publisher","first-page":"10325","DOI":"10.1109\/JIOT.2023.3328989","volume":"11","author":"C-N Yang","year":"2023","unstructured":"Yang C.-N., Li P., Cheng H.-H., Kuo H.-C., Lu M.-C., Xiong L.: A security model of multihospital FHIR database authorization based on secret sharing and blockchain. IEEE Internet Things J. 11(6), 10325\u201310335 (2023).","journal-title":"IEEE Internet Things J."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01864-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-026-01864-4","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-026-01864-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T05:38:27Z","timestamp":1782711507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-026-01864-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":35,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["1864"],"URL":"https:\/\/doi.org\/10.1007\/s10623-026-01864-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"7 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2026","order":4,"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"}}],"article-number":"128"}}