{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T07:01:52Z","timestamp":1782975712330,"version":"3.54.5"},"reference-count":70,"publisher":"IEEE","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,5,18]]},"DOI":"10.1109\/sp63933.2026.00240","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T19:34:20Z","timestamp":1782934460000},"page":"3185-3203","source":"Crossref","is-referenced-by-count":0,"title":["Code-Based Scalable Collaborative SNARKs"],"prefix":"10.1109","author":[{"given":"Christodoulos","family":"Pappas","sequence":"first","affiliation":[{"name":"HKUST"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dimitrios","family":"Papadopoulos","sequence":"additional","affiliation":[{"name":"HKUST"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charalampos","family":"Papamanthou","sequence":"additional","affiliation":[{"name":"Yale University & Lagrange Labs"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","first-page":"4291","article-title":"Experimenting with collaborative zksnarks: Zero-knowledge proofs for distributed secrets","author":"Ozdemir","year":"2022","journal-title":"USENIX Security"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"key":"ref4","article-title":"PLONK: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge","author":"Gabizon","year":"2019","journal-title":"Cryptology ePrint Archive, Paper 2019\/953"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"ref6","first-page":"2065","article-title":"DFS: delegation-friendly zksnark and private delegation of provers","author":"Hu","year":"2025","journal-title":"USENIX Security"},{"key":"ref7","article-title":"Eos: Efficient private delegation of zksnark provers","author":"Chiesa","year":"2023","journal-title":"USENIX Security"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2025.240152"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-70890-9_10"},{"key":"ref11","first-page":"4427","article-title":"zksaas: Zeroknowledge snarks as a service","author":"Garg","year":"2023","journal-title":"USENIX Sec"},{"key":"ref12","article-title":"Scalable collaborative zk-snark: fully distributed proof generation and malicious security","author":"Liu","year":"2024","journal-title":"Cryptology ePrint Archive"},{"key":"ref13","article-title":"Scalable collaborative {zk-SNARK} and its application to fully distributed proof delegation","author":"Liu","year":"2025","journal-title":"(USENIX Security)"},{"key":"ref14","article-title":"Collaborative zksnarks with sublinear prover time and constant proof size","author":"Fang","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129780"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_13"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0209022"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SP54263.2024.00035"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-91134-7_8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_5"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-91134-7_5"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560652"},{"key":"ref27","article-title":"Frittata: Distributed proof generation of fri-based snarks","author":"Xu","year":"2025","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref28","article-title":"HyperFond: A Transparent and Post-Quantum Distributed SNARK with Polylogarithmic Communication","author":"Yu","year":"2025","journal-title":"Cryptology ePrint"},{"key":"ref29","article-title":"Shred-to-shine metamorphosis in polynomial commitment evolution","author":"Li","year":"2025","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85174-5_14"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_4"},{"key":"ref35","first-page":"24:1","article-title":"Worst-case to average case reductions for the distance to a code","author":"Ben-Sasson","year":"2018","journal-title":"CCC"},{"key":"ref36","first-page":"14:1","article-title":"Fast ReedSolomon Interactive Oracle Proofs of Proximity","author":"Ben-Sasson","year":"2018","journal-title":"ICALP"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"ref38","article-title":"A note on adding zero-knowledge to starks","author":"Hab\u00f6ck","year":"2024","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref39","article-title":"Fiat-shamir from simpler assumptions","author":"Canetti","year":"2018","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3658644.3690318"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_1"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-032-01907-3_13"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39555-5_19"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57339-7_2"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10879-7_11"},{"key":"ref51","article-title":"Publicly auditable garbled circuit","author":"Ling","year":"2025","journal-title":"ePrint Arch."},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-96-0151-6_30"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSPW54576.2021.00048"},{"key":"ref54","first-page":"304","article-title":"Robust local testability of tensor products of ldpc codes","year":"2006","journal-title":"International Workshop on Approximation Algorithms for Combinatorial Optimization"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"ref56","first-page":"291","article-title":"The knowledge complexity of interactive proof-systems (extended abstract)","author":"Goldwasser","year":"1985","journal-title":"ACM STOC"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"ref59","first-page":"1","article-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract)","author":"Ben-Or","year":"1988","journal-title":"ACM STOC"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-015-9214-4"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5_23"},{"key":"ref62","first-page":"1007","article-title":"Scalable multiparty computation from non-linear secret sharing","author":"Garg","year":"2025","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref63","first-page":"4917","article-title":"Hobbit:Space-EfficientzkSNARK with optimal prover time","author":"Pappas","year":"2025","journal-title":"USENIX Security"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-022-01134-z"},{"key":"ref65","first-page":"1595","article-title":"DeepFold: Efficient Multilinear Polynomial Commitment from Reed-Solomon Code and Its Application to Zero-knowledge Proofs","author":"Guo","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-99-8724-5_1"},{"key":"ref67","first-page":"1015","article-title":"Zero-knowledge polynomial commitment in binary fields","author":"Diamond","year":"2025","journal-title":"IACR ePrint"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560652"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1002\/ecjc.4430720906"},{"key":"ref74","article-title":"Building cryptographic proofs from hash functions (2024)","author":"Chiesa"}],"event":{"name":"2026 IEEE Symposium on Security and Privacy (SP)","location":"San Francisco, CA, USA","start":{"date-parts":[[2026,5,18]]},"end":{"date-parts":[[2026,5,21]]}},"container-title":["2026 IEEE Symposium on Security and Privacy (SP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11573355\/11573356\/11573618.pdf?arnumber=11573618","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:30:36Z","timestamp":1782970236000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11573618\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":70,"URL":"https:\/\/doi.org\/10.1109\/sp63933.2026.00240","relation":{},"subject":[],"published":{"date-parts":[[2026,5,18]]}}}