{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:33:16Z","timestamp":1764621196888,"version":"3.46.0"},"publisher-location":"Cham","reference-count":72,"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_6","type":"book-chapter","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:19Z","timestamp":1764620899000},"page":"153-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Meta-complexity Theoretic Approach to\u00a0Indistinguishability Obfuscation and Witness Pseudo-Canonicalization"],"prefix":"10.1007","author":[{"given":"Noam","family":"Mazor","sequence":"first","affiliation":[]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[]},{"given":"Tomer","family":"Solomon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,2]]},"reference":[{"issue":"6","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1137\/050628994","volume":"35","author":"E Allender","year":"2006","unstructured":"Allender, E., Buhrman, H., Kouck\u1ef3, M., Van Melkebeek, D., Ronneburger, D.: Power from random strings. SIAM J. Comput. 35(6), 1467\u20131493 (2006)","journal-title":"SIAM J. Comput."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Antunes, L., Fortnow, L.: Worst-case running times for averagecase algorithms. In: 2009 24th Annual IEEE Conference on Computational Complexity, pp. 298\u2013303. IEEE (2009)","DOI":"10.1109\/CCC.2009.12"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.tcs.2005.11.033","volume":"354","author":"L Antunes","year":"2006","unstructured":"Antunes, L., Fortnow, L., Van Melkebeek, D., Vinodchandran, N.V.: Computational depth: concept and applications. Theor. Comput. Sci. 354(3), 391\u2013404 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-17653-2_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"S Agrawal","year":"2019","unstructured":"Agrawal, S.: Indistinguishability obfuscation without multilinear maps: new methods for bootstrapping and instantiation. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 191\u2013225. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_7"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Aiello, W., Hastad, J. Statistical zero-knowledge languages can be recognized in two rounds. J. Comput. Syst. Sci. 327\u2013345 (1991)","DOI":"10.1016\/0022-0000(91)90006-Q"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-26954-8_10","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"P Ananth","year":"2019","unstructured":"Ananth, P., Jain, A., Lin, H., Matt, C., Sahai, A.: Indistinguishability obfuscation without multilinear maps: new paradigms via low degree weak pseudorandomness and security amplification. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 284\u2013332. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_10"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-662-53008-5_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"P Ananth","year":"2016","unstructured":"Ananth, P., Jain, A., Naor, M., Sahai, A., Yogev, E.: Universal constructions and robust combiners for indistinguishability obfuscation and witness encryption. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9815, pp. 491\u2013520. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53008-5_17"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-319-63715-0_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"P Ananth","year":"2017","unstructured":"Ananth, P., Jain, A., Sahai, A.: Indistinguishability obfuscation for turing machines: constant overhead and amortization. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10402, pp. 252\u2013279. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_9"},{"key":"6_CR9","unstructured":"Ananth, P., Jain, A., Sahai, A.: Indistinguishability obfuscation without multilinear maps: iO from LWE, bilinear maps, and weak pseudo randomness. Cryptology ePrint Archive, Paper 2018\/615 (2018). https:\/\/eprint.iacr.org\/2018\/615"},{"key":"6_CR10","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":"6_CR11","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":"6_CR12","unstructured":"Bartusek, J., Ishai, Y., Jain, A., Ma, F., Sahai, A., Zhandry, M.: Affine Determinant programs: a framework for obfuscation and witness encryption. In: IACR Cryptol. ePrint Arch. 889 (2020). https:\/\/eprint.iacr.org\/2020\/889"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-54242-8_3","volume-title":"Theory of Cryptography","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: On extractability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 52\u201373. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_3"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., D\u00f6ttling, N., Garg, S., Malavolta, G.: Factoring and pairings are not necessary for IO: circular-secure LWE suffices. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 4\u20138 July 2022, Paris, France. LIPIcs, vol. 229, pp. 28:1\u201328:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPICS.ICALP.2022.28.url: https:\/\/doi.org\/10.4230\/LIPIcs.ICALP 2022.28","DOI":"10.4230\/LIPICS.ICALP.2022.28."},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-023-09471-5","volume":"36","author":"ND Brakerski","year":"2023","unstructured":"Brakerski, N.D., Garg, S., Malavolta, G.: Candidate iO from homomorphic encryption schemes. J. Cryptol. 36(3), 27 (2023)","journal-title":"J. Cryptol."},{"issue":"1\u20133","key":"6_CR16","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","volume":"55","author":"A Blass","year":"1982","unstructured":"Blass, A., Gurevich, Y.: On the unique satisfiability problem. Inf. Control 55(1\u20133), 80\u201388 (1982)","journal-title":"Inf. Control"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Garg, S., Lin, H., Pass, R., Telang, S.: Succinct randomized encodings and their applications. In: Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 439\u2013448 (2015)","DOI":"10.1145\/2746539.2746574"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Ball, M., Liu, Y., Mazor, N., Pass, R.: Kolmogorov comes to cryptomania: on interactive Kolmogorov complexity and key-agreement. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 458\u2013483. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00034"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-662-46497-7_16","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2015","unstructured":"Bitansky, N., Paneth, O.: ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 401\u2013427. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_16"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Paneth, O., Rosen, A.: On the cryptographic hardness of finding a Nash equilibrium. In: IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 1480\u20131498. IEEE (2015)","DOI":"10.1109\/FOCS.2015.94"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-662-49096-9_20","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2016","unstructured":"Bitansky, N., Paneth, O., Wichs, D.: Perfect structure on the edge of chaos. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 474\u2013502. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_20"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1007\/s00453-016-0242-8","volume":"79","author":"D Boneh","year":"2017","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. Algorithmica 79, 1233\u20131285 (2017)","journal-title":"Algorithmica"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Canetti, R., Chamon, C., Mucciolo, E.R., Ruckenstein, A.E.: Towards general-purpose program obfuscation via local mixing. IACR Cryptol. ePrint Arch. 6 (2024). https:\/\/eprint.iacr.org\/2024\/006","DOI":"10.1007\/978-3-031-78023-3_2"},{"issue":"3","key":"6_CR24","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1145\/321526.321530","volume":"16","author":"GJ Chaitin","year":"1969","unstructured":"Chaitin, G.J.: On the simplicity and speed of programs for computing infinite sets of natural numbers. J. ACM 16(3), 407\u2013422 (1969)","journal-title":"J. ACM"},{"key":"6_CR25","unstructured":"Canetti, R., Holmgren, J., Jain, A., Vaikuntanathan, V.: Indistinguishability obfuscation of iterated circuits and RAM programs. In: Cryptology ePrint Archive (2014)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-662-46497-7_18","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2015","unstructured":"Canetti, R., Kalai, Y.T., Paneth, O.: On obfuscation with random oracles. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 456\u2013467. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46497-7_18"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Chung, K.-M., Lin, H., Pass, R.: Constant-round concurrent zero-knowledge from indistinguishability obfuscation. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9215, pp. 287\u2013307. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47989-6_14","DOI":"10.1007\/978-3-662-47989-6_14"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"Feige, U., Shamir, A..: Witness indistinguishable and witness hiding protocols. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, STOC 1990, pp. 416\u2013426. Association for Computing Machinery (1990). https:\/\/doi.org\/10.1145\/100216.100272. ISBN 0897913612","DOI":"10.1145\/100216.100272"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October, 2013, Berkeley, CA, USA, pp. 40\u201349. IEEE Computer Society (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.13","DOI":"10.1109\/FOCS.2013.13"},{"key":"6_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-642-54242-8_4","volume-title":"Theory of Cryptography","author":"S Garg","year":"2014","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M.: Two-round secure MPC from indistinguishability obfuscation. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 74\u201394. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_4"},{"key":"6_CR31","unstructured":"Gentry, C., Jutla, C.S., Kane, D.: Obfuscation using tensor products. Cryptology ePrint Archive, Paper 2018\/756 (2018). https:\/\/eprint.iacr.org\/2018\/756"},{"key":"6_CR32","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":"6_CR33","unstructured":"Goldwasser, S., Kalai, Y.T. On the impossibility of obfuscation with auxiliary input. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 553\u2013562. IEEE (2005)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Gentry, C., Lewko, A.B., Sahai, A., Waters, B., Indistinguishability obfuscation from the multilinear subgroup elimination assumption. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 151\u2013170. IEEE (2015)","DOI":"10.1109\/FOCS.2015.19"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 281\u2013308 (1988)","DOI":"10.1137\/0217017"},{"key":"6_CR36","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":"6_CR37","doi-asserted-by":"publisher","unstructured":"Hartmanis, J.: Generalized Kolmogorov complexity and the structure of feasible computations. In: 24th Annual Symposium on Foundations of Computer Science (SFCS 1983), pp. 439\u2013445 (1983). https:\/\/doi.org\/10.1109\/SFCS.1983.21","DOI":"10.1109\/SFCS.1983.21"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Non-black-box worst-case to average-case reductions within NP. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 247\u2013258. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00032"},{"key":"6_CR39","unstructured":"Hirahara, S.: Non-disjoint promise problems from meta-computational view of pseudorandom generator constructions. In: 35th Computational Complexity Conference (CCC 2020). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2020)"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Huang, Y., Ilango, R., Ren, H.: NP-hardness of approximating meta-complexity: a cryptographic approach. In: Cryptology ePrint Archive (2023)","DOI":"10.1145\/3564246.3585154"},{"issue":"2","key":"6_CR41","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s00037-023-00241-0","volume":"32","author":"R Impagliazzo","year":"2023","unstructured":"Impagliazzo, R., Kabanets, V., Volkovich, I.: The power of natural properties as oracles. Comput. Complexity 32(2), 6 (2023)","journal-title":"Comput. Complexity"},{"key":"6_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-030-17653-2_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"A Jain","year":"2019","unstructured":"Jain, A., Lin, H., Matt, C., Sahai, A.: How to leverage hardness of constant-degree expanding polynomials over $$\\mathbb{R}$$ to build $$i\\cal{O}$$. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11476, pp. 251\u2013281. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17653-2_9"},{"key":"6_CR43","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from well-founded assumptions. In: Khuller, S., Williams, V.V. (eds.) STOC 2021: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, 21\u201325 June 2021, pp. 60\u201373. ACM (2021). https:\/\/doi.org\/10.1145\/3406325.3451093","DOI":"10.1145\/3406325.3451093"},{"key":"6_CR44","doi-asserted-by":"publisher","unstructured":"Jain, A., Lin, H., Sahai, A.: Indistinguishability obfuscation from LPN over $$\\mathbb{F}_p$$, DLIN, and PRGs in NC0. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, 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":"6_CR45","doi-asserted-by":"crossref","unstructured":"Kabanets, V., Cai, J.: Circuit minimization problem. In: 2000 Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 21\u201323 May 2000, Portland, OR, USA, pp. 73\u201379 (2000)","DOI":"10.1145\/335305.335314"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for turing machines with unbounded memory. In: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, pp. 419\u2013428 (2015)","DOI":"10.1145\/2746539.2746614"},{"key":"6_CR47","doi-asserted-by":"crossref","unstructured":"Ilan Komargodski, Moni Naor, and Eylon Yogev. Secret-sharing for NP. In: Journal of Cryptology 30.2 (2017), pp. 444\u2013469","DOI":"10.1007\/s00145-015-9226-0"},{"issue":"3","key":"6_CR48","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0304-3975(86)90081-2","volume":"48","author":"K-I Ko","year":"1986","unstructured":"Ko, K.-I.: On the notion of infinite pseudorandom sequences. Theor. Comput. Sci. 48(3), 9\u201333 (1986). https:\/\/doi.org\/10.1016\/0304-3975(86)90081-2","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20134","key":"6_CR49","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1080\/00207166808803030","volume":"2","author":"AN Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Int. J. Comput. Math. 2(1\u20134), 157\u2013168 (1968)","journal-title":"Int. J. Comput. Math."},{"key":"6_CR50","doi-asserted-by":"crossref","unstructured":"Komargodski, I., Moran, T., Naor, M., Pass, R., Rosen, A., Yogev, E.: One-way functions and (im) perfect obfuscation. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 374\u2013383. IEEE (2014)","DOI":"10.1109\/FOCS.2014.47"},{"key":"6_CR51","doi-asserted-by":"publisher","unstructured":"Lin, H.: Indistinguishability obfuscation from constant-degree graded encoding schemes. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 28\u201357. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_2","DOI":"10.1007\/978-3-662-49890-3_2"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-319-63688-7_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"H Lin","year":"2017","unstructured":"Lin, H.: Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 599\u2013629. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_20"},{"key":"6_CR53","unstructured":"Lu, Z., Mazor, N., Oliveira, I.C., Pass, R.: Lower bounds on the overhead of indistinguishability obfuscation. Cryptology ePrint Archive, Paper 2024\/1524 (2024). https:\/\/eprint.iacr.org\/2024\/1524"},{"key":"6_CR54","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: On one-way functions and Kolmogorov complexity. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 1243\u20131254. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00118"},{"key":"6_CR55","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: Cryptography from sublinear-time average case hardness of time-bounded Kolmogorov complexity. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pp. 722\u2013735 (2021)","DOI":"10.1145\/3406325.3451121"},{"key":"6_CR56","doi-asserted-by":"crossref","unstructured":"Liu, Y., Pass, R.: On one-way functions and the worst-case hardness of time-bounded Kolmogorov complexity. In: Cryptology ePrint Archive (2023)","DOI":"10.1007\/978-3-031-78011-0_8"},{"key":"6_CR57","unstructured":"Lin, H., Pass, R., Seth, K., Telang, S.: Indistinguishability obfuscation with non-trivial efficiency. Cryptology ePrint Archive, Paper 2016\/006 (2016). https:\/\/eprint.iacr.org\/2016\/006"},{"key":"6_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1007\/978-3-319-63688-7_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"H Lin","year":"2017","unstructured":"Lin, H., Tessaro, S.: Indistinguishability obfuscation from trilinear maps and block-wise local PRGs. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10401, pp. 630\u2013660. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_21"},{"key":"6_CR59","doi-asserted-by":"crossref","unstructured":"Lin, H., Vaikuntanathan, V.: Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 11\u201320. IEEE (2016)","DOI":"10.1109\/FOCS.2016.11"},{"key":"6_CR60","first-page":"632","volume":"2015","author":"M Mahmoody","year":"2015","unstructured":"Mahmoody, M., Mohammed, A., Nematihaji, S.: More on impossibility of virtual black-box obfuscation in idealized models. IACR Cryptol. ePrint Arch. 2015, 632 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"6_CR61","unstructured":"Mazor, N., Pass, R.: Gap MCSP is not (Levin) NP-complete in obfustopia. In: Cryptology ePrint Archive (2024)"},{"key":"6_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-642-11799-2_15","volume-title":"Theory of Cryptography","author":"U Maurer","year":"2010","unstructured":"Maurer, U., Tessaro, S.: A hardcore lemma for computational indistinguishability: security amplification for arbitrarily weak PRGS with optimal stretch. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 237\u2013254. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11799-2_15"},{"key":"6_CR63","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing (STOC), pp. 33\u2013 43 (1989)","DOI":"10.1145\/73007.73011"},{"key":"6_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-662-49096-9_1","volume-title":"Theory of Cryptography","author":"R Pass","year":"2016","unstructured":"Pass, R., Shelat, A.: Impossibility of VBB obfuscation with ideal constant-degree graded encodings. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 3\u201317. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49096-9_1"},{"key":"6_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-662-44371-2_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"R Pass","year":"2014","unstructured":"Pass, R., Seth, K., Telang, S.: Indistinguishability obfuscation from semantically-secure multilinear encodings. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 500\u2013517. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_28"},{"key":"6_CR66","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005, pp. 84\u201393. ACM (2005). https:\/\/doi.org\/10.1145\/1060590.1060603","DOI":"10.1145\/1060590.1060603"},{"key":"6_CR67","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC15, pp. 387\u2013394 (1990)","DOI":"10.1145\/100216.100269"},{"key":"6_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-63248-4_8","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"S Rudich","year":"1997","unstructured":"Rudich, S.: Super-bits, demi-bits, and NP\/qpoly-natural proofs. In: Rolim, J. (ed.) RANDOM 1997. LNCS, vol. 1269, pp. 85\u201393. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-63248-4_8"},{"key":"6_CR69","doi-asserted-by":"crossref","unstructured":"Sipser, M.: A complexity theoretic approach to randomness. In: STOC 2015, pp. 330\u2013335 (1983)","DOI":"10.1145\/800061.808762"},{"key":"6_CR70","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference. Part I. Inf. Control 7(1), 1\u201322 (1964). https:\/\/doi.org\/10.1016\/S0019-9958(64)90223-2. ISSN 0019-9958","DOI":"10.1016\/S0019-9958(64)90223-2"},{"key":"6_CR71","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Proceedings of the Forty Sixth Annual ACM Symposium on Theory of Computing, pp. 475\u2013 484 (2014)","DOI":"10.1145\/2591796.2591825"},{"issue":"4","key":"6_CR72","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/MAHC.1984.10036","volume":"6","author":"BA Trakhtenbrot","year":"1984","unstructured":"Trakhtenbrot, B.A.: A survey of Russian approaches to perebor (brute-force searches) algorithms. Ann. Hist. Comput. 6(4), 384\u2013400 (1984)","journal-title":"Ann. Hist. Comput."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T20:28:23Z","timestamp":1764620903000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-12293-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,2]]},"ISBN":["9783032122926","9783032122933"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-12293-3_6","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"}}]}}