{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T11:22:12Z","timestamp":1777375332587,"version":"3.51.4"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T00:00:00Z","timestamp":1725062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T00:00:00Z","timestamp":1725062400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Major Program of Guangdong Basic and Applied Research Project","award":["2019B030302008"],"award-info":[{"award-number":["2019B030302008"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61825203"],"award-info":[{"award-number":["61825203"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22B2028"],"award-info":[{"award-number":["U22B2028"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key Research and Development Plan of China","award":["2020YFB1005600"],"award-info":[{"award-number":["2020YFB1005600"]}]},{"name":"Guangdong Provincial Science and Technology Project","award":["2021A0505030033"],"award-info":[{"award-number":["2021A0505030033"]}]},{"name":"Science and Technology Major Project of Tibetan Autonomous Region of China","award":["XZ202201ZD0006G"],"award-info":[{"award-number":["XZ202201ZD0006G"]}]},{"name":"National Joint Engineering Research Center of Network Security Detection and Protection Technology"},{"name":"Guangdong Key Laboratory of Data Security and Privacy Preserving"},{"name":"Guangdong Hong Kong Joint Laboratory for Data Security and Privacy Protection"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s10623-024-01467-x","type":"journal-article","created":{"date-parts":[[2024,8,31]],"date-time":"2024-08-31T16:02:56Z","timestamp":1725120176000},"page":"4099-4129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Time-based attribute-based proxy re-encryption with decryption key update"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2134-1241","authenticated-orcid":false,"given":"Feixiang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenli","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lin","family":"Hou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,31]]},"reference":[{"key":"1467_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal S., Boneh D., Boyen X.: Efficient lattice (h) IBE in the standard model. In: Advances in Cryptology\u2013EUROCRYPT 2010: 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30\u2013June 3, 2010. Proceedings 29, pp. 553\u2013572. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"1467_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M.: Generating hard instances of the short basis problem. In: Wiedermann J., Boas, P.E., Nielsen M. (eds.) Automata, Languages and Programming, 26th International Colloquium, ICALP\u201999, Prague, Czech Republic, July 11\u201315, 1999, Proceedings. Lecture Notes in Computer Science, vol. 1644, pp. 1\u20139. Springer, Berlin (1999).","DOI":"10.1007\/3-540-48523-6_1"},{"key":"1467_CR3","doi-asserted-by":"crossref","unstructured":"Alwen J., Coretti S., Dodis Y., Tselekounis Y.: Security analysis and improvements for the IETF MLS standard for group messaging. In: Annual International Cryptology Conference, pp. 248\u2013277. Springer, Berlin (2020).","DOI":"10.1007\/978-3-030-56784-2_9"},{"key":"1467_CR4","doi-asserted-by":"crossref","unstructured":"Blaze M., Bleumer G., Strauss M.: Divertible protocols and atomic proxy cryptography. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 127\u2013144. Springer, Berlin (1998).","DOI":"10.1007\/BFb0054122"},{"key":"1467_CR5","doi-asserted-by":"crossref","unstructured":"Boneh D., Gentry C., Gorbunov S., Halevi S., Nikolaenko V., Segev G., Vaikuntanathan V., Vinayagamurthy D.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Advances in Cryptology\u2013EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11\u201315, 2014. Proceedings 33, pp. 533\u2013556. Springer, Berlin (2014).","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"1467_CR6","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Gentry C., Vaikuntanathan V.: (Leveled) Fully homomorphic encryption without bootstrapping. In: Goldwasser S. (ed.) Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA, January 8\u201310, 2012, pp. 309\u2013325. ACM (2012). https:\/\/doi.org\/10.1145\/2090236.2090262.","DOI":"10.1145\/2090236.2090262"},{"key":"1467_CR7","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-011-9105-2","volume":"25","author":"D Cash","year":"2012","unstructured":"Cash D., Hofheinz D., Kiltz E., Peikert C.: Bonsai trees, or how to delegate a lattice basis. J. Cryptol. 25, 601\u2013639 (2012).","journal-title":"J. Cryptol."},{"key":"1467_CR8","doi-asserted-by":"crossref","unstructured":"Cohen A.: What about bob? The inadequacy of CPA security for proxy reencryption. In: IACR International Workshop on Public Key Cryptography, pp. 287\u2013316. Springer, Berlin (2019).","DOI":"10.1007\/978-3-030-17259-6_10"},{"key":"1467_CR9","doi-asserted-by":"crossref","unstructured":"Dodis Y., Karthikeyan H., Wichs D.: Updatable public key encryption in the standard model. In: Theory of Cryptography: 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8\u201311, 2021, Proceedings, Part III 19, pp. 254\u2013285. Springer, Berlin (2021).","DOI":"10.1007\/978-3-030-90456-2_9"},{"issue":"7","key":"1467_CR10","doi-asserted-by":"publisher","first-page":"970","DOI":"10.1093\/comjnl\/bxv100","volume":"59","author":"C Ge","year":"2016","unstructured":"Ge C., Susilo W., Wang J., Huang Z., Fang L., Ren Y.: A key-policy attribute-based proxy re-encryption without random oracles. Comput. J. 59(7), 970\u2013982 (2016).","journal-title":"Comput. J."},{"issue":"5","key":"1467_CR11","doi-asserted-by":"publisher","first-page":"2907","DOI":"10.1109\/TDSC.2021.3076580","volume":"19","author":"C Ge","year":"2021","unstructured":"Ge C., Susilo W., Baek J., Liu Z., Xia J., Fang L.: A verifiable and fair attribute-based proxy re-encryption scheme for data sharing in clouds. IEEE Trans. Dependable Secur. Comput. 19(5), 2907\u20132919 (2021).","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"1467_CR12","doi-asserted-by":"publisher","unstructured":"Gentry C., Peikert C., Vaikuntanathan V.: Trapdoors for hard lattices and new cryptographic constructions. In: Dwork C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17\u201320, 2008, pp. 197\u2013206. ACM (2008). https:\/\/doi.org\/10.1145\/1374376.1374407.","DOI":"10.1145\/1374376.1374407"},{"issue":"3","key":"1467_CR13","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1504\/IJACT.2017.086229","volume":"3","author":"Y Ishida","year":"2017","unstructured":"Ishida Y., Shikata J., Watanabe Y.: CCA-secure revocable identity-based encryption schemes with decryption key exposure resistance. Int. J. Appl. Cryptogr. 3(3), 288\u2013311 (2017).","journal-title":"Int. J. Appl. Cryptogr."},{"key":"1467_CR14","doi-asserted-by":"crossref","unstructured":"Jost D., Maurer U., Mularczyk M.: Efficient ratcheting: almost-optimal guarantees for secure messaging. In: Advances in Cryptology\u2013EUROCRYPT 2019: 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19\u201323, 2019, Proceedings, Part I 38, pp. 159\u2013188. Springer, Berlin (2019).","DOI":"10.1007\/978-3-030-17653-2_6"},{"key":"1467_CR15","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.tcs.2019.12.003","volume":"809","author":"S Katsumata","year":"2020","unstructured":"Katsumata S., Matsuda T., Takayasu A.: Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance. Theor. Comput. Sci. 809, 103\u2013136 (2020).","journal-title":"Theor. Comput. Sci."},{"key":"1467_CR16","doi-asserted-by":"crossref","unstructured":"Liang X., Cao Z., Lin H., Shao J.: Attribute based proxy re-encryption with delegating capabilities. In: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, pp. 276\u2013286 (2009).","DOI":"10.1145\/1533057.1533094"},{"key":"1467_CR17","doi-asserted-by":"crossref","unstructured":"Liang K., Fang L., Susilo W., Wong D.S.: A ciphertext-policy attribute-based proxy re-encryption with chosen-ciphertext security. In: 2013 5th International Conference on Intelligent Networking and Collaborative Systems, pp. 552\u2013559 (2013). IEEE","DOI":"10.1109\/INCoS.2013.103"},{"issue":"2","key":"1467_CR18","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.aim.2004.08.004","volume":"195","author":"AE Litvak","year":"2005","unstructured":"Litvak A.E., Pajor A., Rudelson M., Tomczak-Jaegermann N.: Smallest singular value of random matrices and geometry of random polytopes. Adv. Math. 195(2), 491\u2013523 (2005).","journal-title":"Adv. Math."},{"key":"1467_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ins.2012.09.034","volume":"258","author":"Q Liu","year":"2014","unstructured":"Liu Q., Wang G., Wu J.: Time-based proxy re-encryption scheme for secure data sharing in a cloud environment. Inf. Sci. 258, 355\u2013370 (2014).","journal-title":"Inf. Sci."},{"issue":"18","key":"1467_CR20","doi-asserted-by":"publisher","first-page":"3511","DOI":"10.1002\/sec.1274","volume":"8","author":"X Mao","year":"2015","unstructured":"Mao X., Lai J., Chen K., Weng J., Mei Q.: Efficient revocable identity-based encryption from multilinear maps. Secur. Commun. Netw. 8(18), 3511\u20133522 (2015).","journal-title":"Secur. Commun. Netw."},{"key":"1467_CR21","doi-asserted-by":"crossref","unstructured":"Micciancio D., Peikert C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 700\u2013718. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"1467_CR22","doi-asserted-by":"publisher","unstructured":"Micciancio D., Regev O.: Worst-case to average-case reductions based on gaussian measures. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17\u201319 October 2004, Rome, Italy, Proceedings, pp. 372\u2013381. IEEE Computer Society (2004). https:\/\/doi.org\/10.1109\/FOCS.2004.72.","DOI":"10.1109\/FOCS.2004.72"},{"key":"1467_CR23","unstructured":"Park S., Lee D.H., Lee K.: Revocable hierarchical identity-based encryption from multilinear maps. CoRR abs\/1610.07948 (2016)."},{"key":"1467_CR24","doi-asserted-by":"publisher","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow H.N., Fagin R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22\u201324, 2005, pp. 84\u201393. ACM (2005). https:\/\/doi.org\/10.1145\/1060590.1060603.","DOI":"10.1145\/1060590.1060603"},{"key":"1467_CR25","doi-asserted-by":"crossref","unstructured":"Seo J.H., Emura K.: Revocable identity-based encryption revisited: security model and construction. In: Public-Key Cryptography\u2013PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26\u2013March 1, 2013. Proceedings 16, pp. 216\u2013234. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36362-7_14"},{"key":"1467_CR26","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2006","unstructured":"Shoup V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2006)."},{"key":"1467_CR27","doi-asserted-by":"crossref","unstructured":"Susilo W., Dutta P., Duong D.H., Roy P.S.: Lattice-based HRA-secure attribute-based proxy re-encryption in standard model. In: Computer Security\u2013ESORICS 2021: 26th European Symposium on Research in Computer Security, Darmstadt, Germany, October 4\u20138, 2021, Proceedings, Part II 26, pp. 169\u2013191. Springer, Berlin (2021).","DOI":"10.1007\/978-3-030-88428-4_9"},{"issue":"5","key":"1467_CR28","doi-asserted-by":"publisher","first-page":"822","DOI":"10.3390\/e25050822","volume":"25","author":"Y Tang","year":"2023","unstructured":"Tang Y., Jin M., Meng H., Yang L., Zheng C.: Attribute-based verifiable conditional proxy re-encryption scheme. Entropy 25(5), 822 (2023).","journal-title":"Entropy"},{"key":"1467_CR29","doi-asserted-by":"crossref","unstructured":"Watanabe Y., Emura K., Seo J.H.: New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters. IACR Cryptol. 1094 (2016).","DOI":"10.1007\/978-3-319-52153-4_25"},{"key":"1467_CR30","doi-asserted-by":"crossref","unstructured":"Weng J., Deng R.H., Ding X., Chu C.-K., Lai J.: Conditional proxy re-encryption secure against chosen-ciphertext attack. In: Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, pp. 322\u2013332 (2009).","DOI":"10.1145\/1533057.1533100"},{"key":"1467_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119900","volume":"655","author":"F Zhao","year":"2024","unstructured":"Zhao F., Weng J., Xie W., Li M., Weng J.: HRA-secure attribute-based threshold proxy re-encryption from lattices. Inf. Sci. 655, 119900 (2024).","journal-title":"Inf. Sci."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01467-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01467-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01467-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T21:24:13Z","timestamp":1732310653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01467-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,31]]},"references-count":31,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["1467"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01467-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,31]]},"assertion":[{"value":"11 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}