{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T15:11:34Z","timestamp":1767971494863,"version":"3.49.0"},"publisher-location":"Cham","reference-count":72,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032019066","type":"print"},{"value":"9783032019073","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01907-3_1","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:26Z","timestamp":1755383246000},"page":"3-38","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Lattice-Based Post-quantum iO from\u00a0Circular Security with\u00a0Random Opening Assumption"],"prefix":"10.1007","author":[{"given":"Yao-Ching","family":"Hsieh","sequence":"first","affiliation":[]},{"given":"Aayush","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Huijia","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-17653-2_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S.: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 191\u2013225. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_7"},{"key":"1_CR2","unstructured":"Agrawal, S., Kumari, S., Yamada, S.: Pseudorandom multi-input functional encryption and applications. Cryptology ePrint Archive, Paper 2024\/1720 (2024). https:\/\/eprint.iacr.org\/2024\/1720"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-030-45721-1_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"S Agrawal","year":"2020","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. LNCS, vol. 12105, pp. 110\u2013140. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_5"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-26954-8_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"P Ananth","year":"2019","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. LNCS, vol. 11694, pp. 284\u2013332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_10"},{"key":"1_CR5","unstructured":"Ananth, P., Jain, A., Sahai, A.: Indistinguishability obfuscation without multilinear maps: iO from LWE, bilinear maps, and weak pseudorandomness. Cryptology ePrint Archive, Report 2018\/615 (2018). https:\/\/eprint.iacr.org\/2018\/615"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-56620-7_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"P Ananth","year":"2017","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. LNCS, vol. 10210, pp. 152\u2013181. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_6"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Ananth, P.V., Gupta, D., Ishai, Y., Sahai, A.: Optimizing obfuscation: avoiding Barrington\u2019s theorem. In: Ahn, G.J., Yung, M., Li, N. (eds.) ACM CCS 2014. pp. 646\u2013658. ACM Press (2014). https:\/\/doi.org\/10.1145\/2660267.2660342","DOI":"10.1145\/2660267.2660342"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1007\/978-3-662-49896-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"S Badrinarayanan","year":"2016","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. LNCS, vol. 9666, pp. 764\u2013791. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_27"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-55220-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"B Barak","year":"2014","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"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: 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"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-030-17653-2_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"B Barak","year":"2019","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. LNCS, vol. 11476, pp. 226\u2013250. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_8"},{"key":"1_CR12","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.\u00a0151, pp. 82:1\u201382:39. LIPIcs (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2020.82","DOI":"10.4230\/LIPIcs.ITCS.2020.82"},{"key":"1_CR13","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 (2015). https:\/\/doi.org\/10.1109\/FOCS.2015.94","DOI":"10.1109\/FOCS.2015.94"},{"key":"1_CR14","unstructured":"Boneh, D., Wu, D.J., Zimmerman, J.: Immunizing multilinear maps against zeroizing attacks. Cryptology ePrint Archive, Report 2014\/930 (2014). https:\/\/eprint.iacr.org\/2014\/930"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-030-45721-1_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Candidate iO from homomorphic encryption schemes. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 79\u2013109. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_4"},{"key":"1_CR16","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Factoring and pairings are not necessary for IO: Circular-secure LWE suffices. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) ICALP 2022. LIPIcs, vol.\u00a0229, pp. 28:1\u201328:20. Schloss Dagstuhl (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.28","DOI":"10.4230\/LIPIcs.ICALP.2022.28"},{"key":"1_CR17","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). https:\/\/eprint.iacr.org\/2015\/845"},{"key":"1_CR18","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":"1_CR19","doi-asserted-by":"publisher","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, October 2011. https:\/\/doi.org\/10.1109\/FOCS.2011.12","DOI":"10.1109\/FOCS.2011.12"},{"key":"1_CR20","unstructured":"Branco, P., et al.: Pseudorandom obfuscation and applications. Cryptology ePrint Archive, Paper 2024\/1742 (2024). https:\/\/eprint.iacr.org\/2024\/1742"},{"key":"1_CR21","doi-asserted-by":"publisher","unstructured":"Brzuska, C., \u00dcnal, A., Woo, I.K.Y.: Evasive LWE assumptions: definitions, classes, and counterexamples. In: ASIACRYPT\u00a02024. LNCS, vol. 15487, pp. 418\u2013449. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-981-96-0894-2_14","DOI":"10.1007\/978-981-96-0894-2_14"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-662-44371-2_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"C Brzuska","year":"2014","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. LNCS, vol. 8616, pp. 188\u2013205. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_11"},{"key":"1_CR23","doi-asserted-by":"publisher","unstructured":"Canetti, R., Chamon, C., Mucciolo, E.R., Ruckenstein, A.E.: Towards general-purpose program obfuscation via local mixing. In: Boyle, E., Mahmoody, M. (eds) Theory of Cryptography. TCC 2024. LNCS, vol. 15367, pp. 37\u201370. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_2","DOI":"10.1007\/978-3-031-78023-3_2"},{"key":"1_CR24","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":"1_CR25","unstructured":"Cheon, J.H., Lee, C., Ryu, H.: Cryptanalysis of the new CLT multilinear maps. Cryptology ePrint Archive, Report 2015\/934 (2015). https:\/\/eprint.iacr.org\/2015\/934"},{"key":"1_CR26","doi-asserted-by":"publisher","unstructured":"Cohen, A., Holmgren, J., Nishimaki, R., Vaikuntanathan, V., Wichs, D.: Watermarking cryptographic capabilities. In: Wichs, D., Mansour, Y. (eds.) 48th ACM STOC, pp. 1115\u20131127. ACM Press, June 2016. https:\/\/doi.org\/10.1145\/2897518.2897651","DOI":"10.1145\/2897518.2897651"},{"key":"1_CR27","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":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-40041-4_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J-S Coron","year":"2013","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 476\u2013493. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_26"},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-662-47989-6_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"J-S Coron","year":"2015","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: New multilinear maps over the integers. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 267\u2013286. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_13"},{"key":"1_CR30","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":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-030-05378-9_18","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2018","author":"N D\u00f6ttling","year":"2018","unstructured":"D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Mukherjee, P.: Obfuscation from low noise multilinear maps. In: Chakraborty, D., Iwata, T. (eds.) INDOCRYPT 2018. LNCS, vol. 11356, pp. 329\u2013352. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-05378-9_18"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38348-9_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"S Garg","year":"2013","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"},{"key":"1_CR33","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":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/978-3-662-53008-5_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"S Garg","year":"2016","unstructured":"Garg, S., Pandey, O., Srinivasan, A.: Revisiting the cryptographic hardness of finding a Nash equilibrium. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 579\u2013604. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_20"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-030-77883-5_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"R Gay","year":"2021","unstructured":"Gay, R., Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from simple-to-state hard problems: new assumptions, new techniques, and simplification. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 97\u2013126. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_4"},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Gay, R., Pass, R.: Indistinguishability obfuscation from circular security. In: Khuller, S., Williams, V.V. (eds.) 53rd ACM STOC, pp. 736\u2013749. ACM Press, June 2021. https:\/\/doi.org\/10.1145\/3406325.3451070","DOI":"10.1145\/3406325.3451070"},{"key":"1_CR37","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, May\/June 2009. https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-662-46497-7_20","volume-title":"Theory of Cryptography","author":"C Gentry","year":"2015","unstructured":"Gentry, C., Gorbunov, S., Halevi, S.: Graph-induced multilinear maps from lattices. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 498\u2013527. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_20"},{"key":"1_CR39","unstructured":"Gentry, C., Jutla, C.S., Kane, D.: Obfuscation using tensor products. Cryptology ePrint Archive, Report 2018\/756 (2018). https:\/\/eprint.iacr.org\/2018\/756"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","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. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/978-3-642-55220-5_32","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Goldwasser","year":"2014","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"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-85174-5_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"S Goldwasser","year":"2008","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: One-time programs. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 39\u201356. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_3"},{"key":"1_CR43","doi-asserted-by":"publisher","unstructured":"Goyal, R., Koppula, V., Waters, B.: Lockable obfuscation. In: Umans, C. (ed.) 58th FOCS, pp. 612\u2013621. IEEE Computer Society Press (Oct 2017). https:\/\/doi.org\/10.1109\/FOCS.2017.62","DOI":"10.1109\/FOCS.2017.62"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-319-56614-6_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"R Goyal","year":"2017","unstructured":"Goyal, R., Koppula, V., Waters, B.: Separating semantic and circular security for symmetric-key bit encryption from the learning with errors assumption. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 528\u2013557. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_18"},{"key":"1_CR45","unstructured":"Halevi, S.: Graded encoding, variations on a scheme. Cryptology ePrint Archive, Report 2015\/866 (2015). https:\/\/eprint.iacr.org\/2015\/866"},{"key":"1_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/978-3-662-53890-6_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"D Hofheinz","year":"2016","unstructured":"Hofheinz, D., Jager, T., Khurana, D., Sahai, A., Waters, B., Zhandry, M.: How to generate and use universal samplers. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 715\u2013744. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53890-6_24"},{"key":"1_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"494","DOI":"10.1007\/978-3-642-40041-4_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Hohenberger","year":"2013","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 494\u2013512. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_27"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-030-84245-1_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"S Hopkins","year":"2021","unstructured":"Hopkins, S., Jain, A., Lin, H.: Counterexamples to new circular security assumptions underlying iO. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 673\u2013700. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_23"},{"key":"1_CR49","unstructured":"Hsieh, Y., Jain, A., Lin, H.: Lattice-based post-quantum iO from circular security with random opening assumption (part II: zeroizing attacks against private-coin evasive LWE assumptions). Cryptology ePrint Archive, Paper 2025\/390 (2025). https:\/\/eprint.iacr.org\/2025\/390"},{"key":"1_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-662-49890-3_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"Y Hu","year":"2016","unstructured":"Hu, Y., Jia, H.: Cryptanalysis of GGH map. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 537\u2013565. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_21"},{"key":"1_CR51","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Lou, P., Sahai, A.: Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum $$i\\cal{O}$$. In: Hazay, C., Stam, M. (eds.) EUROCRYPT\u00a02023. LNCS, vol. 14004, pp. 205\u2013235. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_8","DOI":"10.1007\/978-3-031-30545-0_8"},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-17653-2_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Jain","year":"2019","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. LNCS, vol. 11476, pp. 251\u2013281. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_9"},{"key":"1_CR53","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) 53rd ACM STOC, pp. 60\u201373. ACM Press, June 2021. https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"1_CR54","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F}_p$$, DLIN, and PRGs in $${NC}^0$$. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022. 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":"1_CR55","doi-asserted-by":"publisher","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for Turing machines with unbounded memory. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 419\u2013428. ACM Press, June 2015. https:\/\/doi.org\/10.1145\/2746539.2746614","DOI":"10.1145\/2746539.2746614"},{"key":"1_CR56","doi-asserted-by":"publisher","unstructured":"Lin, H.: Indistinguishability obfuscation from constant-degree graded encoding schemes. In: Fischlin, M., Coron, J.S. (eds.) EUROCRYPT\u00a02016. LNCS, vol.\u00a09665, pp. 28\u201357 (May 2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_2","DOI":"10.1007\/978-3-662-49890-3_2"},{"key":"1_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-319-63688-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"H Lin","year":"2017","unstructured":"Lin, H.: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 599\u2013629. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_20"},{"key":"1_CR58","unstructured":"Lin, H., Matt, C.: Pseudo flawed-smudging generators and their application to indistinguishability obfuscation. Cryptology ePrint Archive, Report 2018\/646 (2018). https:\/\/eprint.iacr.org\/2018\/646"},{"key":"1_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-662-49387-8_17","volume-title":"Public-Key Cryptography \u2013 PKC 2016","author":"H Lin","year":"2016","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. LNCS, vol. 9615, pp. 447\u2013462. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49387-8_17"},{"key":"1_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-319-63688-7_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"H Lin","year":"2017","unstructured":"Lin, H., Tessaro, S.: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 630\u2013660. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_21"},{"key":"1_CR61","doi-asserted-by":"publisher","unstructured":"Lin, H., Vaikuntanathan, V.: Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings. In: Dinur, I. (ed.) 57th FOCS, pp. 11\u201320. IEEE Computer Society Press, October 2016. https:\/\/doi.org\/10.1109\/FOCS.2016.11","DOI":"10.1109\/FOCS.2016.11"},{"key":"1_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","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). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"1_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-662-53008-5_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"E Miles","year":"2016","unstructured":"Miles, E., Sahai, A., Zhandry, M.: Annihilation attacks for multilinear maps: cryptanalysis of indistinguishability obfuscation over GGH13. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 629\u2013658. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_22"},{"key":"1_CR64","unstructured":"Minaud, B., Fouque, P.A.: Cryptanalysis of the new multilinear map over the integers. Cryptology ePrint Archive, Report 2015\/941 (2015). https:\/\/eprint.iacr.org\/2015\/941"},{"key":"1_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-662-44371-2_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"R Pass","year":"2014","unstructured":"Pass, R., Seth, K., Telang, S.: Indistinguishability obfuscation from semantically-secure multilinear encodings. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 500\u2013517. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_28"},{"key":"1_CR66","doi-asserted-by":"publisher","unstructured":"Ragavan, S., Vafa, N., Vaikuntanathan, V.: Indistinguishability obfuscation from bilinear maps and LPN variants. In: Boyle, E., Mahmoody, M. (eds) Theory of Cryptography. TCC 2024. LNCS, vol. 15367, pp. 3\u201336. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-78023-3_1","DOI":"10.1007\/978-3-031-78023-3_1"},{"key":"1_CR67","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":"1_CR68","doi-asserted-by":"publisher","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022. LNCS, vol. 13507, pp. 535\u2013559. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_19","DOI":"10.1007\/978-3-031-15802-5_19"},{"key":"1_CR69","doi-asserted-by":"publisher","unstructured":"Vaikuntanathan, V., Wee, H., Wichs, D.: Witness encryption and null-IO from evasive LWE. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT\u00a02022. LNCS, vol. 13791, pp. 195\u2013221. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_7","DOI":"10.1007\/978-3-031-22963-3_7"},{"key":"1_CR70","doi-asserted-by":"publisher","unstructured":"Wee, H.: Optimal broadcast encryption and CP-ABE from evasive lattice assumptions. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT\u00a02022. LNCS, vol. 13276, pp. 217\u2013241. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_8","DOI":"10.1007\/978-3-031-07085-3_8"},{"key":"1_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-77883-5_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"H Wee","year":"2021","unstructured":"Wee, H., Wichs, D.: Candidate obfuscation via oblivious LWE sampling. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 127\u2013156. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_5"},{"key":"1_CR72","doi-asserted-by":"publisher","unstructured":"Wichs, D., Zirdelis, G.: Obfuscating compute-and-compare programs under LWE. In: Umans, C. (ed.) 58th FOCS, pp. 600\u2013611. IEEE Computer Society Press, October 2017. https:\/\/doi.org\/10.1109\/FOCS.2017.61","DOI":"10.1109\/FOCS.2017.61"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01907-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:30Z","timestamp":1755383250000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}