{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:53:36Z","timestamp":1773237216017,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":106,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T00:00:00Z","timestamp":1623715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,15]]},"DOI":"10.1145\/3406325.3451093","type":"proceedings-article","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T01:26:13Z","timestamp":1623806773000},"page":"60-73","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":195,"title":["Indistinguishability obfuscation from well-founded assumptions"],"prefix":"10.1145","author":[{"given":"Aayush","family":"Jain","sequence":"first","affiliation":[{"name":"University of California at Los Angeles, USA"}]},{"given":"Huijia","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Washington, USA"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[{"name":"University of California at Los Angeles, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Tim Abbot Daniel Kane and Paul Valiant. 2004. On algorithms for nash equilibria. unpublished manuscript. https:\/\/web.mit.edu\/tabbott\/Public\/final.pdf"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_19"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238204"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_10"},{"key":"e_1_3_2_1_7_1","first-page":"2018","article-title":"Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness","volume":"2018","author":"Ananth Prabhanjan","year":"2018","unstructured":"Prabhanjan Ananth, Aayush Jain, and Amit Sahai. 2018. Indistinguishability Obfuscation Without Multilinear Maps: iO from LWE, Bilinear Maps, and Weak Pseudorandomness. IACR Cryptology ePrint Archive, 2018, 2018. Pages 615.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03810-6_17"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214050"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/120884857"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688114"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806714"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28914-9_34"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63688-7_8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00020"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897554"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_19"},{"key":"e_1_3_2_1_18_1","first-page":"2017","article-title":"Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation)","volume":"24","author":"Barak Boaz","year":"2017","unstructured":"Boaz Barak, Zvika Brakerski, Ilan Komargodski, and Pravesh Kothari. 2017. Limits on Low-Degree Pseudorandom Generators (Or: Sum-of-Squares Meets Program Obfuscation). Electronic Colloquium on Computational Complexity (ECCC), 24, 2017. Pages 60.","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_1"},{"key":"e_1_3_2_1_20_1","volume-title":"21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings. Pages 1\u201318","author":"Barak Boaz","year":"2001","unstructured":"Boaz Barak, Oded Goldreich, Russell Impagliazzo, Steven Rudich, Amit Sahai, Salil P. Vadhan, and Ke Yang. 2001. On the (Im)possibility of Obfuscating Programs. In Advances in Cryptology - CRYPTO 2001, 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19-23, 2001, Proceedings. Pages 1\u201318."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_8"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_22"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6_20"},{"key":"e_1_3_2_1_24_1","first-page":"2019","article-title":"In Pursuit of Clarity In Obfuscation","volume":"2019","author":"Bishop Allison","year":"2019","unstructured":"Allison Bishop, Lucas Kowalczyk, Tal Malkin, Valerio Pastro, Mariana Raykova, and Kevin Shi. 2019. In Pursuit of Clarity In Obfuscation. IACR Cryptol. ePrint Arch., 2019, 2019. Pages 463. https:\/\/eprint.iacr.org\/2019\/463","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746574"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.94"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_24"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_30"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-011-0034-0"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"e_1_3_2_1_31_1","volume-title":"USA","author":"Boneh Dan","year":"2018","unstructured":"Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter M. R. Rasmussen, Amit Sahai, Hovav Shacham, and Alexandra Boldyreva. 2018. Threshold Cryptosystems from Threshold Fully Homomorphic Encryption. In Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part I. Lecture Notes in Computer Science. 10991, Springer. Pages 565\u2013596."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_30"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_27"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243868"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354255"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00103"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_4"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090262"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.55"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44371-2_11"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316380"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_3"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_17"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840765"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746621"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46497-7_19"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56784-2_27"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"crossref","unstructured":"Jung Hee Cheon Kyoohyung Han Changmin Lee Hansol Ryu and Damien Stehl\u00e9. 2015. Cryptanalysis of the Multilinear Map over the Integers. In EUROCRYPT.","DOI":"10.1007\/978-3-662-46800-5_1"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316400"},{"key":"e_1_3_2_1_56_1","volume-title":"Rothblum","author":"Choudhuri Arka Rai","year":"2019","unstructured":"Arka Rai Choudhuri, Pavel Hubacek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, and Guy N. Rothblum. 2019. PPAD-Hardness via Iterated Squaring Modulo a Composite. Cryptology ePrint Archive, Report 2019\/667. https:\/\/eprint.iacr.org\/2019\/667"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_14"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Aloni Cohen Justin Holmgren Ryo Nishimaki Vinod Vaikuntanathan and Daniel Wichs. 2016. Watermarking cryptographic capabilities. In STOC.","DOI":"10.1145\/2897518.2897651"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_31"},{"key":"e_1_3_2_1_60_1","volume-title":"Hemanta K. Maji, Eric Miles, Mariana Raykova, Amit Sahai, and Mehdi Tibouchi.","author":"Coron Jean-S\u00e9bastien","year":"2015","unstructured":"Jean-S\u00e9bastien Coron, Craig Gentry, Shai Halevi, Tancr\\`ede Lepoint, Hemanta K. Maji, Eric Miles, Mariana Raykova, Amit Sahai, and Mehdi Tibouchi. 2015. Zeroizing Without Low-Level Zeroes: New MMAP Attacks and Their Limitations. In CRYPTO."},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03329-3_4"},{"key":"e_1_3_2_1_62_1","volume-title":"Jiri Sgall, Ales Pultr, and Petr Kolman.","author":"Cryan Mary","year":"2001","unstructured":"Mary Cryan, Peter Bro Miltersen, Jiri Sgall, Ales Pultr, and Petr Kolman. 2001. On Pseudorandom Generators in NC. In Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings. Lecture Notes in Computer Science. 2136, Springer. Pages 272\u2013284."},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134024"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45727-3_5"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-76581-5_13"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.13"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53008-5_20"},{"key":"e_1_3_2_1_68_1","first-page":"2020","article-title":"Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification","volume":"2020","author":"Gay Romain","year":"2020","unstructured":"Romain Gay, Aayush Jain, Huijia Lin, and Amit Sahai. 2020. Indistinguishability Obfuscation from Simple-to-State Hard Problems: New Assumptions, New Techniques, and Simplification. IACR Cryptol. ePrint Arch., 2020, 2020. Pages 764.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70694-8_22"},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"e_1_3_2_1_75_1","first-page":"90","article-title":"Candidate One-Way Functions Based on Expander Graphs","volume":"7","author":"Goldreich Oded","year":"2000","unstructured":"Oded Goldreich. 2000. Candidate One-Way Functions Based on Expander Graphs. Electronic Colloquium on Computational Complexity (ECCC), 7, 90, 2000.","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-55220-5_32"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_3"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488677"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_25"},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.62"},{"key":"e_1_3_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"e_1_3_2_1_82_1","first-page":"2015","article-title":"Graded Encoding, Variations on a Scheme","volume":"2015","author":"Halevi Shai","year":"2015","unstructured":"Shai Halevi. 2015. Graded Encoding, Variations on a Scheme. IACR Cryptology ePrint Archive, 2015, 2015. Pages 866.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53890-6_24"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_27"},{"key":"e_1_3_2_1_85_1","first-page":"2015","article-title":"Cryptanalysis of GGH Map","volume":"2015","author":"Hu Yupu","year":"2015","unstructured":"Yupu Hu and Huiwen Jia. 2015. Cryptanalysis of GGH Map. IACR Cryptology ePrint Archive, 2015, 2015. Pages 301.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.88"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374438"},{"key":"e_1_3_2_1_88_1","volume-title":"Secure Arithmetic Computation with No Honest Majority. In TCC Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings. Pages 294\u2013314","author":"Ishai Yuval","year":"2009","unstructured":"Yuval Ishai, Manoj Prabhakaran, and Amit Sahai. 2009. Secure Arithmetic Computation with No Honest Majority. In TCC Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings. Pages 294\u2013314."},{"key":"e_1_3_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_9"},{"key":"e_1_3_2_1_90_1","first-page":"2019","article-title":"Simplifying Constructions and Assumptions for i\\mathcal O","volume":"2019","author":"Jain Aayush","year":"2019","unstructured":"Aayush Jain, Huijia Lin, and Amit Sahai. 2019. Simplifying Constructions and Assumptions for i\\mathcal O. IACR Cryptol. ePrint Arch., 2019, 2019. Pages 1252. https:\/\/eprint.iacr.org\/2019\/1252","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_92_1","volume-title":"Dakshita Khurana, and Rachel Zhang.","author":"Jawale Ruta","year":"2020","unstructured":"Ruta Jawale, Yael Tauman Kalai, Dakshita Khurana, and Rachel Zhang. 2020. SNARGs for Bounded Depth Computations and PPAD Hardness from Sub-Exponential LWE. Cryptology ePrint Archive, Report 2020\/980. https:\/\/eprint.iacr.org\/2020\/980"},{"key":"e_1_3_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42033-7_1"},{"key":"e_1_3_2_1_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_8"},{"key":"e_1_3_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6_3"},{"key":"e_1_3_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.47"},{"key":"e_1_3_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45608-8_14"},{"key":"e_1_3_2_1_98_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56620-7_5"},{"key":"e_1_3_2_1_99_1","volume-title":"Allison Bishop Lewko, and Brent Waters","author":"Koppula Venkata","year":"2015","unstructured":"Venkata Koppula, Allison Bishop Lewko, and Brent Waters. 2015. Indistinguishability Obfuscation for Turing Machines with Unbounded Memory. In STOC."},{"key":"e_1_3_2_1_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746614"},{"key":"e_1_3_2_1_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055485"},{"key":"e_1_3_2_1_102_1","first-page":"2018","article-title":"Pseudo Flawed-Smudging Generators and Their Application to Indistinguishability Obfuscation","volume":"2018","author":"Lin Huijia","year":"2018","unstructured":"Huijia Lin and Christian Matt. 2018. Pseudo Flawed-Smudging Generators and Their Application to Indistinguishability Obfuscation. IACR Cryptology ePrint Archive, 2018, 2018. Pages 646.","journal-title":"IACR Cryptology ePrint Archive"},{"key":"e_1_3_2_1_103_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-70500-2_5"},{"key":"e_1_3_2_1_104_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_22"},{"key":"e_1_3_2_1_105_1","doi-asserted-by":"crossref","unstructured":"Eric Miles Amit Sahai and Mark Zhandry. 2016. Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13. In Advances in Cryptology - CRYPTO.","DOI":"10.1007\/978-3-662-53008-5_22"},{"key":"e_1_3_2_1_107_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238188"},{"key":"e_1_3_2_1_108_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2014.9"},{"key":"e_1_3_2_1_109_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_11"},{"key":"e_1_3_2_1_110_1","doi-asserted-by":"crossref","unstructured":"Oded Regev. 2005. On lattices learning with errors random linear codes and cryptography. In STOC. Pages 84\u201393.","DOI":"10.1145\/1060590.1060603"},{"key":"e_1_3_2_1_111_1","volume-title":"Shmoys","author":"Sahai Amit","year":"2014","unstructured":"Amit Sahai, Brent Waters, and David B. Shmoys. 2014. How to use indistinguishability obfuscation: deniable encryption, and more. In STOC. ACM. Pages 475\u2013484. isbn:978-1-4503-2710-7 http:\/\/dl.acm.org\/citation.cfm?id=2591796"},{"key":"e_1_3_2_1_112_1","volume-title":"Dokl. Akad. Nauk SSSR","author":"Varshamov Rom","year":"1957","unstructured":"Rom Varshamov. 1957. Estimate of the number of signals in error correcting codes. Dokl. Akad. Nauk SSSR, 1957."},{"key":"e_1_3_2_1_113_1","first-page":"2020","article-title":"Candidate Obfuscation via Oblivious LWE Sampling","volume":"2020","author":"Wee Hoeteck","year":"2020","unstructured":"Hoeteck Wee and Daniel Wichs. 2020. Candidate Obfuscation via Oblivious LWE Sampling. IACR Cryptol. ePrint Arch., 2020, 2020. Pages 1042. https:\/\/eprint.iacr.org\/2020\/1042","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_1_114_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.61"},{"key":"e_1_3_2_1_115_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_6"}],"event":{"name":"STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing","location":"Virtual Italy","acronym":"STOC '21","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451093","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3406325.3451093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:53Z","timestamp":1750195493000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3406325.3451093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,15]]},"references-count":106,"alternative-id":["10.1145\/3406325.3451093","10.1145\/3406325"],"URL":"https:\/\/doi.org\/10.1145\/3406325.3451093","relation":{},"subject":[],"published":{"date-parts":[[2021,6,15]]},"assertion":[{"value":"2021-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}