{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,11]],"date-time":"2026-09-11T15:49:12Z","timestamp":1789141752368,"version":"build-2803163510"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T00:00:00Z","timestamp":1664323200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001695","name":"Japan Science and Technology Corporation","doi-asserted-by":"publisher","award":["JPMJCR19F6"],"award-info":[{"award-number":["JPMJCR19F6"]}],"id":[{"id":"10.13039\/501100001695","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["19H01109"],"award-info":[{"award-number":["19H01109"]}],"id":[{"id":"10.13039\/501100001691","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":[[2023,2]]},"DOI":"10.1007\/s10623-022-01104-5","type":"journal-article","created":{"date-parts":[[2022,9,28]],"date-time":"2022-09-28T11:03:52Z","timestamp":1664363032000},"page":"391-431","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Direct computation of branching programs and its applications to more efficient lattice-based cryptography"],"prefix":"10.1007","volume":"91","author":[{"given":"Shuichi","family":"Katsumata","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8449-1753","authenticated-orcid":false,"given":"Toi","family":"Tomita","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shota","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,9,28]]},"reference":[{"key":"1104_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal S., Boneh D., Boyen X.: Efficient lattice (H)IBE in the standard model. In: Gilbert H. (ed.) EUROCRYPT\u00a02010, LNCS, vol. 6110, pp. 553\u2013572. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_28.","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"1104_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal S., Freeman D.M., Vaikuntanathan V.: Functional encryption for inner product predicates from learning with errors. In: Lee D.H., Wang X. (eds.) ASIACRYPT\u00a02011, LNCS, vol. 7073, pp. 21\u201340. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_2.","DOI":"10.1007\/978-3-642-25385-0_2"},{"key":"1104_CR3","doi-asserted-by":"publisher","unstructured":"Agrawal S., Boyen X., Vaikuntanathan V., et al.: Functional encryption for threshold functions (or fuzzy IBE) from lattices. In: Fischlin M., Buchmann J., Manulis M. (eds.) PKC\u00a02012, LNCS, vol. 7293, pp. 280\u2013297. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30057-8_17.","DOI":"10.1007\/978-3-642-30057-8_17"},{"key":"1104_CR4","doi-asserted-by":"publisher","unstructured":"Alperin-Sheriff J., Peikert C.: Practical bootstrapping in quasilinear time. In: Canetti R., Garay J.A. (eds.) CRYPTO\u00a02013, Part\u00a0I, LNCS, vol. 8042, pp. 1\u201320. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_1.","DOI":"10.1007\/978-3-642-40041-4_1"},{"key":"1104_CR5","doi-asserted-by":"publisher","unstructured":"Alperin-Sheriff J., Peikert C.: Faster bootstrapping with polynomial error. In: Garay J.A., Gennaro R. (eds.) CRYPTO\u00a02014, Part\u00a0I, LNCS, vol. 8616, pp. 297\u2013314. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_17.","DOI":"10.1007\/978-3-662-44371-2_17"},{"key":"1104_CR6","doi-asserted-by":"publisher","unstructured":"Attrapadung N., Libert B.: Functional encryption for inner product: Achieving constant-size ciphertexts with adaptive security or support for negation. In: Nguyen P.Q., Pointcheval D. (eds.) PKC\u00a02010, LNCS, vol. 6056, pp. 384\u2013402. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13013-7_23.","DOI":"10.1007\/978-3-642-13013-7_23"},{"key":"1104_CR7","doi-asserted-by":"publisher","unstructured":"Banerjee A., Peikert C.: New and improved key-homomorphic pseudorandom functions. In: Garay J.A., Gennaro R. (eds.) CRYPTO\u00a02014, Part\u00a0I, LNCS, vol. 8616, pp. 353\u2013370. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_20.","DOI":"10.1007\/978-3-662-44371-2_20"},{"key":"1104_CR8","doi-asserted-by":"publisher","unstructured":"Banerjee A., Peikert C., Rosen A.: Pseudorandom functions and lattices. In: Pointcheval D., Johansson T. (eds.) EUROCRYPT\u00a02012, LNCS, vol. 7237, pp. 719\u2013737. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_42.","DOI":"10.1007\/978-3-642-29011-4_42"},{"issue":"1","key":"1104_CR9","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"DA Barrington","year":"1989","unstructured":"Barrington D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. J. Comput. Syst. Sci. 38(1), 150\u2013164 (1989).","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"1104_CR10","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1137\/0215070","volume":"15","author":"PW Beame","year":"1986","unstructured":"Beame P.W., Cook S.A., Hoover H.J.: Log depth circuits for division and related problems. SIAM J. Comput. 15(4), 994\u20131003 (1986).","journal-title":"SIAM J. Comput."},{"key":"1104_CR11","doi-asserted-by":"publisher","unstructured":"Blazy O., Kakvi S.A., Kiltz E., et al.: Tightly-secure signatures from chameleon hash functions. In: Katz J. (ed.) PKC\u00a02015, LNCS, vol. 9020, pp. 256\u2013279. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46447-2_12.","DOI":"10.1007\/978-3-662-46447-2_12"},{"key":"1104_CR12","doi-asserted-by":"publisher","unstructured":"Boneh D., Franklin M.K.: Identity-based encryption from the Weil pairing. In: Kilian J. (ed.) CRYPTO\u00a02001, LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13.","DOI":"10.1007\/3-540-44647-8_13"},{"key":"1104_CR13","doi-asserted-by":"publisher","unstructured":"Boneh D., Waters B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan S.P. (ed.) TCC\u00a02007, LNCS, vol. 4392, pp. 535\u2013554. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70936-7_29.","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"1104_CR14","doi-asserted-by":"publisher","unstructured":"Boneh D., Gentry C., Gorbunov S., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen P.Q., Oswald E. (eds.) EUROCRYPT\u00a02014, LNCS, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30.","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"1104_CR15","doi-asserted-by":"publisher","unstructured":"Boneh D., Ishai Y., Passel\u00e8gue A., et al.: Exploring crypto dark matter: new simple PRF candidates and their applications. In: Beimel A., Dziembowski S. (eds.) TCC\u00a02018, Part\u00a0II, LNCS, vol. 11240, pp. 699\u2013729. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_25.","DOI":"10.1007\/978-3-030-03810-6_25"},{"key":"1104_CR16","doi-asserted-by":"publisher","unstructured":"Boyen X., Li Q.: Towards tightly secure lattice short signature and id-based encryption. In: Cheon J.H., Takagi T. (eds.) ASIACRYPT\u00a02016, Part\u00a0II, LNCS, vol. 10032, pp. 404\u2013434. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_14.","DOI":"10.1007\/978-3-662-53890-6_14"},{"key":"1104_CR17","doi-asserted-by":"publisher","unstructured":"Boyen X., Li Q.: All-but-many lossy trapdoor functions from lattices and applications. In: Katz J, Shacham H. (eds.) CRYPTO\u00a02017, Part\u00a0III, LNCS, vol. 10403, pp. 298\u2013331. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_11.","DOI":"10.1007\/978-3-319-63697-9_11"},{"key":"1104_CR18","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Vaikuntanathan V.: Efficient fully homomorphic encryption from (standard) LWE. In: Ostrovsky R. (ed.) 52nd FOCS. IEEE Computer Society Press, pp. 97\u2013106 (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.12.","DOI":"10.1109\/FOCS.2011.12"},{"key":"1104_CR19","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Vaikuntanathan V.: Lattice-based FHE as secure as PKE. In: Naor M. (ed.) ITCS 2014, pp. 1\u201312. ACM (2014). https:\/\/doi.org\/10.1145\/2554797.2554799.","DOI":"10.1145\/2554797.2554799"},{"key":"1104_CR20","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Vaikuntanathan V.: Circuit-ABE from LWE: unbounded attributes and semi-adaptive security. In: Robshaw M., Katz J. (eds.) CRYPTO\u00a02016, Part\u00a0III, LNCS, vol. 9816, pp. 363\u2013384. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_13.","DOI":"10.1007\/978-3-662-53015-3_13"},{"key":"1104_CR21","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Gentry C., Vaikuntanathan V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser S. (ed.) ITCS 2012, pp. 309\u2013325. ACM (2012). https:\/\/doi.org\/10.1145\/2090236.2090262.","DOI":"10.1145\/2090236.2090262"},{"key":"1104_CR22","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Langlois A., Peikert C., et al.: Classical hardness of learning with errors. In: Boneh D., Roughgarden T., Feigenbaum J. (eds.) 45th ACM STOC, pp. 575\u2013584. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488680.","DOI":"10.1145\/2488608.2488680"},{"key":"1104_CR23","doi-asserted-by":"publisher","unstructured":"Brakerski Z., Lombardi A., Segev G., et al.: Anonymous IBE, leakage resilience and circular security from new assumptions. In: Nielsen J.B., Rijmen V. (eds.) EUROCRYPT\u00a02018, Part\u00a0I, LNCS, vol. 10820, pp. 535\u2013564. Springer, Heidelberg (2018) https:\/\/doi.org\/10.1007\/978-3-319-78381-9_20.","DOI":"10.1007\/978-3-319-78381-9_20"},{"key":"1104_CR24","doi-asserted-by":"publisher","unstructured":"Cash D., Hofheinz D., Kiltz E., et al.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert H. (ed.) EUROCRYPT\u00a02010, LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27.","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"1104_CR25","doi-asserted-by":"publisher","unstructured":"Cheon J.H., Cho W., Kim J.H., et\u00a0al.: Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions. In: LNCS, pp 739\u2013760. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_26.","DOI":"10.1007\/978-3-030-75248-4_26"},{"key":"1104_CR26","doi-asserted-by":"publisher","unstructured":"Dodis Y., Reyzin L., Smith A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin C., Camenisch J. (eds.) EUROCRYPT\u00a02004, LNCS, vol. 3027, pp. 523\u2013540. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_31.","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"1104_CR27","doi-asserted-by":"publisher","unstructured":"Gentry C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher M. (ed.) 41st ACM STOC, pp. 169\u2013178. ACM Press (2009). https:\/\/doi.org\/10.1145\/1536414.1536440.","DOI":"10.1145\/1536414.1536440"},{"key":"1104_CR28","doi-asserted-by":"publisher","unstructured":"Gentry C., Halevi S.: Fully homomorphic encryption without squashing using depth-3 arithmetic circuits. In: Ostrovsky R. (ed.) 52nd FOCS, pp. 107\u2013109. IEEE Computer Society Press (2011). https:\/\/doi.org\/10.1109\/FOCS.2011.94.","DOI":"10.1109\/FOCS.2011.94"},{"key":"1104_CR29","doi-asserted-by":"publisher","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 (2008). https:\/\/doi.org\/10.1145\/1374376.1374407.","DOI":"10.1145\/1374376.1374407"},{"key":"1104_CR30","doi-asserted-by":"publisher","unstructured":"Gentry C., Halevi S., Smart N.P.: Better bootstrapping in fully homomorphic encryption. In: Fischlin M., Buchmann J., Manulis M. (eds.) PKC\u00a02012, LNCS, vol. 7293, pp. 1\u201316. Springer, Heidelberg (2012a).https:\/\/doi.org\/10.1007\/978-3-642-30057-8_1.","DOI":"10.1007\/978-3-642-30057-8_1"},{"key":"1104_CR31","doi-asserted-by":"publisher","unstructured":"Gentry C., Halevi S., Smart N.P.: Fully homomorphic encryption with polylog overhead. In: Pointcheval D., Johansson T. (eds.) EUROCRYPT\u00a02012, LNCS, vol. 7237, pp 465\u2013482. Springer, Heidelberg (2012b). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_28.","DOI":"10.1007\/978-3-642-29011-4_28"},{"key":"1104_CR32","doi-asserted-by":"publisher","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\u00a02013, Part\u00a0I, LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5.","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"1104_CR33","doi-asserted-by":"publisher","unstructured":"Gorbunov S., Vinayagamurthy D.: Riding on asymmetry: efficient ABE for branching programs. In: Iwata T., Cheon J.H. (eds.) ASIACRYPT\u00a02015, Part\u00a0I, LNCS, vol. 9452, pp. 550\u2013574. Springer, Heidelberg (2015).https:\/\/doi.org\/10.1007\/978-3-662-48797-6_23.","DOI":"10.1007\/978-3-662-48797-6_23"},{"key":"1104_CR34","doi-asserted-by":"publisher","unstructured":"Gorbunov S., Vaikuntanathan V., Wee H.: Attribute-based encryption for circuits. In: Boneh D., Roughgarden T., Feigenbaum J. (eds.) 45th ACM STOC, pp. 545\u2013554. ACM Press (2013). https:\/\/doi.org\/10.1145\/2488608.2488677.","DOI":"10.1145\/2488608.2488677"},{"key":"1104_CR35","doi-asserted-by":"publisher","unstructured":"Gorbunov S., Vaikuntanathan V., Wee H.: Predicate encryption for circuits from LWE. In: Gennaro R., Robshaw M.J.B. (eds.) CRYPTO\u00a02015, Part\u00a0II, LNCS, vol. 9216, pp. 503\u2013523. Springer, Heidelberg (2015a). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_25.","DOI":"10.1007\/978-3-662-48000-7_25"},{"key":"1104_CR36","doi-asserted-by":"publisher","unstructured":"Gorbunov S., Vaikuntanathan V., Wichs D.: Leveled fully homomorphic signatures from standard lattices. In: Servedio R.A., Rubinfeld R. (eds.) 47th ACM STOC, pp. 469\u2013477. ACM Press (2015b). https:\/\/doi.org\/10.1145\/2746539.2746576.","DOI":"10.1145\/2746539.2746576"},{"key":"1104_CR37","doi-asserted-by":"publisher","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\u00a02016, Part\u00a0II, LNCS, vol. 10032, pp. 682\u2013712. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_23.","DOI":"10.1007\/978-3-662-53890-6_23"},{"key":"1104_CR38","doi-asserted-by":"publisher","unstructured":"Katsumata S., Yamada S.: Group signatures without NIZK: from lattices in the standard model. In: Ishai Y., Rijmen V. (eds.) EUROCRYPT\u00a02019, Part\u00a0III, LNCS, vol. 11478, pp. 312\u2013344. Springer, Heidelberg (2019a). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_11.","DOI":"10.1007\/978-3-030-17659-4_11"},{"key":"1104_CR39","doi-asserted-by":"publisher","unstructured":"Katsumata S., Yamada S.: Non-zero inner product encryption schemes from various assumptions: LWE, DDH and DCR. In: Lin D., Sako K. (eds.) PKC\u00a02019, Part\u00a0II, LNCS, vol. 11443, pp. 158\u2013188. Springer, Heidelberg (2019b). https:\/\/doi.org\/10.1007\/978-3-030-17259-6_6.","DOI":"10.1007\/978-3-030-17259-6_6"},{"key":"1104_CR40","doi-asserted-by":"publisher","unstructured":"Katz J., Wang N.: Efficiency improvements for signature schemes with tight security reductions. In: Jajodia S., Atluri V., Jaeger T. (eds.) ACM CCS 2003, pp. 155\u2013164. ACM Press (2003). https:\/\/doi.org\/10.1145\/948109.948132.","DOI":"10.1145\/948109.948132"},{"key":"1104_CR41","doi-asserted-by":"publisher","unstructured":"Katz J., Sahai A., Waters B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Smart N.P. (ed.) EUROCRYPT\u00a02008, LNCS, vol. 4965, pp. 146\u2013162. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_9.","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"1104_CR42","doi-asserted-by":"publisher","unstructured":"Kim S., Wu D.J.: Multi-theorem preprocessing NIZKs from lattices. In: Shacham H., Boldyreva A. (eds.) CRYPTO\u00a02018, Part\u00a0II, LNCS, vol. 10992, pp 733\u2013765. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_25.","DOI":"10.1007\/978-3-319-96881-0_25"},{"key":"1104_CR43","doi-asserted-by":"publisher","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\u00a02020, Part\u00a0I, LNCS, pp. 652\u2013681. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45374-9_22.","DOI":"10.1007\/978-3-030-45374-9_22"},{"key":"1104_CR44","doi-asserted-by":"publisher","unstructured":"Libert B., Sakzad A., Stehl\u00e9, D., et\u00a0al.: All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE. In: Katz J., Shacham H. (eds.) CRYPTO\u00a02017, Part\u00a0III, LNCS, vol. 10403, pp. 332\u2013364. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_12.","DOI":"10.1007\/978-3-319-63697-9_12"},{"key":"1104_CR45","doi-asserted-by":"publisher","unstructured":"Libert B., Stehl\u00e9 D., Titiu R.: Adaptively secure distributed PRFs from $${\\sf LWE}$$. In: Beimel A., Dziembowski S. (eds.) TCC\u00a02018, Part\u00a0II, LNCS, vol. 11240, pp. 391\u2013421. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_15.","DOI":"10.1007\/978-3-030-03810-6_15"},{"issue":"2","key":"1104_CR46","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., et al.: Smallest singular value of random matrices and geometry of random polytopes. Adv. Math. 195(2), 491\u2013523 (2005).","journal-title":"Adv. Math."},{"key":"1104_CR47","doi-asserted-by":"publisher","unstructured":"Micciancio D., Peikert C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval D., Johansson T. (eds.) EUROCRYPT\u00a02012, LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41.","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"1104_CR48","doi-asserted-by":"publisher","unstructured":"Micciancio D., Peikert C.: Hardness of SIS and LWE with small parameters. In: Canetti R., Garay J.A. (eds.) CRYPTO\u00a02013, Part\u00a0I, LNCS, vol. 8042, pp. 21\u201339. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_2.","DOI":"10.1007\/978-3-642-40041-4_2"},{"key":"1104_CR49","doi-asserted-by":"publisher","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 (2009). https:\/\/doi.org\/10.1145\/1536414.1536461.","DOI":"10.1145\/1536414.1536461"},{"key":"1104_CR50","doi-asserted-by":"publisher","unstructured":"Peikert C., Vaikuntanathan V., Waters B.: A framework for efficient and composable oblivious transfer. In: Wagner D. (ed.) CRYPTO\u00a02008, LNCS, vol. 5157, pp. 554\u2013571. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_31.","DOI":"10.1007\/978-3-540-85174-5_31"},{"key":"1104_CR51","doi-asserted-by":"publisher","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 (2005). https:\/\/doi.org\/10.1145\/1060590.1060603.","DOI":"10.1145\/1060590.1060603"},{"key":"1104_CR52","doi-asserted-by":"publisher","unstructured":"Sahai A., Waters B.R.: Fuzzy identity-based encryption. In: Cramer R. (ed.) EUROCRYPT\u00a02005, LNCS, vol. 3494, pp. 457\u2013473. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_27.","DOI":"10.1007\/11426639_27"},{"key":"1104_CR53","doi-asserted-by":"publisher","unstructured":"Tsabary R.: Fully secure attribute-based encryption for t-CNF from LWE. In: Boldyreva A., Micciancio D. (eds.) CRYPTO\u00a02019, Part\u00a0I, LNCS, vol. 11692, pp. 62\u201385. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_3.","DOI":"10.1007\/978-3-030-26948-7_3"},{"key":"1104_CR54","unstructured":"Viola E.: Gems of theoretical computer science. In: Lecture Notes (2009). http:\/\/www.ccs.neu.edu\/home\/viola\/classes\/gems-08\/index.html."},{"key":"1104_CR55","doi-asserted-by":"publisher","unstructured":"Waters B.R.: Efficient identity-based encryption without random oracles. In: Cramer R. (ed.) EUROCRYPT\u00a02005, LNCS, vol. 3494, pp. 114\u2013127. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11426639_7.","DOI":"10.1007\/11426639_7"},{"key":"1104_CR56","doi-asserted-by":"publisher","unstructured":"Yamada S.: Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters. In: Fischlin M., Coron J.S. (eds.) EUROCRYPT\u00a02016, Part\u00a0II, LNCS, vol. 9666, pp. 32\u201362. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_2.","DOI":"10.1007\/978-3-662-49896-5_2"},{"key":"1104_CR57","doi-asserted-by":"publisher","unstructured":"Yamada S.: Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques. In: Katz J., Shacham H. (eds.) CRYPTO\u00a02017, Part\u00a0III, LNCS, vol. 10403, pp. 161\u2013193. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_6.","DOI":"10.1007\/978-3-319-63697-9_6"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01104-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01104-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01104-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T07:51:15Z","timestamp":1676015475000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01104-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,28]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["1104"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01104-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,28]]},"assertion":[{"value":"29 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}