{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,18]],"date-time":"2025-03-18T04:13:25Z","timestamp":1742271205303,"version":"3.40.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T00:00:00Z","timestamp":1731974400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T00:00:00Z","timestamp":1731974400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62202305","62172266"],"award-info":[{"award-number":["62202305","62172266"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Elite Scientists Sponsorship Program by China Association for Science and Technology","award":["YESS20220150"],"award-info":[{"award-number":["YESS20220150"]}]},{"name":"Shanghai Pujiang Program","award":["22PJ1407700"],"award-info":[{"award-number":["22PJ1407700"]}]},{"name":"NSF Career Award","award":["CNS-2402031"],"award-info":[{"award-number":["CNS-2402031"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10623-024-01523-6","type":"journal-article","created":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T05:53:25Z","timestamp":1731995605000},"page":"503-551","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Almost tight security in lattices with polynomial moduli\u2014PRF, IBE, all-but-many LTF, and more"],"prefix":"10.1007","volume":"93","author":[{"given":"Zhedong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiqi","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng-Hao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,19]]},"reference":[{"key":"1523_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"EUROCRYPT 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal S., Boneh D., Boyen X.: Efficient lattice (H)IBE in the standard model. In: Gilbert H. (ed.) EUROCRYPT 2010, vol. 6110, pp. 553\u2013572. LNCS. Springer, Heidelberg (2010)."},{"key":"1523_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai M.: Generating hard instances of lattice problems (extended abstract). In: 28th ACM STOC, pp. 99\u2013108. ACM Press, New York (1996).","DOI":"10.1145\/237814.237838"},{"key":"1523_CR3","series-title":"LNCS","first-page":"297","volume-title":"CRYPTO2014, Part I","author":"J Alperin-Sheriff","year":"2014","unstructured":"Alperin-Sheriff J., Peikert C.: Faster bootstrapping with polynomial error. In: Garay J.A., Gennaro R. (eds.) CRYPTO2014, Part I, vol. 8616, pp. 297\u2013314. LNCS. Springer, Heidelberg (2014)."},{"key":"1523_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-40041-4_4","volume-title":"CRYPTO 2013, Part I","author":"J Alwen","year":"2013","unstructured":"Alwen J., Krenn S., Pietrzak K., Wichs D.: Learning with rounding, revisited\u2013new reduction, properties and applications. In: Canetti R., Garay J.A. (eds.) CRYPTO 2013, Part I, vol. 8042, pp. 57\u201374. LNCS. Springer, Heidelberg (2013)."},{"key":"1523_CR5","doi-asserted-by":"crossref","unstructured":"Attrapadung N., Hanaoka G., Yamada S.: A framework for identity-based encryption with almost tight security. In: Proceedings, Part I, of the 21st International Conference on Advances in Cryptology\u2014ASIACRYPT 2015, pp. 521\u2013549 (2015).","DOI":"10.1007\/978-3-662-48797-6_22"},{"key":"1523_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-48797-6_1","volume-title":"ASIACRYPT 2015, Part I","author":"S Bai","year":"2015","unstructured":"Bai S., Langlois A., Lepoint T., Stehl\u00e9 D., Steinfeld R.: Improved security proofs in lattice-based cryptography: using the R\u00e9nyi divergence rather than the statistical distance. In: Iwata T., Cheon J.H. (eds.) ASIACRYPT 2015, Part I, vol. 9452, pp. 3\u201324. LNCS. Springer, Heidelberg (2015)."},{"key":"1523_CR7","series-title":"LNCS","first-page":"353","volume-title":"CRYPTO2014, Part I","author":"A Banerjee","year":"2014","unstructured":"Banerjee A., Peikert C.: New and improved key-homomorphic pseudorandom functions. In: Garay J.A., Gennaro R. (eds.) CRYPTO2014, Part I, vol. 8616, pp. 353\u2013370. LNCS. Springer, Heidelberg (2014)."},{"key":"1523_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"EUROCRYPT 2012","author":"A Banerjee","year":"2012","unstructured":"Banerjee A., Peikert C., Rosen A.: Pseudorandom functions and lattices. In: Pointcheval D., Johansson T. (eds.) EUROCRYPT 2012, vol. 7237, pp. 719\u2013737. LNCS. Springer, Heidelberg (2012)."},{"key":"1523_CR9","series-title":"LNCS","first-page":"399","volume-title":"EUROCRYPT\u201996","author":"M Bellare","year":"1996","unstructured":"Bellare M., Rogaway P.: The exact security of digital signatures: how to sign with RSA and Rabin. In: Maurer U.M. (ed.) EUROCRYPT\u201996, vol. 1070, pp. 399\u2013416. LNCS. Springer, Heidelberg (1996)."},{"key":"1523_CR10","series-title":"LNCS","first-page":"408","volume-title":"CRYPTO2014, Part I","author":"O Blazy","year":"2014","unstructured":"Blazy O., Kiltz E., Pan J.: (Hierarchical) identity-based encryption from affine message authentication. In: Garay J.A., Gennaro R. (eds.) CRYPTO2014, Part I, vol. 8616, pp. 408\u2013425. LNCS. Springer, Heidelberg (2014)."},{"key":"1523_CR11","doi-asserted-by":"crossref","unstructured":"Bogdanov A., Guo S., Masny D., Richelson S., Rosen A.: On the hardness of learning with rounding over small modulus. In: Kushilevitz E., Malkin T. (eds.) TCC 2016-A. Part I. LNCS, vol. 9562, pp. 209\u2013224. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49096-9_9"},{"key":"1523_CR12","unstructured":"Bogdanov A., Rosen A.: Pseudorandom functions: three decades later. Cryptology ePrint Archive, Report 2017\/652 (2017). https:\/\/eprint.iacr.org\/2017\/652."},{"key":"1523_CR13","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh D., Franklin M.K.: Identity-based encryption from the Weil pairing. In: Kilian J. (ed.) CRYPTO 2001, vol. 2139, pp. 213\u2013229. LNCS. Springer, Heidelberg (2001)."},{"key":"1523_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"EUROCRYPT 2014","author":"D Boneh","year":"2014","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: Nguyen P.Q., Oswald E. (eds.) EUROCRYPT 2014, vol. 8441, pp. 533\u2013556. LNCS. Springer, Heidelberg (2014)."},{"key":"1523_CR15","doi-asserted-by":"crossref","unstructured":"Boneh D., Lewi K., Montgomery H.\u00a0W., Raghunathan A.: Key homomorphic PRFs and their applications. In: Canetti R., Garay J.A. (eds.) CRYPTO 2013, Part I, pp. 410\u2013428. LNCS, vol. 8042. Springer, Heidelberg (2013).","DOI":"10.1007\/978-3-642-40041-4_23"},{"key":"1523_CR16","series-title":"LNCS","first-page":"404","volume-title":"ASIACRYPT 2016, Part II","author":"X Boyen","year":"2016","unstructured":"Boyen X., Li Q.: Towards tightly secure lattice short signature and id-based encryption. In: Cheon J.H., Takagi T. (eds.) ASIACRYPT 2016, Part II, vol. 10032, pp. 404\u2013434. LNCS. Springer, Heidelberg (2016)."},{"key":"1523_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-319-63697-9_11","volume-title":"CRYPTO 2017, Part III","author":"X Boyen","year":"2017","unstructured":"Boyen X., Li Q.: All-but-many lossy trapdoor functions from lattices and applications. In: Katz J., Shacham H. (eds.) CRYPTO 2017, Part III, vol. 10403, pp. 298\u2013331. LNCS. Springer, Heidelberg (2017)."},{"key":"1523_CR18","doi-asserted-by":"crossref","unstructured":"Brakerski Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini R., Canetti R. (eds.): CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012).","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"1523_CR19","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14623-7_1","volume-title":"CRYPTO 2010","author":"Z Brakerski","year":"2010","unstructured":"Brakerski Z., Goldwasser S.: Circular and leakage resilient public-key encryption under subgroup indistinguishability\u2013(or: Quadratic residuosity strikes back). In: Rabin T. (ed.) CRYPTO 2010, vol. 6223, pp. 1\u201320. LNCS. Springer, Heidelberg (2010)."},{"key":"1523_CR20","first-page":"575","volume-title":"45th ACM STOC","author":"Z Brakerski","year":"2013","unstructured":"Brakerski Z., Langlois A., Peikert C., Regev O., Stehl\u00e9 D.: Classical hardness of learning with errors. In: Boneh D., Roughgarden T., Feigenbaum J. (eds.) 45th ACM STOC, pp. 575\u2013584. ACM Press, New York (2013)."},{"key":"1523_CR21","first-page":"97","volume-title":"52nd FOCS","author":"Z Brakerski","year":"2011","unstructured":"Brakerski Z., Vaikuntanathan V.: Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky R. (ed.) 52nd FOCS, pp. 97\u2013106. IEEE Computer Society Press, Palm Springs (2011)."},{"key":"1523_CR22","first-page":"1","volume-title":"ITCS 2014","author":"Z Brakerski","year":"2014","unstructured":"Brakerski Z., Vaikuntanathan V.: Lattice-based FHE as secure as PKE. In: Naor M. (ed.) ITCS 2014, pp. 1\u201312. ACM, New York (2014)."},{"key":"1523_CR23","doi-asserted-by":"crossref","unstructured":"Chen J., Wee H.: Fully, (almost) tightly secure IBE and dual system groups. In: Canetti R., Garay J.A. (eds.) CRYPTO 2013. Part II. LNCS, vol. 8043, pp. 435\u2013460. Springer, Heidelberg (2013).","DOI":"10.1007\/978-3-642-40084-1_25"},{"key":"1523_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114758","volume":"1014","author":"W Chen","year":"2024","unstructured":"Chen W., Huang Z.: Towards tightly secure short linearly homomorphic signatures. Theor. Comput. Sci. 1014, 114758 (2024).","journal-title":"Theor. Comput. Sci."},{"key":"1523_CR25","doi-asserted-by":"crossref","unstructured":"D\u00f6ttling N., Schr\u00f6der D.: Efficient pseudorandom functions via on-the-fly adaptation. In: Gennaro R., Robshaw M.J.B. (eds.) CRYPTO 2015. Part I. LNCS, vol. 9215, pp. 329\u2013350. Springer, Heidelberg (2015).","DOI":"10.1007\/978-3-662-47989-6_16"},{"key":"1523_CR26","doi-asserted-by":"crossref","unstructured":"Gay R., Hofheinz D., Kiltz E., Wee H.: Tightly CCA-secure encryption without pairings. In: Fischlin M., Coron J.-S. (eds.) EUROCRYPT 2016. Part I. LNCS, vol. 9665, pp. 1\u201327. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49890-3_1"},{"key":"1523_CR27","first-page":"169","volume-title":"41st ACM STOC","author":"C Gentry","year":"2009","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press, New York (2009)."},{"key":"1523_CR28","first-page":"197","volume-title":"40th ACM STOC","author":"C Gentry","year":"2008","unstructured":"Gentry C., Peikert C., Vaikuntanathan V.: Trapdoors for hard lattices and new cryptographic constructions. In: Ladner R.E., Dwork C. (eds.) 40th ACM STOC, pp. 197\u2013206. ACM Press, New York (2008)."},{"key":"1523_CR29","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"CRYPTO 2013, Part I","author":"C Gentry","year":"2013","unstructured":"Gentry C., Sahai A., Waters B.: Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti R., Garay J.A. (eds.) CRYPTO 2013, Part I, vol. 8042, pp. 75\u201393. LNCS. Springer, Heidelberg (2013)."},{"key":"1523_CR30","doi-asserted-by":"crossref","unstructured":"Goldreich O., Goldwasser S., Micali S.: How to construct random functions (extended abstract). In: 25th FOCS, pp. 464\u2013479. IEEE Computer Society Press, Palm Springs (1984).","DOI":"10.1109\/SFCS.1984.715949"},{"key":"1523_CR31","doi-asserted-by":"crossref","unstructured":"Gong J., Chen J., Dong X., Cao Z., Tang S.: Extended nested dual system groups, revisited. In: Cheng C.-M., Chung K.-M., Persiano G., Yang B.-Y. (eds.) PKC 2016. Part I. LNCS, vol. 9614, pp. 133\u2013163. Springer, Heidelberg (2016).","DOI":"10.1007\/978-3-662-49384-7_6"},{"key":"1523_CR32","doi-asserted-by":"crossref","unstructured":"Hofheinz D., Jager T.: Tightly secure signatures and public-key encryption. In: Safavi-Naini R., Canetti R. (eds.): CRYPTO 2012. LNCS, vol. 7417, pp. 590\u2013607. Springer, Heidelberg (2012).","DOI":"10.1007\/978-3-642-32009-5_35"},{"key":"1523_CR33","doi-asserted-by":"crossref","unstructured":"Jager T., Kurek R., Pan J.: Simple and more efficient PRFS with tight security from LWE and MATRIX-DDH. Cryptology ePrint Archive, Report 2018\/826, to be appear in Asiacrypt (2018). https:\/\/eprint.iacr.org\/2018\/826.","DOI":"10.1007\/978-3-030-03332-3_18"},{"key":"1523_CR34","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-38348-9_5","volume-title":"EUROCRYPT 2013","author":"M Joye","year":"2013","unstructured":"Joye M., Libert B.: Efficient cryptosystems from $$2^k$$-th power residue symbols. In: Johansson T., Nguyen P.Q. (eds.) EUROCRYPT 2013, vol. 7881, pp. 76\u201392. LNCS. Springer, Heidelberg (2013)."},{"issue":"2","key":"1523_CR35","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s10623-022-01104-5","volume":"91","author":"S Katsumata","year":"2023","unstructured":"Katsumata S., Tomita T., Yamada S.: Direct computation of branching programs and its applications to more efficient lattice-based cryptography. Des. Codes Cryptogr. 91(2), 391\u2013431 (2023).","journal-title":"Des. Codes Cryptogr."},{"key":"1523_CR36","series-title":"LNCS","first-page":"682","volume-title":"ASIACRYPT 2016, Part II","author":"S Katsumata","year":"2016","unstructured":"Katsumata S., Yamada S.: Partitioning via non-linear polynomial functions: more compact IBEs from ideal lattices and bilinear maps. In: Cheon J.H., Takagi T. (eds.) ASIACRYPT 2016, Part II, vol. 10032, pp. 682\u2013712. LNCS. Springer, Heidelberg (2016)."},{"key":"1523_CR37","doi-asserted-by":"publisher","DOI":"10.1201\/b17668","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2014","unstructured":"Katz J., Lindell Y.: Introduction to Modern Cryptography, 2nd edn CRC Press, Boca Raton (2014).","edition":"2"},{"key":"1523_CR38","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1145\/948109.948132","volume-title":"ACM CCS 03","author":"J Katz","year":"2003","unstructured":"Katz J., Wang N.: Efficiency improvements for signature schemes with tight security reductions. In: Jajodia S., Atluri V., Jaeger T. (eds.) ACM CCS 03, pp. 155\u2013164. ACM, New York (2003)."},{"key":"1523_CR39","doi-asserted-by":"crossref","unstructured":"Kim S.: Key-homomorphic pseudorandom functions from LWE with small modulus. In: Rijmen V., Ishai Y. (eds.) EUROCRYPT 2020. Part II. LNCS, pp. 576\u2013607. Springer, Heidelberg (2020).","DOI":"10.1007\/978-3-030-45724-2_20"},{"key":"1523_CR40","doi-asserted-by":"crossref","unstructured":"Lai Q., Liu F.-H., Wang Z.: Almost tight security in lattices with polynomial moduli\u2014PRF, IBE, all-but-many LTF, and more. In: PKC 2020. Part I. LNCS, pp. 652\u2013681. Springer, Heidelberg (2020).","DOI":"10.1007\/978-3-030-45374-9_22"},{"key":"1523_CR41","doi-asserted-by":"crossref","unstructured":"Lewko A.B., Waters B.: Efficient pseudorandom functions from the decisional linear assumption and weaker variants. In: Al-Shaer E., Jha S., Keromytis A.D. (eds.) ACM CCS 09, pp. 112\u2013120. ACM Press (2009).","DOI":"10.1145\/1653662.1653677"},{"issue":"12","key":"1523_CR42","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1007\/s10623-021-00955-8","volume":"89","author":"Y Li","year":"2021","unstructured":"Li Y., Liu S., Han S., Gu D.: Pseudorandom functions in NC class from the standard LWE assumption. Des. Codes Cryptogr. 89(12), 2807\u20132839 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1523_CR43","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-319-63697-9_12","volume-title":"CRYPTO 2017, Part III","author":"B Libert","year":"2017","unstructured":"Libert B., Sakzad A., Stehl\u00e9 D., Steinfeld R.: All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE. In: Katz J., Shacham H. (eds.) CRYPTO 2017, Part III, vol. 10403, pp. 332\u2013364. LNCS. Springer, Heidelberg (2017)."},{"key":"1523_CR44","doi-asserted-by":"crossref","unstructured":"Micciancio D., Peikert C.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Pointcheval D., Johansson T. (eds.): EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012).","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"1523_CR45","doi-asserted-by":"crossref","unstructured":"Micciancio D., Regev O.: Worst-case to average-case reductions based on Gaussian measures. In: 45th FOCS, pp. 372\u2013381. IEEE Computer Society Press, Palm Springs (2004).","DOI":"10.1109\/FOCS.2004.72"},{"key":"1523_CR46","doi-asserted-by":"crossref","unstructured":"Naor M., Reingold O.: Number-theoretic constructions of efficient pseudo-random functions. In: 38th FOCS, pp. 458\u2013467. IEEE Computer Society Press, Palm Springs (1997).","DOI":"10.1109\/SFCS.1997.646134"},{"key":"1523_CR47","series-title":"LNCS","first-page":"223","volume-title":"EUROCRYPT\u201999","author":"P Paillier","year":"1999","unstructured":"Paillier P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern J. (ed.) EUROCRYPT\u201999, vol. 1592, pp. 223\u2013238. LNCS. Springer, Heidelberg (1999)."},{"key":"1523_CR48","doi-asserted-by":"crossref","unstructured":"Pan J., Wagner B.: Lattice-based signatures with tight adaptive corruptions and more. Cryptology ePrint Archive, pp. 347\u2013378 (2022). https:\/\/eprint.iacr.org\/2022\/015","DOI":"10.1007\/978-3-030-97131-1_12"},{"key":"1523_CR49","doi-asserted-by":"crossref","unstructured":"Pan J., Wagner B., Zeng R.: Lattice-based authenticated key exchange with tight security. Cryptology ePrint Archive, pp. 616\u2013647 (2023). https:\/\/eprint.iacr.org\/2023\/823","DOI":"10.1007\/978-3-031-38554-4_20"},{"key":"1523_CR50","first-page":"333","volume-title":"41st ACM STOC","author":"C Peikert","year":"2009","unstructured":"Peikert C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Mitzenmacher M. (ed.) 41st ACM STOC, pp. 333\u2013342. ACM Press, New York (2009)."},{"key":"1523_CR51","first-page":"84","volume-title":"37th ACM STOC","author":"O Regev","year":"2005","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow H.N., Fagin R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press, New York (2005)."},{"key":"1523_CR52","series-title":"LNCS","first-page":"47","volume-title":"CRYPTO\u201984","author":"A Shamir","year":"1984","unstructured":"Shamir A.: Identity-based cryptosystems and signature schemes. In: Blakley G.R., Chaum D. (eds.) CRYPTO\u201984, vol. 196, pp. 47\u201353. LNCS. Springer, Heidelberg (1984)."},{"issue":"1\u20133","key":"1523_CR53","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000010","volume":"7","author":"SP Vadhan","year":"2012","unstructured":"Vadhan S.P.: Pseudorandomness. Found. Trends Theor. Comput. Sci. 7(1\u20133), 1\u2013336 (2012).","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"1523_CR54","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"EUROCRYPT 2005","author":"BR Waters","year":"2005","unstructured":"Waters B.R.: Efficient identity-based encryption without random oracles. In: Cramer R. (ed.) EUROCRYPT 2005, vol. 3494, pp. 114\u2013127. LNCS. Springer, Heidelberg (2005)."},{"key":"1523_CR55","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-63697-9_6","volume-title":"CRYPTO 2017, Part III","author":"S Yamada","year":"2017","unstructured":"Yamada S.: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques. In: Katz J., Shacham H. (eds.) CRYPTO 2017, Part III, vol. 10403, pp. 161\u2013193. LNCS. Springer, Heidelberg (2017)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01523-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01523-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01523-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,17]],"date-time":"2025-03-17T16:40:40Z","timestamp":1742229640000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01523-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,19]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["1523"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01523-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,11,19]]},"assertion":[{"value":"9 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2024","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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}