{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:33:09Z","timestamp":1764621189043,"version":"3.46.0"},"publisher-location":"Cham","reference-count":69,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032122926","type":"print"},{"value":"9783032122933","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T00:00:00Z","timestamp":1764633600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-12293-3_8","type":"book-chapter","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:14Z","timestamp":1764620894000},"page":"222-258","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pseudorandom FE, iO and Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7692-4686","authenticated-orcid":false,"given":"Shweta","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2810-4407","authenticated-orcid":false,"given":"Simran","family":"Kumari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7338-686X","authenticated-orcid":false,"given":"Shota","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Lou, P., Sahai, A.: Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum iO. In: Eurocrypt (2023)","DOI":"10.1007\/978-3-031-30545-0_8"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S.: Indistinguishability obfuscation without multilinear maps: new techniques for bootstrapping and instantiation. In: Eurocrypt (2019)","DOI":"10.1007\/978-3-030-17653-2_7"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Kumari, S., Yadav, A., Yamada, S.: Broadcast, trace and revoke with optimal parameters from polynomial hardness. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 605\u2013636. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30620-4_20"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Kumari, S., Yamada, S.: Attribute based encryption for turing machines from lattices. In: Crypto (2024)","DOI":"10.1007\/978-3-031-68382-4_11"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-030-03810-6_18","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2018","unstructured":"Agrawal, S., Maitra, M.: FE and iO for turing machines from minimal assumptions. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 473\u2013512. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_18"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/978-3-030-26951-7_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S., Maitra, M., Yamada, S.: Attribute based encryption (and more) for nondeterministic finite automata from LWE. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 765\u2013797. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_26"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-030-36033-7_4","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S., Maitra, M., Yamada, S.: Attribute based encryption for deterministic finite automata from $${\\sf DLIN}$$. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11892, pp. 91\u2013117. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36033-7_4"},{"key":"8_CR8","unstructured":"Agrawal, S., Modi, A., Yadav, A., Yamada, S.: Evasive LWE: attacks, variants & obfustopia (2025)"},{"key":"8_CR9","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":"8_CR10","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Rossi, M., Yadav, A., Yamada, S.: Constant input attribute based (and predicate) encryption from evasive and tensor LWE. In: CRYPTO\u00a02023, Part\u00a0IV. pp. 532\u2013564. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_17","DOI":"10.1007\/978-3-031-38551-3_17"},{"key":"8_CR11","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Yadav, A., Yamada, S.: Multi-input attribute based encryption and predicate encryption. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 590\u2013621. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_21","DOI":"10.1007\/978-3-031-15802-5_21"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-030-64375-1_5","volume-title":"Theory of Cryptography","author":"S Agrawal","year":"2020","unstructured":"Agrawal, S., Yamada, S.: CP-ABE for circuits (and more) in the symmetric key setting. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 117\u2013148. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_5"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/978-3-662-48000-7_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Ananth","year":"2015","unstructured":"Ananth, P., Brakerski, Z., Segev, G., Vaikuntanathan, V.: From selective to adaptive security in functional encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 657\u2013677. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_32"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-662-47989-6_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"P Ananth","year":"2015","unstructured":"Ananth, P., Jain, A.: Indistinguishability obfuscation from compact functional encryption. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 308\u2013326. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_15"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-662-49096-9_6","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2016","unstructured":"Ananth, P., Sahai, A.: Functional encryption for turing machines. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 125\u2013153. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_6"},{"key":"8_CR16","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., 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"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Proceedings of the 1st ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. J. ACM 65(6), 39:1\u201339:37 (2018). https:\/\/doi.org\/10.1145\/3234511","DOI":"10.1145\/3234511"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-642-55220-5_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., et al.: Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 533\u2013556. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_30"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 514\u2013532. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_30"},{"key":"8_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 253\u2013273. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_16"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-319-78381-9_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"Z Brakerski","year":"2018","unstructured":"Brakerski, Z., Lombardi, A., Segev, G., Vaikuntanathan, V.: Anonymous IBE, leakage resilience and circular security from new assumptions. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 535\u2013564. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_20"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-70500-2_10","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2017","unstructured":"Brakerski, Z., Tsabary, R., Vaikuntanathan, V., Wee, H.: Private constrained PRFs (and more) from LWE. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017. LNCS, vol. 10677, pp. 264\u2013302. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70500-2_10"},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"Branco, P., et al.: Pseudorandom obfuscation and applications. In: CRYPTO (2025), available from https:\/\/eprint.iacr.org\/2024\/1742","DOI":"10.1007\/978-3-032-01901-1_21"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Brzuska, C., \u00dcnal, A., Woo, I.K.: Evasive LWE assumptions: definitions, classes, and counterexamples. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 418\u2013449. Springer, Cham (2024)","DOI":"10.1007\/978-981-96-0894-2_14"},{"issue":"4","key":"8_CR26","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4), 557\u2013594 (2004). https:\/\/doi.org\/10.1145\/1008731.1008734","journal-title":"J. ACM"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-11799-2_5","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2010","unstructured":"Canetti, R., Rothblum, G.N., Varia, M.: Obfuscation of hyperplane membership. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 72\u201389. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_5"},{"key":"8_CR28","doi-asserted-by":"crossref","unstructured":"Champion, J., Wu, D.J.: Distributed broadcast encryption from lattices. In: Theory of Cryptography Conference, pp. 156\u2013189. Springer, Cham (2024)","DOI":"10.1007\/978-3-031-78020-2_6"},{"key":"8_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-91131-6_4","volume-title":"Faster ABE for Turing Machines from Circular Evasive LWE","author":"V Cini","year":"2025","unstructured":"Cini, V., Wee, H.: Faster ABE for Turing Machines from Circular Evasive LWE. Springer, Cham (2025)"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"J-S Coron","year":"2000","unstructured":"Coron, J.-S.: On the exact security of full domain hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 229\u2013235. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_14"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-40084-1_29","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"A De Caro","year":"2013","unstructured":"De Caro, A., Iovino, V., Jain, A., O\u2019Neill, A., Paneth, O., Persiano, G.: On the achievability of simulation-based security for functional encryption. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 519\u2013535. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_29"},{"key":"8_CR32","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_CR33","doi-asserted-by":"crossref","unstructured":"D\u00f6ttling, N., Jain, A., Malavolta, G., Mathialagan, S., Vaikuntanathan, V.: Simple and general counterexamples for private-coin evasive LWE. In: CRYPTO (2025). https:\/\/eprint.iacr.org\/2025\/374","DOI":"10.1007\/978-3-032-01907-3_3"},{"issue":"3","key":"8_CR34","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/s00145-024-09504-7","volume":"37","author":"D Francati","year":"2024","unstructured":"Francati, D., Friolo, D., Malavolta, G., Venturi, D.: Multi-key and multi-input predicate encryption (for conjunctions) from learning with errors. J. Cryptol. 37(3), 24 (2024)","journal-title":"J. Cryptol."},{"issue":"3","key":"8_CR35","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882\u2013929 (2016)","journal-title":"SIAM J. Comput."},{"key":"8_CR36","doi-asserted-by":"crossref","unstructured":"Garg, S., Pandey, O., Srinivasan, A., Zhandry, M.: Breaking the sub-exponential barrier in obfustopia. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 156\u2013181. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-56617-7_6"},{"key":"8_CR37","doi-asserted-by":"crossref","unstructured":"Gay, R., Pass, R.: Indistinguishability obfuscation from circular security. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 736\u2013749 (2021)","DOI":"10.1145\/3406325.3451070"},{"key":"8_CR38","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"8_CR39","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":"8_CR40","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":"8_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-40084-1_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"S Goldwasser","year":"2013","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: How to run turing machines on encrypted data. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 536\u2013553. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_30"},{"key":"8_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"732","DOI":"10.1007\/978-3-030-26951-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"J Gong","year":"2019","unstructured":"Gong, J., Waters, B., Wee, H.: ABE for DFA from k-Lin. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 732\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_25"},{"key":"8_CR43","doi-asserted-by":"crossref","unstructured":"Gong, J., Wee, H.: Adaptively secure ABE for DFA from k-lin and more. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 278\u2013308. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-45727-3_10"},{"key":"8_CR44","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Attribute-based encryption for circuits. In: STOC (2013)","DOI":"10.1145\/2488608.2488677"},{"key":"8_CR45","doi-asserted-by":"crossref","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wichs, D.: Leveled fully homomorphic signatures from standard lattices. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 469\u2013477 (2015)","DOI":"10.1145\/2746539.2746576"},{"key":"8_CR46","doi-asserted-by":"publisher","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM CCS 2006, pp. 89\u201398. ACM Press (2006). https:\/\/doi.org\/10.1145\/1180405.1180418, available as Cryptology ePrint Archive Report 2006\/309","DOI":"10.1145\/1180405.1180418"},{"key":"8_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-55220-5_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"S Hohenberger","year":"2014","unstructured":"Hohenberger, S., Sahai, A., Waters, B.: Replacing a random oracle: full domain hash from indistinguishability obfuscation. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 201\u2013220. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-55220-5_12"},{"key":"8_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":"8_CR49","doi-asserted-by":"crossref","unstructured":"Hsieh, Y.C., 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 (2025)","DOI":"10.1007\/978-3-032-01907-3_1"},{"key":"8_CR50","doi-asserted-by":"crossref","unstructured":"Hsieh, Y.C., Lin, H., Luo, J.: Attribute-based encryption for circuits of unbounded depth from lattices. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 415\u2013434. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00031"},{"key":"8_CR51","unstructured":"Huang, T.H., Hung, W.H., Yamada, S.: A note on obfuscation-based attacks on private-coin evasive LWE. Cryptology ePrint Archive, Paper 2025\/421 (2025). https:\/\/eprint.iacr.org\/2025\/421"},{"key":"8_CR52","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Luo, J.: On the optimal succinctness and efficiency of functional encryption and attribute-based encryption. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 479\u2013510. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-30620-4_16"},{"key":"8_CR53","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Matt, C., Sahai, A.: How to leverage hardness of constant-degree expanding polynomials over R to build iO. In: EUROCRYPT (2019)","DOI":"10.1007\/978-3-030-17653-2_9"},{"key":"8_CR54","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 (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"8_CR55","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, Part\u00a0I. LNCS, vol. 13275, pp. 670\u2013699. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_23","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"8_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-78967-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J Katz","year":"2008","unstructured":"Katz, J., Sahai, A., Waters, B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 146\u2013162. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_9"},{"key":"8_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-030-26954-8_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"F Kitagawa","year":"2019","unstructured":"Kitagawa, F., Nishimaki, R., Tanaka, K., Yamakawa, T.: Adaptively secure and succinct functional encryption: improving security and efficiency, simultaneously. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 521\u2013551. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_17"},{"key":"8_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-45727-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"H Lin","year":"2020","unstructured":"Lin, H., Luo, J.: Compact adaptively secure ABE from k-Lin: beyond $${\\sf NC}^1$$ and towards $${\\sf NL}$$. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12107, pp. 247\u2013277. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45727-3_9"},{"key":"8_CR59","doi-asserted-by":"crossref","unstructured":"Quach, W., Wee, H., Wichs, D.: Laconic function evaluation and applications. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 859\u2013870. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00086"},{"key":"8_CR60","doi-asserted-by":"crossref","unstructured":"Ragavan, S., Vafa, N., Vaikuntanathan, V.: Indistinguishability obfuscation from bilinear maps and LPN variants. Cryptology ePrint Archive (2024)","DOI":"10.1007\/978-3-031-78023-3_1"},{"key":"8_CR61","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: EUROCRYPT (2005)","DOI":"10.1007\/11426639_27"},{"key":"8_CR62","doi-asserted-by":"publisher","unstructured":"Tsabary, R.: Candidate witness encryption from lattice techniques. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO\u00a02022, Part\u00a0I. LNCS, vol. 13507, pp. 535\u2013559. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_19","DOI":"10.1007\/978-3-031-15802-5_19"},{"key":"8_CR63","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, Part\u00a0I. LNCS, vol. 13791, pp. 195\u2013221. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_7","DOI":"10.1007\/978-3-031-22963-3_7"},{"key":"8_CR64","doi-asserted-by":"crossref","unstructured":"Waters, B.: Functional encryption for regular languages. In: Annual Cryptology Conference, pp. 218\u2013235. Springer, Cham (2012)","DOI":"10.1007\/978-3-642-32009-5_14"},{"key":"8_CR65","doi-asserted-by":"publisher","unstructured":"Wee, H.: On obfuscating point functions. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 523\u2013532. ACM Press (2005). https:\/\/doi.org\/10.1145\/1060590.1060669","DOI":"10.1145\/1060590.1060669"},{"key":"8_CR66","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, Part\u00a0II. LNCS, vol. 13276, pp. 217\u2013241. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_8","DOI":"10.1007\/978-3-031-07085-3_8"},{"key":"8_CR67","doi-asserted-by":"publisher","unstructured":"Wee, H.: Circuit ABE with poly(depth,$$\\lambda $$)-sized ciphertexts and keys from lattices. In: Advances in Cryptology \u2013 CRYPTO 2024: 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18\u201322 August 2024, Proceedings, Part III, pp. 178\u2013209. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68382-4_6","DOI":"10.1007\/978-3-031-68382-4_6"},{"key":"8_CR68","doi-asserted-by":"crossref","unstructured":"Wee, H.: Almost optimal KP and CP-ABE for circuits from succinct LWE. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 34\u201362. Springer, Cham (2025)","DOI":"10.1007\/978-3-031-91131-6_2"},{"key":"8_CR69","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"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-12293-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:18Z","timestamp":1764620898000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12293-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"ISBN":["9783032122926","9783032122933"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12293-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,2]]},"assertion":[{"value":"2 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","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":"1 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}