{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T11:10:25Z","timestamp":1727349025452},"reference-count":91,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:00:00Z","timestamp":1654214400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00145-022-09429-z","type":"journal-article","created":{"date-parts":[[2022,6,3]],"date-time":"2022-06-03T00:12:20Z","timestamp":1654215140000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Obfustopia Built on Secret-Key Functional Encryption"],"prefix":"10.1007","volume":"35","author":[{"given":"Fuyuki","family":"Kitagawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"Nishimaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,3]]},"reference":[{"issue":"2","key":"9429_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/s00145-021-09378-z","volume":"34","author":"B Applebaum","year":"2021","unstructured":"B. Applebaum, Z. Brakerski, Obfuscating circuits via composite-order graded encoding. J. Cryptol. 34(2), 14 (2021)","journal-title":"J. Cryptol."},{"key":"9429_CR2","doi-asserted-by":"crossref","unstructured":"P. Ananth, Z. Brakerski, G. Segev, V. Vaikuntanathan, From selective to adaptive security in functional encryption, in R. Gennaro, M.J.B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II, vol. 9216 of LNCS (Springer, Heidelberg, 2015), pp. 657\u2013677","DOI":"10.1007\/978-3-662-48000-7_32"},{"key":"9429_CR3","unstructured":"D. Apon, N. D\u00f6ttling, S. Garg, P. Mukherjee, Cryptanalysis of indistinguishability obfuscations of circuits over GGH13, in I. Chatzigiannakis, P. Indyk, F. Kuhn, A. Muscholl, editors, ICALP 2017, vol.\u00a080 of LIPIcs (Schloss Dagstuhl, 2017), pp. 38:1\u201338:16"},{"key":"9429_CR4","doi-asserted-by":"crossref","unstructured":"P.V. Ananth, D. Gupta, Y. Ishai, A. Sahai, Optimizing obfuscation: Avoiding Barrington\u2019s theorem, in G.-J. Ahn, M. Yung, N. Li, editors, ACM CCS 2014 (ACM Press, 2014), pp. 646\u2013658","DOI":"10.1145\/2660267.2660342"},{"key":"9429_CR5","doi-asserted-by":"crossref","unstructured":"S. Agrawal, Stronger security for reusable garbled circuits, general definitions and attacks, in J. Katz, H. Shacham, editors, CRYPTO\u00a02017, Part\u00a0I, vol. 10401 of LNCS (Springer, Heidelberg, 2017), pp. 3\u201335","DOI":"10.1007\/978-3-319-63688-7_1"},{"key":"9429_CR6","doi-asserted-by":"crossref","unstructured":"S. Agrawal, Indistinguishability obfuscation without multilinear maps: New methods for bootstrapping and instantiation, in Y. Ishai, V. Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0I, vol. 11476 of LNCS (Springer, Heidelberg, 2019), pp. 191\u2013225","DOI":"10.1007\/978-3-030-17653-2_7"},{"issue":"2","key":"9429_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00037-006-0211-8","volume":"15","author":"B Applebaum","year":"2006","unstructured":"B. Applebaum, Y. Ishai, E. Kushilevitz, Computationally private randomizing polynomials and their applications. Comput. Complex. 15(2), 115\u2013162 (2006)","journal-title":"Comput. Complex."},{"key":"9429_CR8","doi-asserted-by":"crossref","unstructured":"P. Ananth, A. Jain, Indistinguishability obfuscation from compact functional encryption, in R. Gennaro, M.J.B. Robshaw, editors, CRYPTO 2015, Part I, vol. 9215 of LNCS (Springer, Heidelberg, 2015), pp. 308\u2013326","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"9429_CR9","doi-asserted-by":"crossref","unstructured":"P. Ananth, A. Jain, H. Lin, C. Matt, A. Sahai, Indistinguishability obfuscation without multilinear maps: New paradigms via low degree weak pseudorandomness and security amplification, in A. Boldyreva, D. Micciancio, editors, CRYPTO\u00a02019, Part\u00a0III, vol. 11694 of LNCS (Springer, Heidelberg, 2019), pp. 284\u2013332","DOI":"10.1007\/978-3-030-26954-8_10"},{"key":"9429_CR10","unstructured":"P. Ananth, A. Jain, A. Sahai, Indistinguishability obfuscation from functional encryption for simple functions. Cryptology ePrint Archive, Report 2015\/730 (2015). https:\/\/eprint.iacr.org\/2015\/730"},{"key":"9429_CR11","unstructured":"P. Ananth, A. Jain, A. Sahai. 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":"9429_CR12","doi-asserted-by":"crossref","unstructured":"S. Agrawal, A. Rosen, Functional encryption for bounded collusions, revisited. in Y. Kalai, L. Reyzin, editors, TCC\u00a02017, Part\u00a0I, vol.\u00a010677 of LNCS (Springer, Heidelberg, 2017), pp. 173\u2013205.","DOI":"10.1007\/978-3-319-70500-2_7"},{"issue":"6","key":"9429_CR13","doi-asserted-by":"publisher","first-page":"2117","DOI":"10.1137\/15M1034064","volume":"45","author":"G Asharov","year":"2016","unstructured":"G. Asharov, G. Segev, Limits on the power of indistinguishability obfuscation and functional encryption. SIAM J. Comput. 45(6), 2117\u20132176 (2016)","journal-title":"SIAM J. Comput."},{"key":"9429_CR14","doi-asserted-by":"crossref","unstructured":"P. Ananth, A. Sahai, Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps, in J.-S. Coron, J.B. Nielsen, editors, EUROCRYPT\u00a02017, Part\u00a0I, vol. 10210 of LNCS (Springer, Heidelberg, 2017), pp. 152\u2013181","DOI":"10.1007\/978-3-319-56620-7_6"},{"key":"9429_CR15","doi-asserted-by":"crossref","unstructured":"P. Ananth, V. Vaikuntanathan, Optimal bounded-collusion secure functional encryption, in D. Hofheinz, A. Rosen, editors, TCC\u00a02019, Part\u00a0I, vol. 11891 of LNCS (Springer, Heidelberg, 2019), pp. 174\u2013198","DOI":"10.1007\/978-3-030-36030-6_8"},{"issue":"3","key":"9429_CR16","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1137\/15M1050963","volume":"47","author":"N Bitansky","year":"2018","unstructured":"N. Bitansky, R. Canetti, S. Garg, J. Holmgren, A. Jain, H. Lin, R. Pass, S. Telang, V. Vaikuntanathan, Indistinguishability obfuscation for RAM programs and succinct randomized encodings. SIAM J. Comput. 47(3), 1123\u20131210 (2018)","journal-title":"SIAM J. Comput."},{"key":"9429_CR17","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, N. D\u00f6ttling, S. Garg, G. Malavolta, Candidate iO from homomorphic encryption schemes, in Anne Canteaut, Yuval Ishai, editors, EUROCRYPT\u00a02020, Part\u00a0I, vol. 12105 of LNCS (Springer, Heidelberg, 2020), pp. 79\u2013109","DOI":"10.1007\/978-3-030-45721-1_4"},{"key":"9429_CR18","unstructured":"Z. Brakerski, N. D\u00f6ttling, S. Garg, G. Malavolta, Factoring and pairings are not necessary for iO: Circular-secure LWE suffices. Cryptology ePrint Archive, Report 2020\/1024 (2020). https:\/\/eprint.iacr.org\/2020\/1024"},{"key":"9429_CR19","doi-asserted-by":"crossref","unstructured":"B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S.P. Vadhan, K. Yang, On the (im)possibility of obfuscating programs. J. ACM 59(2), 6:1\u20136:48 (2012)","DOI":"10.1145\/2160158.2160159"},{"key":"9429_CR20","doi-asserted-by":"crossref","unstructured":"E. Boyle, S. Goldwasser, I. Ivan, Functional signatures and pseudorandom functions, in H. Krawczyk, editor, PKC\u00a02014, vol. 8383 of LNCS (Springer, Heidelberg, 2014), pp. 501\u2013519","DOI":"10.1007\/978-3-642-54631-0_29"},{"key":"9429_CR21","doi-asserted-by":"crossref","unstructured":"B. Barak, S. Garg, Y.T. Kalai, O. Paneth, A. Sahai, Protecting obfuscation against algebraic attacks, in P.Q. Nguyen, E. Oswald, editors, EUROCRYPT\u00a02014, vol. 8441 of LNCS (Springer, Heidelberg, 2014), pp. 221\u2013238","DOI":"10.1007\/978-3-642-55220-5_13"},{"key":"9429_CR22","doi-asserted-by":"crossref","unstructured":"D. Boneh, D. Gupta, I. Mironov, A. Sahai, Hosting services on an untrusted cloud, in E. Oswald, M. Fischlin, editors, EUROCRYPT\u00a02015, Part\u00a0II, vol. 9057 of LNCS (Springer, Heidelberg, 2015), pp. 404\u2013436","DOI":"10.1007\/978-3-662-46803-6_14"},{"key":"9429_CR23","doi-asserted-by":"crossref","unstructured":"J. Bartusek, J. Guan, F. Ma, M. Zhandry, Return of GGH15: provable security against zeroizing attacks, in A. Beimel, S. Dziembowski, editors, TCC\u00a02018, Part\u00a0II, vol. 11240 of LNCS (Springer, Heidelberg, 2018), pp. 544\u2013574","DOI":"10.1007\/978-3-030-03810-6_20"},{"key":"9429_CR24","doi-asserted-by":"crossref","unstructured":"M. Bellare, V.T. Hoang, P. Rogaway, Foundations of garbled circuits, in T. Yu, G. Danezis, V.D. Gligor, editors, ACM CCS 2012 (ACM Press, 2012), pp. 784\u2013796","DOI":"10.1145\/2382196.2382279"},{"issue":"2","key":"9429_CR25","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/s00145-017-9261-0","volume":"31","author":"Z Brakerski","year":"2018","unstructured":"Z. Brakerski, I. Komargodski, G. Segev, Multi-input functional encryption in the private-key setting: Stronger security from weaker assumptions. J. Cryptol. 31(2), 434\u2013520 (2018)","journal-title":"J. Cryptol."},{"key":"9429_CR26","doi-asserted-by":"crossref","unstructured":"S. Badrinarayanan, E. Miles, A. Sahai, M. Zhandry, Post-zeroizing obfuscation: New mathematical tools, and the case of evasive circuits, in M. Fischlin, J.-S. Coron, editors, EUROCRYPT\u00a02016, Part\u00a0II, vol. 9666 of LNCS, (Springer, Heidelberg, 2016), pp. 764\u2013791","DOI":"10.1007\/978-3-662-49896-5_27"},{"issue":"2","key":"9429_CR27","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s00145-019-09337-9","volume":"33","author":"N Bitansky","year":"2020","unstructured":"N. Bitansky, R. Nishimaki, A. Passel\u00e8gue, D. Wichs, From cryptomania to obfustopia through secret-key functional encryption. J. Cryptol 33(2), 357\u2013405 (2020)","journal-title":"J. Cryptol"},{"key":"9429_CR28","doi-asserted-by":"crossref","unstructured":"D. Boneh, P.A. Papakonstantinou, C. Rackoff, Y. Vahlis, B. Waters, On the impossibility of basing identity based encryption on trapdoor permutations, in 49th FOCS (IEEE Computer Society Press, 2008), pp. 283\u2013292","DOI":"10.1109\/FOCS.2008.67"},{"key":"9429_CR29","doi-asserted-by":"crossref","unstructured":"N. Bitansky, O. Paneth, D. Wichs, Perfect structure on the edge of chaos-trapdoor permutations from indistinguishability obfuscation, in E. Kushilevitz, T. Malkin, editors, TCC\u00a02016-A, Part\u00a0I, vol. 9562 of LNCS (Springer, Heidelberg, 2016), pp. 474\u2013502","DOI":"10.1007\/978-3-662-49096-9_20"},{"key":"9429_CR30","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, G.N. Rothblum, Virtual black-box obfuscation for all circuits via generic graded encoding, in Y. Lindell, editor, TCC\u00a02014, vol. 8349 of LNCS (Springer, Heidelberg, 2014), pp. 1\u201325","DOI":"10.1007\/978-3-642-54242-8_1"},{"issue":"1","key":"9429_CR31","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/s00145-017-9255-y","volume":"31","author":"Z Brakerski","year":"2018","unstructured":"Z. Brakerski, G. Segev, Function-private functional encryption in the private-key setting. J. Cryptol. 31(1), 202\u2013225 (2018)","journal-title":"J. Cryptol."},{"key":"9429_CR32","doi-asserted-by":"crossref","unstructured":"D. Boneh, A. Sahai, B. Waters, Functional encryption: Definitions and challenges, in Y. Ishai, editor, TCC\u00a02011, vol. 6597 of LNCS (Springer, Heidelberg, 2011), pp. 253\u2013273","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"9429_CR33","doi-asserted-by":"crossref","unstructured":"N. Bitansky, V. Vaikuntanathan, Indistinguishability obfuscation from functional encryption, in V. Guruswami, editor, 56th FOCS (IEEE Computer Society Press, 2015), pp. 171\u2013190","DOI":"10.1109\/FOCS.2015.20"},{"issue":"6","key":"9429_CR34","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1145\/3234511","volume":"65","author":"N Bitansky","year":"2018","unstructured":"N. Bitansky, V. Vaikuntanathan, Indistinguishability obfuscation from functional encryption. J. ACM 65(6), 391\u20133937 (2018)","journal-title":"J. ACM"},{"key":"9429_CR35","doi-asserted-by":"crossref","unstructured":"D. Boneh, B. Waters, Constrained pseudorandom functions and their applications, in K. Sako, P. Sarkar, editors, ASIACRYPT\u00a02013, Part\u00a0II, vol. 8270 of LNCS (Springer, Heidelberg, 2013), pp. 280\u2013300","DOI":"10.1007\/978-3-642-42045-0_15"},{"key":"9429_CR36","doi-asserted-by":"crossref","unstructured":"J.-S. Coron, C. Gentry, S. Halevi, T. Lepoint, H.K. Maji, E. Miles, M. Raykova, A. Sahai, M. Tibouchi, Zeroizing without low-level zeroes: New MMAP attacks and their limitations, in R. Gennaro, M.J.B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0I, vol. 9215 of LNCS (Springer, Heidelberg, 2015), pp. 247\u2013266","DOI":"10.1007\/978-3-662-47989-6_12"},{"key":"9429_CR37","doi-asserted-by":"crossref","unstructured":"Y. Chen, C. Gentry, S. Halevi, Cryptanalyses of candidate branching program obfuscators, in J.-S. Coron, J.B. Nielsen, editors, EUROCRYPT\u00a02017, Part\u00a0III, vol. 10212 of LNCS (Springer, Heidelberg, 2017), pp. 278\u2013307","DOI":"10.1007\/978-3-319-56617-7_10"},{"issue":"6","key":"9429_CR38","doi-asserted-by":"publisher","first-page":"2157","DOI":"10.1137\/18M1164834","volume":"47","author":"A Cohen","year":"2018","unstructured":"A. Cohen, J. Holmgren, R. Nishimaki, V. Vaikuntanathan, D. Wichs, Watermarking cryptographic capabilities. SIAM J. Comput. 47(6), 2157\u20132202 (2018)","journal-title":"SIAM J. Comput."},{"key":"9429_CR39","doi-asserted-by":"crossref","unstructured":"Y. Chen, M. Hhan, V. Vaikuntanathan, H. Wee, Matrix PRFs: Constructions, attacks, and applications to obfuscation, in D. Hofheinz, A. Rosen, editors, TCC\u00a02019, Part\u00a0I, vol. 11891 of LNCS (Springer, Heidelberg, 2019), pp. 55\u201380","DOI":"10.1007\/978-3-030-36030-6_3"},{"key":"9429_CR40","doi-asserted-by":"crossref","unstructured":"J.-S. Coron, M.S. Lee, T. Lepoint, M. Tibouchi, Zeroizing attacks on indistinguishability obfuscation over CLT13, in S. Fehr, editor, PKC\u00a02017, Part\u00a0I, vol. 10174 of LNCS (Springer, Heidelberg, 2017), pp. 41\u201358","DOI":"10.1007\/978-3-662-54365-8_3"},{"key":"9429_CR41","doi-asserted-by":"crossref","unstructured":"R. Canetti, H. Lin, S. Tessaro, V. Vaikuntanathan, Obfuscation of probabilistic circuits and applications, in Y. Dodis, J.B. Nielsen, editors, TCC\u00a02015, Part\u00a0II, vol. 9015 of LNCS (Springer, Heidelberg, 2015), pp. 468\u2013497","DOI":"10.1007\/978-3-662-46497-7_19"},{"key":"9429_CR42","doi-asserted-by":"crossref","unstructured":"Y. Chen, V. Vaikuntanathan, H. Wee, GGH15 beyond permutation branching programs: Proofs, attacks, and candidates, in H. Shacham, A. Boldyreva, editors, CRYPTO\u00a02018, Part\u00a0II, vol. 10992 of LNCS (Springer, Heidelberg, 2018), pp. 577\u2013607","DOI":"10.1007\/978-3-319-96881-0_20"},{"key":"9429_CR43","doi-asserted-by":"crossref","unstructured":"R. Fernando, P.M.R. Rasmussen, A. Sahai, Preventing CLT attacks on obfuscation with linear overhead, in T. Takagi, T. Peyrin, editors, ASIACRYPT\u00a02017, Part\u00a0III, vol. 10626 of LNCS (Springer, Heidelberg, 2017), pp. 242\u2013271","DOI":"10.1007\/978-3-319-70700-6_9"},{"key":"9429_CR44","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Dov Gordon, V. Goyal, A. Jain, J. Katz, F.-H. Liu, A. Sahai, E. Shi, H.-S. Zhou, Multi-input functional encryption, in P.Q. Nguyen, E. Oswald, editors, EUROCRYPT\u00a02014, vol. 8441 of LNCS (Springer, Heidelberg, 2014), pp. 578\u2013602","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"9429_CR45","doi-asserted-by":"crossref","unstructured":"C. Gentry, S. Gorbunov, S. Halevi, Graph-induced multilinear maps from lattices, in Y. Dodis, J. Nielsen, editors, TCC\u00a02015, Part\u00a0II, vol. 9015 of LNCS (Springer, Heidelberg, 2015), pp. 498\u2013527","DOI":"10.1007\/978-3-662-46497-7_20"},{"issue":"3","key":"9429_CR46","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/14095772X","volume":"45","author":"S Garg","year":"2016","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, B. Waters, Candidate indistinguishability obfuscation and functional encryption for all circuits. SIAM J. Comput. 45(3), 882\u2013929 (2016)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"9429_CR47","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"9429_CR48","first-page":"555","volume-title":"45th ACM STOC","author":"S Goldwasser","year":"2013","unstructured":"S. Goldwasser, Y.T. Kalai, R.A. Popa, V. Vaikuntanathan, N. Zeldovich, Reusable garbled circuits and succinct functional encryption, in D. Boneh, T. Roughgarden, J. Feigenbaum, editors, 45th ACM STOC (ACM Press, UK, 2013), pp. 555\u2013564"},{"key":"9429_CR49","doi-asserted-by":"crossref","unstructured":"S. Garg, E. Miles, P. Mukherjee, A. Sahai, A. Srinivasan, M. Zhandry, Secure obfuscation in a weak multilinear map model, in M. Hirt, A.D. Smith, editors, TCC\u00a02016-B, Part\u00a0II, vol. 9986 of LNCS (Springer, Heidelberg, 2016), pp. 241\u2013268","DOI":"10.1007\/978-3-662-53644-5_10"},{"key":"9429_CR50","doi-asserted-by":"crossref","unstructured":"S. Garg, M. Mahmoody, A. Mohammed, Lower bounds on obfuscation from all-or-nothing encryption primitives, in J. Katz, H. Shacham, editors, CRYPTO\u00a02017, Part\u00a0I, vol. 10401 of LNCS (Springer, Heidelberg, 2017)","DOI":"10.1007\/978-3-319-63688-7_22"},{"key":"9429_CR51","doi-asserted-by":"crossref","unstructured":"R. Gay, R. Pass, Indistinguishability obfuscation from circular security, in S. Khuller, V.V. Williams, editors, STOC \u201921: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021 (ACM, 2021), pp. 736\u2013749","DOI":"10.1145\/3406325.3451070"},{"key":"9429_CR52","doi-asserted-by":"crossref","unstructured":"S. Garg, O. Pandey, A. Srinivasan, M. Zhandry, Breaking the sub-exponential barrier in obfustopia. In J.-S. Coron, J. Nielsen, editors, EUROCRYPT\u00a02017, Part\u00a0III, vol. 10212 of LNCS (Springer, Heidelberg, 2017), pp. 156\u2013181","DOI":"10.1007\/978-3-319-56617-7_6"},{"key":"9429_CR53","doi-asserted-by":"crossref","unstructured":"S. Garg, A. Srinivasan, Single-key to multi-key functional encryption with polynomial loss, in M. Hirt, A.D. Smith, editors, TCC\u00a02016-B, Part\u00a0II, vol. 9986 of LNCS (Springer, Heidelberg, 2016), pp. 419\u2013442","DOI":"10.1007\/978-3-662-53644-5_16"},{"key":"9429_CR54","doi-asserted-by":"crossref","unstructured":"S. Gorbunov, V. Vaikuntanathan, H. Wee, Functional encryption with bounded collusions via multi-party computation, in R. Safavi-Naini, R. Canetti, editors, CRYPTO\u00a02012, vol. 7417 of LNCS (Springer, Heidelberg, 2012), pp. 162\u2013179","DOI":"10.1007\/978-3-642-32009-5_11"},{"key":"9429_CR55","doi-asserted-by":"crossref","unstructured":"D. Hofheinz, T. Jager, D. Khurana, A. Sahai, B. Waters, M. Zhandry, How to generate and use universal samplers, in J.H. Cheon, T. Takagi, editors, ASIACRYPT\u00a02016, Part\u00a0II, vol. 10032 of LNCS (Springer, Heidelberg, 2016), pp. 715\u2013744","DOI":"10.1007\/978-3-662-53890-6_24"},{"key":"9429_CR56","doi-asserted-by":"crossref","unstructured":"S.B. Hopkins, A. Jain, H. Lin, Counterexamples to new circular security assumptions underlying iO, in T. Malkin, C. Peikert, editors, CRYPTO\u00a02021, Part\u00a0II, vol. 12826 of LNCS, Virtual Event (Springer, Heidelberg, 2021), pp. 673\u2013700","DOI":"10.1007\/978-3-030-84245-1_23"},{"key":"9429_CR57","doi-asserted-by":"crossref","unstructured":"S. Hohenberger, A. Sahai, B. Waters, Replacing a random oracle: Full domain hash from indistinguishability obfuscation, in P.Q. Nguyen, E. Oswald, editors, EUROCRYPT\u00a02014, vol. 8441 of LNCS (Springer, Heidelberg, 2014), pp. 201\u2013220","DOI":"10.1007\/978-3-642-55220-5_12"},{"key":"9429_CR58","unstructured":"R. Impagliazzo, A personal view of average-case complexity, in Proceedings of the Tenth Annual Structure in Complexity Theory Conference, Minneapolis, Minnesota, USA, June 19\u201322, 1995 (IEEE Computer Society, 1995), pp. 134\u2013147"},{"key":"9429_CR59","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, S. Rudich, Limits on the provable consequences of one-way permutations, in 21st ACM STOC (ACM Press, 1989), pp. 44\u201361","DOI":"10.1145\/73007.73012"},{"key":"9429_CR60","doi-asserted-by":"crossref","unstructured":"A. Jain, H. Lin, C. Matt, A. Sahai, How to leverage hardness of constant-degree expanding polynomials overa $${\\mathbb{R}}$$ to build $$i{\\cal{O}}$$, in Y. Ishai, V. Rijmen, editors, EUROCRYPT\u00a02019, Part\u00a0I, vol. 11476 of LNCS (Springer, Heidelberg, 2019), pp. 251\u2013281","DOI":"10.1007\/978-3-030-17653-2_9"},{"key":"9429_CR61","unstructured":"A. Jain, H. Lin, A. Sahai, Simplifying constructions and assumptions for $$i{\\cal{O}}$$. Cryptology ePrint Archive, Report 2019\/1252 (2019). https:\/\/eprint.iacr.org\/2019\/1252"},{"key":"9429_CR62","doi-asserted-by":"crossref","unstructured":"A. Jain, H. Lin, A. Sahai, Indistinguishability obfuscation from well-founded assumptions, in S. Khuller, V. Vassilevska Williams, editors, STOC 2021 (ACM, 2021), pp. 60\u201373","DOI":"10.1145\/3406325.3451093"},{"key":"9429_CR63","first-page":"419","volume-title":"47th ACM STOC","author":"V Koppula","year":"2015","unstructured":"V. Koppula, A.B. Lewko, B. Waters, Indistinguishability obfuscation for turing machines with unbounded memory, in R.A. Servedio, R. Rubinfeld, editors, 47th ACM STOC (ACM Press, UK, 2015), pp. 419\u2013428"},{"key":"9429_CR64","doi-asserted-by":"crossref","unstructured":"I. Komargodski, T. Moran, M. Naor, R. Pass, A. Rosen, E. Yogev, One-way functions and (im)perfect obfuscation, in 55th FOCS (IEEE Computer Society Press, 2014), pp. 374\u2013383","DOI":"10.1109\/FOCS.2014.47"},{"key":"9429_CR65","unstructured":"F. Kitagawa, R. Nishimaki, K. Tanaka, From single-key to collusion-resistant secret-key functional encryption by leveraging succinctness. Cryptology ePrint Archive, Report 2017\/638 (2017). https:\/\/eprint.iacr.org\/2017\/638"},{"key":"9429_CR66","unstructured":"F. Kitagawa, R. Nishimaki, K. Tanaka, Indistinguishability obfuscation for all circuits from secret-key functional encryption. Cryptology ePrint Archive, Report 2017\/361 (2017). https:\/\/eprint.iacr.org\/2017\/361"},{"key":"9429_CR67","doi-asserted-by":"crossref","unstructured":"F. Kitagawa, R. Nishimaki, K. Tanaka, Obfustopia built on secret-key functional encryption, in J.B. Nielsen, V. Rijmen, editors, EUROCRYPT\u00a02018, Part\u00a0II, vol. 10821 of LNCS (Springer, Heidelberg, 2018), pp. 603\u2013648","DOI":"10.1007\/978-3-319-78375-8_20"},{"issue":"3","key":"9429_CR68","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00145-021-09396-x","volume":"34","author":"F Kitagawa","year":"2021","unstructured":"F. Kitagawa, R. Nishimaki, K. Tanaka, Simple and generic constructions of succinct functional encryption. J. Cryptol. 34(3), 25 (2021)","journal-title":"J. Cryptol."},{"key":"9429_CR69","doi-asserted-by":"crossref","unstructured":"A. Kiayias, S. Papadopoulos, N. Triandopoulos, T. Zacharias, Delegatable pseudorandom functions and applications, in A.-R. Sadeghi, V.D. Gligor, M. Yung, editors, ACM CCS 2013 (ACM Press, 2013), pp. 669\u2013684","DOI":"10.1145\/2508859.2516668"},{"issue":"2","key":"9429_CR70","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/s00145-019-09327-x","volume":"33","author":"I Komargodski","year":"2020","unstructured":"I. Komargodski, G. Segev, From minicrypt to obfustopia via private-key functional encryption. J. Cryptol. 33(2), 406\u2013458 (2020)","journal-title":"J. Cryptol."},{"key":"9429_CR71","doi-asserted-by":"crossref","unstructured":"J. Katz, A. Yerukhimovich, On black-box constructions of predicate encryption from trapdoor permutations, in M. Matsui, editor, ASIACRYPT\u00a02009, vol. 5912 of LNCS (Springer, Heidelberg, 2009), pp. 197\u2013213","DOI":"10.1007\/978-3-642-10366-7_12"},{"key":"9429_CR72","doi-asserted-by":"crossref","unstructured":"H. Lin, Indistinguishability obfuscation from constant-degree graded encoding schemes, in M. Fischlin, J.-S. Coron, editors, EUROCRYPT\u00a02016, Part\u00a0I, vol. 9665 of LNCS (Springer, Heidelberg, 2016), pp. 28\u201357","DOI":"10.1007\/978-3-662-49890-3_2"},{"key":"9429_CR73","doi-asserted-by":"crossref","unstructured":"H. Lin, Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs, in J. Katz, H. Shacham, editors, CRYPTO\u00a02017, Part\u00a0I, vol. 10401 of LNCS (Springer, Heidelberg, 2017), pp. 599\u2013629","DOI":"10.1007\/978-3-319-63688-7_20"},{"key":"9429_CR74","doi-asserted-by":"crossref","unstructured":"B. Li, D. Micciancio, Compactness vs collusion resistance in functional encryption, in M. Hirt, A.D. Smith, editors, TCC\u00a02016-B, Part\u00a0II, vol. 9986 of LNCS (Springer, Heidelberg, 2016), pp. 443\u2013468","DOI":"10.1007\/978-3-662-53644-5_17"},{"key":"9429_CR75","unstructured":"H. Lin, C. Matt, Pseudo flawed-smudging generators and their application to indistinguishability obfuscation. Cryptology ePrint Archive, Report 2018\/646 (2018) https:\/\/eprint.iacr.org\/2018\/646"},{"issue":"2","key":"9429_CR76","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","volume":"22","author":"Y Lindell","year":"2009","unstructured":"Y. Lindell, B. Pinkas, A proof of security of yao\u2019s protocol for two-party computation. J. Cryptol. 22(2), 161\u2013188 (2009)","journal-title":"J. Cryptol."},{"key":"9429_CR77","doi-asserted-by":"crossref","unstructured":"H. Lin, R. Pass, K. Seth, S. Telang, Indistinguishability obfuscation with non-trivial efficiency, in C.-M. Cheng, K.-M. Chung, G. Persiano, B.-Y. Yang, editors, PKC\u00a02016, Part\u00a0II, vol. 9615 of LNCS (Springer, Heidelberg, 2016), pp. 447\u2013462","DOI":"10.1007\/978-3-662-49387-8_17"},{"issue":"2","key":"9429_CR78","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M Luby","year":"1988","unstructured":"M. Luby, C. Rackoff, How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Comput. 17(2), 373\u2013386 (1988)","journal-title":"SIAM J. Comput."},{"key":"9429_CR79","doi-asserted-by":"crossref","unstructured":"H. Lin, V. Vaikuntanathan, Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings, in I. Dinur, editor, 57th FOCS (IEEE Computer Society Press, 2016), pp. 11\u201320","DOI":"10.1109\/FOCS.2016.11"},{"key":"9429_CR80","doi-asserted-by":"crossref","unstructured":"E. Miles, A. Sahai, M. Zhandry, Annihilation attacks for multilinear maps: Cryptanalysis of indistinguishability obfuscation over GGH13, in M. Robshaw, J. Katz, editors, CRYPTO\u00a02016, Part\u00a0II, vol. 9815 of LNCS (Springer, Heidelberg, 2016), pp. 629\u2013658","DOI":"10.1007\/978-3-662-53008-5_22"},{"key":"9429_CR81","doi-asserted-by":"crossref","unstructured":"F. Ma, M. Zhandry, The MMap strikes back: Obfuscation and new multilinear maps immune to CLT13 zeroizing attacks, in A. Beimel, S. Dziembowski, editors, TCC\u00a02018, Part\u00a0II, vol. 11240 of LNCS (Springer, Heidelberg, 2018), pp. 513\u2013543","DOI":"10.1007\/978-3-030-03810-6_19"},{"key":"9429_CR82","unstructured":"A. O\u2019Neill, Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010\/556 (2010). https:\/\/eprint.iacr.org\/2010\/556"},{"key":"9429_CR83","doi-asserted-by":"crossref","unstructured":"R. Pass, K. Seth, S. Telang, Indistinguishability obfuscation from semantically-secure multilinear encodings, in J.A. Garay, R. Gennaro, editors, CRYPTO\u00a02014, Part\u00a0I, vol. 8616 of LNCS (Springer, Heidelberg, 2014), pp. 500\u2013517","DOI":"10.1007\/978-3-662-44371-2_28"},{"key":"9429_CR84","doi-asserted-by":"crossref","unstructured":"A. Sahai, H. Seyalioglu, Worry-free encryption: functional encryption with public keys, in E. Al-Shaer, A.D. Keromytis, V. Shmatikov, editors, ACM CCS 2010 (ACM Press, 2010), pp. 463\u2013472","DOI":"10.1145\/1866307.1866359"},{"key":"9429_CR85","doi-asserted-by":"crossref","unstructured":"A. Sahai, B.R. Waters, Fuzzy identity-based encryption, in R. Cramer, editor, EUROCRYPT\u00a02005, vol. 3494 of LNCS (Springer, Heidelberg, 2005), pp. 457\u2013473","DOI":"10.1007\/11426639_27"},{"issue":"3","key":"9429_CR86","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/15M1030108","volume":"50","author":"A Sahai","year":"2021","unstructured":"A. Sahai, B. Waters, How to use indistinguishability obfuscation: Deniable encryption, and more. SIAM J. Comput. 50(3), 857\u2013908 (2021)","journal-title":"SIAM J. Comput."},{"key":"9429_CR87","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, Universal circuits (preliminary report), in A.K. Chandra, D. Wotschke, E.P. Friedman, M.A. Harrison, editors, Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3\u20135, 1976, Hershey, Pennsylvania, USA (ACM, 1976), pp. 196\u2013203","DOI":"10.1145\/800113.803649"},{"key":"9429_CR88","doi-asserted-by":"crossref","unstructured":"B. Waters, A punctured programming approach to adaptively secure functional encryption, in R. Gennaro, M.J.B. Robshaw, editors, CRYPTO\u00a02015, Part\u00a0II, vol. 9216 of LNCS (Springer, Heidelberg, 2015), pp. 678\u2013697","DOI":"10.1007\/978-3-662-48000-7_33"},{"key":"9429_CR89","doi-asserted-by":"crossref","unstructured":"H. Wee, D. Wichs, Candidate obfuscation via oblivious LWE sampling, in A. Canteaut, F.-X. Standaert, editors, EUROCRYPT\u00a02021, Part\u00a0III, vol. 12698 of LNCS (Springer, Heidelberg, 2021), pp. 127\u2013156","DOI":"10.1007\/978-3-030-77883-5_5"},{"key":"9429_CR90","unstructured":"A.C.-C. Yao, How to generate and exchange secrets (extended abstract), in 27th FOCS (IEEE Computer Society Press, 1986), pp. 162\u2013167"},{"key":"9429_CR91","doi-asserted-by":"crossref","unstructured":"J. Zimmerman, How to obfuscate programs directly, in E. Oswald, M. Fischlin, editors, EUROCRYPT\u00a02015, Part\u00a0II, vol. 9057 of LNCS (Springer, Heidelberg, 2015), pp. 439\u2013467","DOI":"10.1007\/978-3-662-46803-6_15"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09429-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-022-09429-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-022-09429-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,26]],"date-time":"2024-09-26T10:37:30Z","timestamp":1727347050000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-022-09429-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,3]]},"references-count":91,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["9429"],"URL":"https:\/\/doi.org\/10.1007\/s00145-022-09429-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"type":"print","value":"0933-2790"},{"type":"electronic","value":"1432-1378"}],"subject":[],"published":{"date-parts":[[2022,6,3]]},"assertion":[{"value":"2 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"19"}}