{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T18:31:35Z","timestamp":1767983495877,"version":"3.49.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031305443","type":"print"},{"value":"9783031305450","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30545-0_8","type":"book-chapter","created":{"date-parts":[[2023,4,15]],"date-time":"2023-04-15T10:02:10Z","timestamp":1681552930000},"page":"205-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Polynomial-Time Cryptanalysis of\u00a0the\u00a0Subspace Flooding Assumption for\u00a0Post-quantum $$i\\mathcal {O}$$"],"prefix":"10.1007","author":[{"given":"Aayush","family":"Jain","sequence":"first","affiliation":[]},{"given":"Huijia","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Lou","sequence":"additional","affiliation":[]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,16]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S.: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 191\u2013225. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_7","DOI":"10.1007\/978-3-030-17653-2_7"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Pellet-Mary, A.: Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 110\u2013140. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_5","DOI":"10.1007\/978-3-030-45721-1_5"},{"key":"8_CR3","doi-asserted-by":"publisher","unstructured":"Ananth, P., Jain, A., Lin, H., Matt, C., Sahai, A.: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 284\u2013332. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_10","DOI":"10.1007\/978-3-030-26954-8_10"},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Ananth, P., Jain, A.: Indistinguishability obfuscation from compact functional encryption. In: Gennaro, R., Robshaw, M.J.B. (eds.) CRYPTO 2015, Part I. LNCS, vol. 9215, pp. 308\u2013326. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_15","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"8_CR5","doi-asserted-by":"publisher","unstructured":"Ananth, P., Sahai, A.: Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps. In: Coron, J.S., Nielsen, J.B. (eds.) EUROCRYPT 2017, Part I. LNCS, vol. 10210, pp. 152\u2013181. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_6","DOI":"10.1007\/978-3-319-56620-7_6"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Goyal, V., Jain, A., Sahai, A.: Verifiable functional encryption. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016, Part II. LNCS, vol. 10032, pp. 557\u2013587. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_19","DOI":"10.1007\/978-3-662-53890-6_19"},{"key":"8_CR7","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Miles, E., Sahai, A., Zhandry, M.: Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT 2016, Part II. LNCS, vol. 9666, pp. 764\u2013791. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_27","DOI":"10.1007\/978-3-662-49896-5_27"},{"key":"8_CR8","unstructured":"Ballard, L., Green, M., de Medeiros, B., Monrose, F.: Correlation-resistant storage via keyword-searchable encryption. Cryptology ePrint Archive, Report 2005\/417 (2005). https:\/\/eprint.iacr.org\/2005\/417"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Barak, B., Brakerski, Z., Komargodski, I., Kothari, P.K.: Limits on low-degree pseudorandom generators (or: sum-of-squares meets program obfuscation). Electron. Colloquium Comput. Complexity (ECCC) 24, 60 (2017)","DOI":"10.1007\/978-3-319-78375-8_21"},{"key":"8_CR10","doi-asserted-by":"publisher","unstructured":"Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A.: Protecting obfuscation against algebraic attacks. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 221\u2013238. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_13","DOI":"10.1007\/978-3-642-55220-5_13"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Barak, B., et al.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_1","DOI":"10.1007\/3-540-44647-8_1"},{"key":"8_CR12","doi-asserted-by":"publisher","unstructured":"Barak, B., Hopkins, S.B., Jain, A., Kothari, P., Sahai, A.: Sum-of-squares meets program obfuscation, revisited. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 226\u2013250. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_8","DOI":"10.1007\/978-3-030-17653-2_8"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Ishai, Y., Jain, A., Ma, F., Sahai, A., Zhandry, M.: Affine determinant programs: a framework for obfuscation and witness encryption. In: Vidick, T. (ed.) ITCS 2020, vol. 151, pp. 82:1\u201382:39. LIPIcs, January 2020. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.82","DOI":"10.4230\/LIPIcs.ITCS.2020.82"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Nishimaki, R., Passel\u00e8gue, A., Wichs, D.: From Cryptomania to Obfustopia through secret-key functional encryption. In: Hirt, M., Smith, A.D. (eds.) TCC 2016-B, Part II. LNCS, vol. 9986, pp. 391\u2013418. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_15","DOI":"10.1007\/978-3-662-53644-5_15"},{"key":"8_CR15","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Paneth, O., Rosen, A.: On the cryptographic hardness of finding a Nash equilibrium. In: Guruswami, V. (ed.) 56th FOCS, pp. 1480\u20131498. IEEE Computer Society Press, October 2015. https:\/\/doi.org\/10.1109\/FOCS.2015.94","DOI":"10.1109\/FOCS.2015.94"},{"key":"8_CR16","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. In: Guruswami, V. (ed.) 56th FOCS, pp. 171\u2013190. IEEE Computer Society Press, October 2015. https:\/\/doi.org\/10.1109\/FOCS.2015.20","DOI":"10.1109\/FOCS.2015.20"},{"key":"8_CR17","unstructured":"Boneh, D., Wu, D.J., Zimmerman, J.: Immunizing multilinear maps against zeroizing attacks. Cryptology ePrint Archive, Report 2014\/930 (2014)"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Candidate iO from homomorphic encryption schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020, Part I. LNCS, vol. 12105, pp. 79\u2013109. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_4","DOI":"10.1007\/978-3-030-45721-1_4"},{"key":"8_CR19","unstructured":"Brakerski, Z., Gentry, C., Halevi, S., Lepoint, T., Sahai, A., Tibouchi, M.: Cryptanalysis of the quadratic zero-testing of GGH. Cryptology ePrint Archive, Report 2015\/845 (2015). http:\/\/eprint.iacr.org\/"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-54242-8_1","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Rothblum, G.N.: Virtual black-box obfuscation for all circuits via generic graded encoding. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 1\u201325. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_1"},{"key":"8_CR21","doi-asserted-by":"publisher","unstructured":"Brzuska, C., Farshim, P., Mittelbach, A.: Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 188\u2013205. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_11","DOI":"10.1007\/978-3-662-44371-2_11"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Canetti, R., Lin, H., Tessaro, S., Vaikuntanathan, V.: Obfuscation of probabilistic circuits and applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 468\u2013497. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_19","DOI":"10.1007\/978-3-662-46497-7_19"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-46800-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"JH Cheon","year":"2015","unstructured":"Cheon, J.H., Han, K., Lee, C., Ryu, H., Stehl\u00e9, D.: Cryptanalysis of the multilinear map over the integers. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 3\u201312. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_1"},{"key":"8_CR24","unstructured":"Cheon, J.H., Lee, C., Ryu, H.: Cryptanalysis of the new CLT multilinear maps. Cryptology ePrint Archive, Report 2015\/934 (2015). http:\/\/eprint.iacr.org\/"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Chung, K.M., Lin, H., Pass, R.: Constant-round concurrent zero-knowledge from indistinguishability obfuscation. In: Gennaro, R., Robshaw, M.J.B. (eds.) CRYPTO 2015, Part I. LNCS, vol. 9215, pp. 287\u2013307. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_14","DOI":"10.1007\/978-3-662-47989-6_14"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-662-47989-6_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"J-S Coron","year":"2015","unstructured":"Coron, J.-S., et al.: Zeroizing without low-level zeroes: new MMAP attacks and their limitations. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 247\u2013266. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_12"},{"key":"8_CR27","doi-asserted-by":"publisher","unstructured":"Coron, J.S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part I. LNCS, vol. 8042, pp. 476\u2013493. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_26","DOI":"10.1007\/978-3-642-40041-4_26"},{"key":"8_CR28","doi-asserted-by":"publisher","unstructured":"Coron, J.S., Lepoint, T., Tibouchi, M.: New multilinear maps over the integers. In: Gennaro, R., Robshaw, M.J.B. (eds.) CRYPTO 2015, Part I. LNCS, vol. 9215, pp. 267\u2013286. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_13","DOI":"10.1007\/978-3-662-47989-6_13"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-030-90453-1_9","volume-title":"Theory of Cryptography","author":"L Devadas","year":"2021","unstructured":"Devadas, L., Quach, W., Vaikuntanathan, V., Wee, H., Wichs, D.: Succinct LWE sampling, random polynomials, and obfuscation. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 256\u2013287. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_9"},{"key":"8_CR30","unstructured":"D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Mukherjee, P.: Obfuscation from low noise multilinear maps. IACR Cryptology ePrint Archive 2016, 599 (2016)"},{"key":"8_CR31","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1\u201317. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38348-9_1","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th FOCS, pp. 40\u201349. IEEE Computer Society Press, October 2013. https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"Gay, R., Pass, R.: Indistinguishability obfuscation from circular security, pp. 736\u2013749. ACM Press (2021). https:\/\/doi.org\/10.1145\/3406325.3451070","DOI":"10.1145\/3406325.3451070"},{"key":"8_CR34","doi-asserted-by":"publisher","unstructured":"Gentry, C., Gorbunov, S., Halevi, S.: Graph-induced multilinear maps from lattices. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015, Part II. LNCS, vol. 9015, pp. 498\u2013527. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_20","DOI":"10.1007\/978-3-662-46497-7_20"},{"key":"8_CR35","unstructured":"Gentry, C., Jutla, C.S., Kane, D.: Obfuscation using tensor products. Electron. Colloquium Comput. Complexity (ECCC) 25, 149 (2018)"},{"key":"8_CR36","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 2013, Part I. 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":"8_CR37","first-page":"63","volume":"2000","author":"O Goldreich","year":"2000","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. IACR Cryptol. ePrint Arch. 2000, 63 (2000)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"8_CR38","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., et al.: Multi-input functional encryption. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 578\u2013602. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_32","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"8_CR39","first-page":"866","volume":"2015","author":"S Halevi","year":"2015","unstructured":"Halevi, S.: Graded encoding, variations on a scheme. IACR Cryptol. ePrint Arch. 2015, 866 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"8_CR40","doi-asserted-by":"publisher","unstructured":"Hopkins, S.B., Jain, A., Lin, H.: Counterexamples to new circular security assumptions underlying iO. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 673\u2013700, Virtual Event. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_23","DOI":"10.1007\/978-3-030-84245-1_23"},{"key":"8_CR41","first-page":"301","volume":"2015","author":"Y Hu","year":"2015","unstructured":"Hu, Y., Jia, H.: Cryptanalysis of GGH map. IACR Cryptol. ePrint Arch. 2015, 301 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"8_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-642-00457-5_18","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2009","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Secure arithmetic computation with no honest majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 294\u2013314. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_18"},{"key":"8_CR43","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Matt, C., Sahai, A.: How to leverage hardness of constant-degree expanding polynomials over $$\\mathbb{R} $$ to build $$i\\cal{O} $$. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019, Part I. LNCS, vol. 11476, pp. 251\u2013281. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_9","DOI":"10.1007\/978-3-030-17653-2_9"},{"key":"8_CR44","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions, pp. 60\u201373. ACM Press (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"8_CR45","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F}_p$$, DLIN, and PRGs in $$\\text{NC}^{\\text{0 }}$$. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022\u201341st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, 30 May\u20133 June 2022, Proceedings, Part I. LNCS, vol. 13275, pp. 670\u2013699. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_23","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"8_CR46","doi-asserted-by":"publisher","unstructured":"Khurana, D., Rao, V., Sahai, A.: Multi-party key exchange for unbounded parties from indistinguishability obfuscation. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015, Part I. LNCS, vol. 9452, pp. 52\u201375. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_3","DOI":"10.1007\/978-3-662-48797-6_3"},{"key":"8_CR47","doi-asserted-by":"publisher","unstructured":"Lin, H.: Indistinguishability obfuscation from constant-degree graded encoding schemes. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT 2016, Part I. LNCS, vol. 9665, pp. 28\u201357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_2","DOI":"10.1007\/978-3-662-49890-3_2"},{"key":"8_CR48","doi-asserted-by":"publisher","unstructured":"Lin, H.: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 599\u2013629. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_20","DOI":"10.1007\/978-3-319-63688-7_20"},{"key":"8_CR49","doi-asserted-by":"publisher","unstructured":"Lin, H., Pass, R., Seth, K., Telang, S.: Indistinguishability obfuscation with non-trivial efficiency. In: Cheng, C.M., Chung, K.M., Persiano, G., Yang, B.Y. (eds.) PKC 2016, Part II. LNCS, vol. 9615, pp. 447\u2013462. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_17","DOI":"10.1007\/978-3-662-49387-8_17"},{"key":"8_CR50","doi-asserted-by":"publisher","unstructured":"Lin, H., Tessaro, S.: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 630\u2013660. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_21","DOI":"10.1007\/978-3-319-63688-7_21"},{"key":"8_CR51","doi-asserted-by":"publisher","unstructured":"Lombardi, A., Vaikuntanathan, V.: Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part I. LNCS, vol. 10677, pp. 119\u2013137. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_5","DOI":"10.1007\/978-3-319-70500-2_5"},{"key":"8_CR52","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 2013, Part I. 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":"8_CR53","doi-asserted-by":"crossref","unstructured":"Miles, E., Sahai, A., Zhandry, M.: Annihilation attacks for multilinear maps: cryptanalysis of indistinguishability obfuscation over GGH13. In: Advances in Cryptology - CRYPTO (2016)","DOI":"10.1007\/978-3-662-53008-5_22"},{"key":"8_CR54","unstructured":"Minaud, B., Fouque, P.A.: Cryptanalysis of the new multilinear map over the integers. Cryptology ePrint Archive, Report 2015\/941 (2015). http:\/\/eprint.iacr.org\/"},{"key":"8_CR55","doi-asserted-by":"publisher","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press, May\/June 2014. https:\/\/doi.org\/10.1145\/2591796.2591825","DOI":"10.1145\/2591796.2591825"},{"key":"8_CR56","doi-asserted-by":"publisher","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT 2021, Part III. LNCS, vol. 12698, pp. 127\u2013156. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5","DOI":"10.1007\/978-3-030-77883-5_5"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30545-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T22:03:55Z","timestamp":1744754635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30545-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031305443","9783031305450"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30545-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"42","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"415","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"109","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}