{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:59:22Z","timestamp":1781078362433,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":68,"publisher":"ACM","funder":[{"name":"NSF","award":["CNS-2154149"],"award-info":[{"award-number":["CNS-2154149"]}]},{"name":"Simons Foundation","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Defense Advanced Research Projects Agency","award":["HR00112020023"],"award-info":[{"award-number":["HR00112020023"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,15]]},"DOI":"10.1145\/3717823.3718104","type":"proceedings-article","created":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:21:27Z","timestamp":1750026087000},"page":"933-943","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Universal SNARGs for NP from Proofs of Correctness"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2233-3768","authenticated-orcid":false,"given":"Zhengzhong","family":"Jin","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9406-7734","authenticated-orcid":false,"given":"Yael Tauman","family":"Kalai","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0471-5379","authenticated-orcid":false,"given":"Alex","family":"Lombardi","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4904-3637","authenticated-orcid":false,"given":"Surya","family":"Mathialagan","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Shweta Agrawal Anuja Modi Anshu Yadav and Shota Yamada. 2025. Evasive LWE: Attacks Variants & Obfustopia. Cryptology ePrint Archive Paper 2025\/375. https:\/\/eprint.iacr.org\/2025\/375"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38551-3_17"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6_15"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188924"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_21"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9241-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.20"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38545-2_9"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055497"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.12"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-0894-2_14"},{"key":"e_1_3_2_1_14_1","unstructured":"Samuel Buss. 1986. Bounded Arithmetic. Bibliopolis Naples Italy."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316380"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_20"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38551-3_20"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_14"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/800116.803756"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649766"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69407-6_21"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236459"},{"key":"e_1_3_2_1_25_1","unstructured":"Nico D\u00f6ttling Abhishek Jain Giulio Malavolta Surya Mathialagan and Vinod Vaikuntanathan. 2025. Simple and General Counterexamples for Private-Coin Evasive LWE. Cryptology ePrint Archive Paper 2025\/374. https:\/\/eprint.iacr.org\/2025\/374"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488667"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993651"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802212"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70936-7_11"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_33_1","unstructured":"Yao-Ching Hsieh Aayush Jain and Huijia Lin. 2025. Lattice-Based Post-Quantum iO from Circular Security with Random Opening Assumption (Part II: zeroizing attacks against private-coin evasive LWE assumptions). Cryptology ePrint Archive Paper 2025\/390. https:\/\/eprint.iacr.org\/2025\/390"},{"key":"e_1_3_2_1_34_1","volume-title":"Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices","author":"Hsieh Yao-Ching","unstructured":"Yao-Ching Hsieh, Huijia Lin, and Ji Luo. 2023. Attribute-Based Encryption for Circuits of Unbounded Depth from Lattices. In IEEE FOCS."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688105"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00100"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451093"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_23"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451055"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649770"},{"key":"e_1_3_2_1_41_1","volume-title":"Alex Lombardi, and Surya Mathialagan.","author":"Jin Zhengzhong","year":"2024","unstructured":"Zhengzhong Jin, Yael Tauman Kalai, Alex Lombardi, and Surya Mathialagan. 2024. Universal SNARGs for NP from Proofs of Correctness. Cryptology ePrint Archive, Paper 2024\/2015. https:\/\/eprint.iacr.org\/2024\/2015"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585200"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30617-4_16"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_4"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316411"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_9"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591809"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90459-3_12"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","unstructured":"Huijia Lin Rafael Pass Karn Seth and Sidharth Telang. 2016. Indistinguishability Obfuscation with Non-trivial Efficiency. In PKC 2016: 19th International Conference on Theory and Practice of Public Key Cryptography Part II Chen-Mou Cheng Kai-Min Chung Giuseppe Persiano and Bo-Yin Yang (Eds.) (Lecture Notes in Computer Science Vol. 9615). Springer Berlin Heidelberg 447\u2013462. https:\/\/doi.org\/10.1007\/978-3-662-49387-8_17 10.1007\/978-3-662-49387-8_17","DOI":"10.1007\/978-3-662-49387-8_17"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_5"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_2"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48184-2_32"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48797-6_6"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.2307\/2269958"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-11(2:8)2015"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591825"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15802-5_19"},{"key":"e_1_3_2_1_61_1","unstructured":"Vinod Vaikuntanathan. 2024. Personal communication."},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22963-3_7"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15979-4_15"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649671"},{"key":"e_1_3_2_1_65_1","volume-title":"Wu","author":"Waters Brent","year":"2024","unstructured":"Brent Waters and David J. Wu. 2024. A Pure Indistinguishability Obfuscation Approach to Adaptively-Sound SNARGs for NP. Cryptology ePrint Archive, Report 2024\/933. https:\/\/eprint.iacr.org\/2024\/933"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_3"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-07085-3_8"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0_16"}],"event":{"name":"STOC '25: 57th Annual ACM Symposium on Theory of Computing","location":"Prague Czechia","acronym":"STOC '25","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 57th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3717823.3718104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T15:38:18Z","timestamp":1750693098000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3717823.3718104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,15]]},"references-count":68,"alternative-id":["10.1145\/3717823.3718104","10.1145\/3717823"],"URL":"https:\/\/doi.org\/10.1145\/3717823.3718104","relation":{},"subject":[],"published":{"date-parts":[[2025,6,15]]},"assertion":[{"value":"2025-06-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}