{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:00:42Z","timestamp":1760043642505,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":88,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T00:00:00Z","timestamp":1765238400000},"content-version":"vor","delay-in-days":372,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NTT Research"},{"name":"NSF"},{"DOI":"10.13039\/501100006374","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"DARPA"},{"name":"UBRI"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3670322","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"4301-4315","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["zkPi: Proving Lean Theorems in Zero-Knowledge"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-5767-0844","authenticated-orcid":false,"given":"Evan","family":"Laufer","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-6752","authenticated-orcid":false,"given":"Alex","family":"Ozdemir","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0820-0421","authenticated-orcid":false,"given":"Dan","family":"Boneh","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"volume-title":"Interactive theorem proving and program development: Coq-Art: the calculus of inductive constructions","author":"Bertot Yves","key":"e_1_3_2_1_1_1","unstructured":"Yves Bertot and Pierre Cast\u00e9ran. 2013. Interactive theorem proving and program development: Coq-Art: the calculus of inductive constructions. Springer."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21401-6_26"},{"key":"e_1_3_2_1_3_1","volume-title":"Software foundations. Webpage: http:\/\/www.cis.upenn.edu\/bcpierce\/sf\/current\/index.html","author":"Pierce Benjamin C","year":"2010","unstructured":"Benjamin C Pierce, Chris Casinghino, Marco Gaboardi, Michael Greenberg, C\u0103t\u0103lin Hri\u0163cu, Vilhelm Sj\u00f6berg, and Brent Yorgey. 2010. Software foundations. Webpage: http:\/\/www.cis.upenn.edu\/bcpierce\/sf\/current\/index.html (2010)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-016-9241-9"},{"key":"e_1_3_2_1_5_1","volume-title":"SMT proof checking using a logical framework. Formal Methods in System Design","author":"Stump Aaron","year":"2013","unstructured":"Aaron Stump, Duckki Oe, Andrew Reynolds, Liana Hadarean, and Cesare Tinelli. 2013. SMT proof checking using a logical framework. Formal Methods in System Design (2013)."},{"key":"e_1_3_2_1_6_1","volume-title":"The formulae-as-types notion of construction. To HB Curry: essays on combinatory logic, lambda calculus and formalism","author":"Howard William A","year":"1980","unstructured":"William A Howard. 1980. The formulae-as-types notion of construction. To HB Curry: essays on combinatory logic, lambda calculus and formalism, Vol. 44 (1980), 479--490."},{"key":"e_1_3_2_1_7_1","volume-title":"Wahby","author":"Ozdemir Alex","year":"2022","unstructured":"Alex Ozdemir, Fraser Brown, and Riad S. Wahby. 2022. CirC: Compiler infrastructure for proof systems, software verification, and more."},{"key":"e_1_3_2_1_8_1","volume-title":"MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs. In USENIX Security","author":"Kosba Ahmed E.","year":"2020","unstructured":"Ahmed E. Kosba, Dimitrios Papadopoulos, Charalampos Papamanthou, and Dawn Song. 2020. MIRAGE: Succinct Arguments for Randomized Algorithms with Applications to Universal zk-SNARKs. In USENIX Security. USENIX Association, 2129--2146."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Jean-Christophe Filli\u00e2tre and Sylvain Conchon. 2006. Type-safe modular hash-consing. In ML.","DOI":"10.1145\/1159876.1159880"},{"key":"e_1_3_2_1_10_1","unstructured":"Lior Goldberg Shahar Papini and Michael Riabzev. 2021. Cairo -- a Turing-complete STARK-friendly CPU architecture. Cryptology ePrint Archive Report 2021\/1063. https:\/\/eprint.iacr.org\/2021\/1063."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34799-2_4"},{"key":"e_1_3_2_1_12_1","volume-title":"Blumberg","author":"Walfish Michael","year":"2015","unstructured":"Michael Walfish and Andrew J. Blumberg. 2015. Verifying computations without reexecuting them: from theoretical possibility to near practicality. CACM (Feb. 2015)."},{"volume-title":"Making argument systems for outsourced computation practical (sometimes)","author":"Setty Srinath T. V.","key":"e_1_3_2_1_13_1","unstructured":"Srinath T. V. Setty, Richard McPherson, Andrew J. Blumberg, and Michael Walfish. 2012. Making argument systems for outsourced computation practical (sometimes). In NDSS. The Internet Society."},{"volume-title":"USENIX Security,","author":"Setty Srinath T. V.","key":"e_1_3_2_1_14_1","unstructured":"Srinath T. V. Setty, Victor Vu, Nikhil Panpalia, Benjamin Braun, Andrew J. Blumberg, and Michael Walfish. 2012. Taking Proof-Based Verified Computation a Few Steps Closer to Practicality. In USENIX Security,, Tadayoshi Kohno (Ed.). USENIX Association, 253--268."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Srinath Setty Benjamin Braun Victor Vu Andrew J. Blumberg Bryan Parno and Michael Walfish. 2013. Resolving the conflict between generality and plausibility in verified computation. In EuroSys.","DOI":"10.1145\/2465351.2465359"},{"key":"e_1_3_2_1_17_1","unstructured":"Andrew J. Blumberg Justin Thaler Victor Vu and Michael Walfish. 2014. Verifiable computation using multiple provers. Cryptology ePrint Archive Report 2014\/846. https:\/\/eprint.iacr.org\/2014\/846."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"e_1_3_2_1_21_1","volume-title":"PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Cryptology ePrint Archive, Report 2019\/953. https:\/\/eprint.iacr.org\/2019\/953.","author":"Gabizon Ariel","year":"2019","unstructured":"Ariel Gabizon, Zachary J. Williamson, and Oana Ciobotaru. 2019. PLONK: Permutations over Lagrange-bases for Oecumenical Noninteractive arguments of Knowledge. Cryptology ePrint Archive, Report 2019\/953. https:\/\/eprint.iacr.org\/2019\/953."},{"key":"e_1_3_2_1_22_1","volume-title":"Halo: Recursive Proof Composition without a Trusted Setup. Cryptology ePrint Archive, Report 2019\/1021. https:\/\/eprint.iacr.org\/2019\/1021.","author":"Bowe Sean","year":"2019","unstructured":"Sean Bowe, Jack Grigg, and Daira Hopwood. 2019. Halo: Recursive Proof Composition without a Trusted Setup. Cryptology ePrint Archive, Report 2019\/1021. https:\/\/eprint.iacr.org\/2019\/1021."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484556"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00056"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031--15985-5_11"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.48"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Benjamin Braun Ariel J. Feldman Zuocheng Ren Srinath Setty Andrew J. Blumberg and Michael Walfish. 2013. Verifying computations with state. In SOSP. Extended version: http:\/\/eprint.iacr.org\/2013\/356.","DOI":"10.1145\/2517349.2522733"},{"volume-title":"USENIX Security","author":"Ben-Sasson Eli","key":"e_1_3_2_1_29_1","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, and Madars Virza. 2014. Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. In USENIX Security, Kevin Fu and Jaeyeon Jung (Eds.). USENIX Association, 781--796."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44381-1_16"},{"volume-title":"Efficient RAM and control flow in verifiable outsourced computation","author":"Wahby Riad S.","key":"e_1_3_2_1_31_1","unstructured":"Riad S. Wahby, Srinath T. V. Setty, Zuocheng Ren, Andrew J. Blumberg, and Michael Walfish. 2015. Efficient RAM and control flow in verifiable outsourced computation. In NDSS. The Internet Society."},{"key":"e_1_3_2_1_32_1","volume-title":"Z\u00d8: An Optimizing Distributing Zero-Knowledge Compiler. In USENIX Security","author":"Fredrikson Matthew","year":"2014","unstructured":"Matthew Fredrikson and Benjamin Livshits. 2014. Z\u00d8: An Optimizing Distributing Zero-Knowledge Compiler. In USENIX Security, Kevin Fu and Jaeyeon Jung (Eds.). USENIX Association, 909--924."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00013"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00018"},{"volume-title":"ZoKrates--Scalable Privacy-Preserving Off-Chain Computations","author":"Eberhardt Jacob","key":"e_1_3_2_1_36_1","unstructured":"Jacob Eberhardt and Stefan Tai. 2018. ZoKrates--Scalable Privacy-Preserving Off-Chain Computations. In IEEE Blockchain."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP46214.2022.9833782"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Ning Luo Timos Antonopoulos William Harris Ruzica Piskac Eran Tromer and Xiao Wang. 2022. Proving UNSAT in Zero Knowledge. https:\/\/eprint.iacr.org\/2022\/206. To appear in ACM CCS.","DOI":"10.1145\/3548606.3559373"},{"key":"e_1_3_2_1_39_1","volume-title":"Marijn JH Heule, and Warren A Hunt","author":"Wetzler Nathan","year":"2014","unstructured":"Nathan Wetzler, Marijn JH Heule, and Warren A Hunt. 2014. DRAT-trim: Efficient checking and trimming using expressive clausal proofs. In SAT."},{"key":"e_1_3_2_1_40_1","unstructured":"xenaproject. 2018. Learning Lean by example. https:\/\/xenaproject.wordpress.com\/2018\/12\/30\/learning-lean-by-example\/."},{"key":"e_1_3_2_1_41_1","unstructured":"Anne Baanen Alexander Bentkamp Jasmin Blanchette Johannes H\u00f6lzl and Jannis Limperg. 2021. The Hitchhiker's Guide to Logical Verification."},{"key":"e_1_3_2_1_42_1","unstructured":"Srinath Setty Justin Thaler and Riad Wahby. 2023. Customizable constraint systems for succinct arguments. https:\/\/ia.cr\/2023\/552 https:\/\/ia.cr\/2023\/552."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Alex Ozdemir Riad S. Wahby Fraser Brown and Clark Barrett. 2023. Bounded Verification for Finite-Field-Blasting. In CAV.","DOI":"10.1007\/978-3-031-37709-9_8"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/501983.502000"},{"key":"e_1_3_2_1_49_1","unstructured":"Dan Boneh and Victor Shoup. 2021. A graduate course in applied cryptography. Draft 0.6."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422481"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_20"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.5555\/645736.666272"},{"key":"e_1_3_2_1_53_1","unstructured":"Mario Carneiro. 2019. The Type Theory of Lean. Technical Report. Version 1.0."},{"key":"e_1_3_2_1_54_1","unstructured":"Zcash developers. [n. d.]. Bellman Circuit Library and zkSNARK. https:\/\/github.com\/zkcrypto\/bellman."},{"key":"e_1_3_2_1_55_1","unstructured":"relax The Lean Community. [n. d.]. Lean. https:\/\/github.com\/leanprover-community\/lean. Version 3.43.0."},{"key":"e_1_3_2_1_56_1","unstructured":"relax The Lean4 Community. [n. d.]. Lean. https:\/\/github.com\/leanprover\/lean4. Version 4.8.0-rc1."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372885.3373824"},{"key":"e_1_3_2_1_58_1","unstructured":"relax The mathlib Community. [n. d.]. mathlib. https:\/\/github.com\/leanprover-community\/mathlib."},{"key":"e_1_3_2_1_59_1","unstructured":"relax The mathlib4 Community. [n. d.]. mathlib4. https:\/\/github.com\/leanprover-community\/mathlib4."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339820"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_1"},{"key":"e_1_3_2_1_62_1","volume-title":"LURK: Lambda, the Ultimate Recursive Knowledge. Cryptology ePrint Archive, Report 2023\/369. https:\/\/eprint.iacr.org\/2023\/369.","author":"Amin Nada","year":"2023","unstructured":"Nada Amin, John Burnham, Fran\u00e7ois Garillot, Rosario Gennaro, Chhi'm\u00e8d K\u00fcnzang, Daniel Rogozin, and Cameron Wong. 2023. LURK: Lambda, the Ultimate Recursive Knowledge. Cryptology ePrint Archive, Report 2023\/369. https:\/\/eprint.iacr.org\/2023\/369."},{"key":"e_1_3_2_1_63_1","volume-title":"USENIX Security","author":"Ozdemir Alex","year":"2075","unstructured":"Alex Ozdemir, Riad S. Wahby, Barry Whitehat, and Dan Boneh. 2020. Scaling Verifiable Computation Using Efficient Set Accumulators. In USENIX Security. USENIX Association, 2075--2092."},{"key":"e_1_3_2_1_64_1","unstructured":"Tomaz Gomes Mascarenhas. 2023. Lean resolution proofs. https:\/\/github.com\/ufmg-smite\/lean-smt\/blob\/main\/Smt\/Reconstruction\/Certifying\/Resolution.lean."},{"key":"e_1_3_2_1_65_1","volume-title":"The intractability of resolution. Theoretical computer science","author":"Haken Armin","year":"1985","unstructured":"Armin Haken. 1985. The intractability of resolution. Theoretical computer science, Vol. 39 (1985)."},{"key":"e_1_3_2_1_66_1","volume-title":"PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation","author":"Biere Armin","year":"2008","unstructured":"Armin Biere. 2008. PicoSAT essentials. Journal on Satisfiability, Boolean Modeling and Computation (2008)."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3339817"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"e_1_3_2_1_69_1","volume-title":"Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275. https:\/\/eprint.iacr.org\/2020\/1275.","author":"Setty Srinath","year":"2020","unstructured":"Srinath Setty and Jonathan Lee. 2020. Quarks: Quadruple-efficient transparent zkSNARKs. Cryptology ePrint Archive, Report 2020\/1275. https:\/\/eprint.iacr.org\/2020\/1275."},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"e_1_3_2_1_71_1","volume-title":"Wahby","author":"Golovnev Alexander","year":"2021","unstructured":"Alexander Golovnev, Jonathan Lee, Srinath Setty, Justin Thaler, and Riad S. Wahby. 2021. Brakedown: Linear-time and post-quantum SNARKs for R1CS. Cryptology ePrint Archive, Report 2021\/1043. https:\/\/eprint.iacr.org\/2021\/1043."},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"e_1_3_2_1_73_1","unstructured":"Justin Thaler Mike Roberts Michael Mitzenmacher and Hanspeter Pfister. 2012. Verifiable Computation with Massively Parallel Interactive Proofs. In HotCloud."},{"key":"e_1_3_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"e_1_3_2_1_75_1","unstructured":"Xiao Wang Alex J. Malozemoff and Jonathan Katz. [n. d.]. EMP-toolkit: Efficient Multi Party computation toolkit. https:\/\/github.com\/emp-toolkit."},{"key":"e_1_3_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3243734.3243823"},{"key":"e_1_3_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45727-3_19"},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417283"},{"key":"e_1_3_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00089"},{"key":"e_1_3_2_1_80_1","volume-title":"LURK: Lambda, the Ultimate Recursive Knowledge. https:\/\/ia.cr\/2023\/369.","author":"Amin Nada","year":"2023","unstructured":"Nada Amin, John Burnham, Fran\u00e7ois Garillot, Rosario Gennaro, Chhi'm\u00e8d K\u00fcnzang, Daniel Rogozin, and Cameron Wong. 2023. LURK: Lambda, the Ultimate Recursive Knowledge. https:\/\/ia.cr\/2023\/369."},{"key":"e_1_3_2_1_81_1","volume-title":"ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge. https:\/\/ia.cr\/2023\/1762.","author":"Luick Daniel","year":"2023","unstructured":"Daniel Luick, John Kolesar, Timos Antonopoulos, William R. Harris, James Parker, Ruzica Piskac, Eran Tromer, Xiao Wang, and Ning Luo. 2023. ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge. https:\/\/ia.cr\/2023\/1762."},{"key":"e_1_3_2_1_82_1","volume-title":"SMT proof checking using a logical framework. Formal Methods in System Design","author":"Stump Aaron","year":"2013","unstructured":"Aaron Stump, Duckki Oe, Andrew Reynolds, Liana Hadarean, and Cesare Tinelli. 2013. SMT proof checking using a logical framework. Formal Methods in System Design (2013)."},{"key":"e_1_3_2_1_83_1","doi-asserted-by":"crossref","unstructured":"Liana Hadarean Clark Barrett Andrew Reynolds Cesare Tinelli and Morgan Deters. 2015. Fine grained SMT proofs for the theory of fixed-width bit-vectors. In LPAR.","DOI":"10.1007\/978-3-662-48899-7_24"},{"key":"e_1_3_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/1670412.1670414"},{"key":"e_1_3_2_1_85_1","unstructured":"Ning Luo Samuel Judson Timos Antonopoulos Ruzica Piskac and Xiao Wang. 2022. ppSAT: Towards Two-Party Private SAT Solving. https:\/\/eprint.iacr.org\/2021\/1584. To appear in USENIX Security."},{"key":"e_1_3_2_1_86_1","doi-asserted-by":"crossref","unstructured":"Samuel Judson Ning Luo Timos Antonopoulos and Ruzica Piskac. 2020. Privacy Preserving CTL Model Checking through Oblivious Graph Algorithms. In WPES.","DOI":"10.1145\/3411497.3420212"},{"key":"e_1_3_2_1_87_1","doi-asserted-by":"crossref","unstructured":"Zhiyong Fang David Darais Joseph P Near and Yupeng Zhang. 2021. Zero Knowledge Static Program Analysis. In CCS.","DOI":"10.1145\/3460120.3484795"},{"key":"e_1_3_2_1_88_1","doi-asserted-by":"crossref","unstructured":"Evan Laufer Alex Ozdemir and Dan Boneh. 2024. zkPi: Proving Lean Theorems in Zero-Knowledge. Full Version https:\/\/eprint.iacr.org\/2024\/267.","DOI":"10.1145\/3658644.3670322"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Salt Lake City UT USA","acronym":"CCS '24"},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670322","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670322","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3670322","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:19:04Z","timestamp":1755843544000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3670322"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":88,"alternative-id":["10.1145\/3658644.3670322","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3670322","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}