{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T18:40:06Z","timestamp":1755974406186,"version":"3.44.0"},"reference-count":25,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:p>\n            At least since the initial public proposal of public-key cryptography based on computational hardness conjectures, cryptographers have contemplated the possibility of a \"one-way compiler\" that translates computer programs into \"incomprehensible\" but equivalent forms. And yet, the search for such a \"one-way compiler\" remained elusive for decades. We examine a formalization of this concept with the notion of indistinguishability obfuscation\n            <jats:italic toggle=\"yes\">(iO)<\/jats:italic>\n            . Roughly speaking,\n            <jats:italic toggle=\"yes\">iO<\/jats:italic>\n            requires that the compiled versions of any two equivalent programs (with the same size and running time) be indistinguishable from any efficient adversary. Finally, we show how to construct\n            <jats:italic toggle=\"yes\">iO<\/jats:italic>\n            in such a way that we can prove the security of our\n            <jats:italic toggle=\"yes\">iO<\/jats:italic>\n            scheme based on well-studied computational hardness conjectures in cryptography.\n          <\/jats:p>","DOI":"10.1145\/3611095","type":"journal-article","created":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T16:16:20Z","timestamp":1708618580000},"page":"97-105","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Indistinguishability Obfuscation from Well-Founded Assumptions"],"prefix":"10.1145","volume":"67","author":[{"given":"Aayush","family":"Jain","sequence":"first","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}]},{"given":"Huijia","family":"Lin","sequence":"additional","affiliation":[{"name":"UW, Seattle, WA, USA"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"WhibOxContest21---CHES 2021 Challenge. 2021. https:\/\/contest2021.whibox.io\/."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_6"},{"key":"e_1_2_1_5_1","volume-title":"ITCS 2015","author":"Applebaum B.","year":"2015","unstructured":"Applebaum, B., Avron, J., Brzuska, C. Arithmetic cryptography: Extended abstract. In ITCS 2015. T. Roughgarden, ed. (Jan. 2015). ACM, NY, 143--151."},{"key":"e_1_2_1_6_1","volume-title":"FOCS","author":"Applebaum B.","year":"2004","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E. Cryptography in NC0. In FOCS (2004). IEEE Computer Society, NY, 166--175."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_1"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.20"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_24"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243868"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1976.1055638"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.13"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"e_1_2_1_16_1","first-page":"90","volume-title":"Electron. Colloq. Comput Complexity (ECCC) 7","author":"Goldreich O.","year":"2000","unstructured":"Goldreich, O. Candidate one-way functions based on expander graphs. Electron. Colloq. Comput Complexity (ECCC) 7, 90 (2000)."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_32"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451093"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_20"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49387-8_17"},{"key":"e_1_2_1_22_1","volume-title":"44th FOCS (Oct.","author":"Mossel E.","year":"2003","unstructured":"Mossel, E., Shpilka, A., Trevisan, L. On e-biased generators in NC0. In 44th FOCS (Oct. 2003). IEEE Computer Society Press, NY, 136--145."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060603"},{"volume-title":"46th ACM STOC","author":"Sahai A.","key":"e_1_2_1_24_1","unstructured":"Sahai, A., Waters, B. How to use indistinguishability obfuscation: deniable encryption, and more. In 46th ACM STOC. D. B. Shmoys, ed. (May\/June 2014). ACM Press, NY, 475--484."},{"key":"e_1_2_1_25_1","volume-title":"FOCS","author":"Yao A.C.-C.","year":"1986","unstructured":"Yao, A.C.-C. How to generate and exchange secrets (extended abstract). In FOCS (1986), 162--167."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611095","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3611095","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T18:25:35Z","timestamp":1755973535000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3611095"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,22]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["10.1145\/3611095"],"URL":"https:\/\/doi.org\/10.1145\/3611095","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2024,2,22]]},"assertion":[{"value":"2024-02-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}