{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:59:15Z","timestamp":1781078355952,"version":"3.54.1"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031780226","type":"print"},{"value":"9783031780233","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T00:00:00Z","timestamp":1733184000000},"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-031-78023-3_1","type":"book-chapter","created":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T10:50:54Z","timestamp":1733136654000},"page":"3-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Indistinguishability Obfuscation from\u00a0Bilinear Maps and\u00a0LPN Variants"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9628-2258","authenticated-orcid":false,"given":"Seyoon","family":"Ragavan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0555-4200","authenticated-orcid":false,"given":"Neekon","family":"Vafa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2666-0045","authenticated-orcid":false,"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,3]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-030-36030-6_9","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2019","unstructured":"Ananth, P., Badrinarayanan, S., Jain, A., Manohar, N., Sahai, A.: From FE combiners to secure MPC and back. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 199\u2013228. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_9"},{"key":"1_CR2","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":"1_CR3","doi-asserted-by":"crossref","unstructured":"Applebaum, B., Barak, B., Wigderson, A.: Public-key cryptography from different assumptions. In: Schulman, L.J. (edr.) Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010, pp. 171\u2013180. ACM (2010)","DOI":"10.1145\/1806689.1806715"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-319-63688-7_8","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"B Applebaum","year":"2017","unstructured":"Applebaum, B., Damg\u00e5rd, I., Ishai, Y., Nielsen, M., Zichron, L.: Secure arithmetic computation with constant computational overhead. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 223\u2013254. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_8"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00037-007-0237-6","volume":"17","author":"B Applebaum","year":"2008","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: On pseudorandom generators with linear stretch in NC$$ ^{\\text{0 }}$$. Comput. Complex. 17(1), 38\u201369 (2008)","journal-title":"Comput. Complex."},{"key":"1_CR6","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"},{"issue":"6","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1137\/22M1484134","volume":"52","author":"B Applebaum","year":"2023","unstructured":"Applebaum, B., Kachlon, E.: Sampling graphs without forbidden subgraphs and unbalanced expanders with negligible error. SIAM J. Comput. 52(6), 1321\u20131368 (2023)","journal-title":"SIAM J. Comput."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Koml\u00f3s, J., Szemer\u00e9di, E.: An o(n log n) sorting network. In: Johnson, D.S., et al. (eds.) Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April 1983, Boston, Massachusetts, USA, pp. 1\u20139. ACM (1983)","DOI":"10.1145\/800061.808726"},{"key":"1_CR9","unstructured":"Abbot, T., Kane, D., Valiant, P.: On algorithms for Nash equilibria. Unpublished manuscript, pp.\u00a01 (2004)"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/16M1085942","volume":"47","author":"B Applebaum","year":"2018","unstructured":"Applebaum, B., Lovett, S.: Algebraic attacks against random local functions and their countermeasures. SIAM J. Comput. 47(1), 52\u201379 (2018)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR11","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s00037-011-0029-x","volume":"20","author":"M Alekhnovich","year":"2011","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. Comput. Complex. 20(4), 755\u2013786 (2011)","journal-title":"Comput. Complex."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Allen, S.R., O\u2019Donnell, R., Witmer, D.: How to refute a random CSP. In: Guruswami, V. (ed.) IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17-20 October 2015, pp. 689\u2013708. IEEE Computer Society (2015)","DOI":"10.1109\/FOCS.2015.48"},{"key":"1_CR13","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":"1_CR14","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15-19 October 2018, pp. 896\u2013912. ACM (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"1_CR15","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"},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00145-019-09337-9","volume":"33","author":"N Bitansky","year":"2020","unstructured":"Bitansky, N., Nishimaki, R., Passelegue, A., Wichs, D.: From Cryptomania to Obfustopia through secret-key functional encryption. J. Cryptol. 33(2), 357\u2013405 (2020)","journal-title":"J. Cryptol."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O., Rosen, A.: On the cryptographic hardness of finding a Nash equilibrium. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 1480\u20131498. IEEE (2015)","DOI":"10.1109\/FOCS.2015.94"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Vaikuntanathan, V.: Indistinguishability obfuscation from functional encryption. J. ACM 65(6), 39:1\u201339:37 (2018)","DOI":"10.1145\/3234511"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 480\u2013499. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_27"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-662-47989-6_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"K-M Chung","year":"2015","unstructured":"Chung, K.-M., Lin, H., Pass, R.: Constant-round concurrent zero-knowledge from indistinguishability obfuscation. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 287\u2013307. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_14"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/978-3-662-46497-7_19","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2015","unstructured":"Canetti, R., Lin, H., Tessaro, S., Vaikuntanathan, V.: Obfuscation of probabilistic circuits and applications. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 468\u2013497. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_19"},{"key":"1_CR22","unstructured":"Cryan, M., Miltersen, P.B.: On pseudorandom generators in NC. In: Sgall, J., Pultr, A., Kolman, P. (eds.) Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, 27-31 August 2001, Proceedings, LNCS, vol. 2136, pp. 272\u2013284. Springer, Heidelberg (2001)"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/978-3-030-56784-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2020","author":"R Canetti","year":"2020","unstructured":"Canetti, R., Park, S., Poburinnaya, O.: Fully deniable interactive encryption. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12170, pp. 807\u2013835. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_27"},{"key":"1_CR24","doi-asserted-by":"publisher","unstructured":"Dao, Q., Ishai, Y., Jain, A., Lin, H.: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN. In: Handschuh, H., Lysyanskaya, A. (eds.) Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, 20-24 August 2023, Proceedings, Part II, LNCS, vol. 14082, pp. 315\u2013348. Springer, Switzerland (2023). https:\/\/doi.org\/10.1007\/978-3-031-38545-2_11","DOI":"10.1007\/978-3-031-38545-2_11"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Dao, Q., Jain, A.: Lossy cryptography from code-based assumptions. IACR Cryptol. ePrint Arch., pp. 175 (2024)","DOI":"10.1007\/978-3-031-68382-4_2"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Feige, U.: Relations between average case complexity and approximation complexity. In: Reif, J.H. (ed.) Proceedings on 34th Annual ACM Symposium on Theory of Computing, 19-21 May 2002, Montr\u00e9al, Qu\u00e9bec, Canada, pages 534\u2013543. ACM (2002)","DOI":"10.1145\/509907.509985"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pp. 40\u201349. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"1_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-03807-6_5","volume-title":"Theory of Cryptography","author":"S Garg","year":"2018","unstructured":"Garg, S., Ishai, Y., Srinivasan, A.: Two-round MPC: information-theoretic and black-box. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11239, pp. 123\u2013151. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_5"},{"key":"1_CR29","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_CR30","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y., Popa, R.A., Vaikuntanathan, V. and Zeldovich, N.: Reusable garbled circuits and succinct functional encryption. In: Boneh, D., Roughgarden, T., Feigenbaum, J., (eds.) Symposium on Theory of Computing Conference, STOC 2013, Palo Alto, CA, USA, 1-4 June 2013, pp. 555\u2013564. ACM (2013)","DOI":"10.1145\/2488608.2488678"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"1_CR32","unstructured":"Goldreich, O.: Candidate one-way functions based on expander graphs. IACR Cryptol. ePrint Arch., p.\u00a063 (2000)"},{"key":"1_CR33","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_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-662-53644-5_16","volume-title":"Theory of Cryptography","author":"S Garg","year":"2016","unstructured":"Garg, S., Srinivasan, A.: Single-key to multi-key functional encryption with polynomial loss. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 419\u2013442. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_16"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Garg, S., Srinivasan, A.: Two-round multiparty secure computation from minimal assumptions. J. ACM, 69(5), 36:1\u201336:30 (2022)","DOI":"10.1145\/3566048"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-662-48000-7_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"S Gorbunov","year":"2015","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Predicate encryption for circuits from LWE. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 503\u2013523. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_25"},{"issue":"6","key":"1_CR37","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1137\/17M1118014","volume":"49","author":"P Hub\u00e1cek","year":"2020","unstructured":"Hub\u00e1cek, P., Yogev, E.: Hardness of continuous local search: query complexity and cryptographic lower bounds. SIAM J. Comput. 49(6), 1128\u20131172 (2020)","journal-title":"SIAM J. Comput."},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Cryptography with constant computational overhead. In: Dwork, C. (ed.) Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, 17-20 May 2008, pp. 433\u2013442. ACM (2008)","DOI":"10.1145\/1374376.1374438"},{"key":"1_CR39","unstructured":"Jain, A., Lin, H., Sahai, A.: Simplifying constructions and assumptions for IO. IACR Cryptol. ePrint Arch., p. 1252 (2019)"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pp. 60\u201373, New York, NY, USA (2021). Association for Computing Machinery","DOI":"10.1145\/3406325.3451093"},{"key":"1_CR41","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H.,D Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F}_p$$, dlin, and prgs in nc$$ ^{\\text{0 }}$$. In: Dunkelman, O., Dziembowski, S. (eds.) Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30 - June 3, 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":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-030-45721-1_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Jain","year":"2020","unstructured":"Jain, A., Manohar, N., Sahai, A.: Combiners for functional encryption, unconditionally. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 141\u2013168. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_6"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"Kothari, P.K., Mori, R., O\u2019Donnell, R., Witmer, D.: Sum of squares lower bounds for refuting any CSP. In: Hatami, H., McKenzie, P., King, V. (edis.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19-23 June 2017, pp. 132\u2013145. ACM (2017)","DOI":"10.1145\/3055399.3055485"},{"key":"1_CR44","unstructured":"Kitagawa, F., Nishimaki, R., Tanaka, K.: Indistinguishability obfuscation for all circuits from secret-key functional encryption. IACR Cryptol. ePrint Arch., p. 361 (2017)"},{"issue":"3","key":"1_CR45","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00145-022-09429-z","volume":"35","author":"F Kitagawa","year":"2022","unstructured":"Kitagawa, F., Nishimaki, R., Tanaka, K.: Obfustopia built on secret-key functional encryption. J. Cryptol. 35(3), 19 (2022)","journal-title":"J. Cryptol."},{"key":"1_CR46","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"},{"issue":"2","key":"1_CR47","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/s00145-015-9226-0","volume":"30","author":"I Komargodski","year":"2017","unstructured":"Komargodski, I., Naor, M., Yogev, E.: Secret-sharing for NP. J. Cryptol. 30(2), 444\u2013469 (2017)","journal-title":"J. Cryptol."},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-662-48797-6_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"D Khurana","year":"2015","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. LNCS, vol. 9452, pp. 52\u201375. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_3"},{"key":"1_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-319-56620-7_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"I Komargodski","year":"2017","unstructured":"Komargodski, I., Segev, G.: From Minicrypt to Obfustopia via private-key functional encryption. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10210, pp. 122\u2013151. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56620-7_5"},{"key":"1_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-662-53644-5_17","volume-title":"Theory of Cryptography","author":"B Li","year":"2016","unstructured":"Li, B., Micciancio, D.: Compactness vs collusion resistance in functional encryption. In: Hirt, M., Smith, A. (eds.) TCC 2016. LNCS, vol. 9986, pp. 443\u2013468. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_17"},{"key":"1_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-662-49096-9_5","volume-title":"Theory of Cryptography","author":"H Lin","year":"2016","unstructured":"Lin, H., Pass, R., Seth, K., Telang, S.: Output-compressing randomized encodings and applications. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 96\u2013124. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_5"},{"issue":"1","key":"1_CR52","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/rsa.20112","volume":"29","author":"E Mossel","year":"2006","unstructured":"Mossel, E., Shpilka, A., Trevisan, L.: On epsilon-biased generators in nc$$ ^{\\text{0 }}$$. Random Struct. Algorithms 29(1), 56\u201381 (2006)","journal-title":"Random Struct. Algorithms"},{"key":"1_CR53","unstructured":"O\u2019Donnell, R.: Analysis of Boolean Functions. Cambridge University Press (2014)"},{"issue":"2","key":"1_CR54","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/322123.322138","volume":"26","author":"N Pippenger","year":"1979","unstructured":"Pippenger, N., Fischer, M.J.: Relations among complexity measures. J. ACM 26(2), 361\u2013381 (1979)","journal-title":"J. ACM"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"Ragavan, S., Vafa, N., Vaikuntanathan, V.: Indistinguishability obfuscation from bilinear maps and LPN variants. IACR Cryptol. ePrint Arch., pp. 856 (2024)","DOI":"10.1007\/978-3-031-78023-3_1"},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed) Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31 - June 03, 2014, pp. 475\u2013484. ACM (2014)","DOI":"10.1145\/2591796.2591825"},{"key":"1_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-030-64375-1_8","volume-title":"Theory of Cryptography","author":"H Wee","year":"2020","unstructured":"Wee, H.: Functional encryption for quadratic functions from k-lin, revisited. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12550, pp. 210\u2013228. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_8"},{"key":"1_CR58","doi-asserted-by":"crossref","unstructured":"Waters, B., Wu, D.J.: Adaptively-sound succinct arguments for NP from indistinguishability obfuscation. IACR Cryptol. ePrint Arch., pp. 165 (2024)","DOI":"10.1145\/3618260.3649671"},{"key":"1_CR59","unstructured":"Waters, B., Wu, D.J.: A pure indistinguishability obfuscation approach to adaptively-sound SNARGs for NP. IACR Cryptol. ePrint Arch., pp. 933 (2024)"},{"key":"1_CR60","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: How to generate and exchange secrets (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, 27-29 October 1986, pp. 162\u2013167. IEEE Computer Society (1986)","DOI":"10.1109\/SFCS.1986.25"}],"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-031-78023-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T14:09:58Z","timestamp":1733148598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78023-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,3]]},"ISBN":["9783031780226","9783031780233"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78023-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,3]]},"assertion":[{"value":"3 December 2024","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":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}