{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:05:43Z","timestamp":1755907543513,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":54,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["705007,2128519,2044679,1718074,2338772"],"award-info":[{"award-number":["705007,2128519,2044679,1718074,2338772"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Office of Naval Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690264","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"914-928","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["<scp>Conan:<\/scp>\n            Distributed Proofs of Compliance for Anonymous Data Collection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6034-9245","authenticated-orcid":false,"given":"Mingxun","family":"Zhou","sequence":"first","affiliation":[{"name":"Carnegie Mellon University &amp; IC3, Pittsburgh, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7671-2624","authenticated-orcid":false,"given":"Giulia","family":"Fanti","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University &amp; IC3, Pittsburgh, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5605-1048","authenticated-orcid":false,"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2022. Cobalt: Telemetry with built-in privacy. https:\/\/fuchsia.googlesource.com\/ fuchsia\/\/refs\/heads\/main\/src\/cobalt\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Masayuki Abe. 1999. Mix-Networks on Permutation Networks. In ASIACRYPT."},{"key":"e_1_3_2_1_3_1","volume-title":"Prio: Privacy preserving aggregate statistics via boolean shares","author":"Addanki Surya","year":"2022","unstructured":"Surya Addanki, Kevin Garbe, Eli Jaffe, Rafail Ostrovsky, and Antigoni Polychroniadou. 2022. Prio: Privacy preserving aggregate statistics via boolean shares. In SCN. Springer."},{"key":"e_1_3_2_1_4_1","unstructured":"Martin Albrecht Lorenzo Grassi Christian Rechberger Arnab Roy and Tyge Tiessen. 2016. MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity. Cryptology ePrint Archive Paper 2016\/492. https:\/\/eprint.iacr.org\/2016\/492 https:\/\/eprint.iacr.org\/2016\/492."},{"key":"e_1_3_2_1_5_1","unstructured":"Gosho Aoyama. [n. d.]. Case Closed. https:\/\/en.wikipedia.org\/wiki\/Case_Closed."},{"key":"e_1_3_2_1_6_1","volume-title":"Separating local & shuffled differential privacy via histograms. arXiv preprint arXiv:1911.06879","author":"Balcer Victor","year":"2019","unstructured":"Victor Balcer and Albert Cheu. 2019. Separating local & shuffled differential privacy via histograms. arXiv preprint arXiv:1911.06879 (2019)."},{"key":"e_1_3_2_1_7_1","unstructured":"Borja Balle James Bell Adria Gascon and Kobbi Nissim. 2019. Improved Summation from Shuffling. arXiv:1909.11225 [cs.CR]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Borja Balle James Bell Adria Gasc\u00f3n and Kobbi Nissim. 2020. Private summation in the multi-message shuffle model. In CCS.","DOI":"10.1145\/3372297.3417242"},{"key":"e_1_3_2_1_9_1","volume-title":"ACORN: Input Validation for Secure Aggregation. In USENIX Security.","author":"Bell James","year":"2023","unstructured":"James Bell, Adri\u00e0 Gasc\u00f3n, Tancr\u00e8de Lepoint, Baiyu Li, Sarah Meiklejohn, Mariana Raykova, and Cathie Yun. 2023. ACORN: Input Validation for Secure Aggregation. In USENIX Security."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132769"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5281\/zenodo.5819104"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/54235.54239"},{"key":"e_1_3_2_1_16_1","volume-title":"Differential privacy in the shuffle model: A survey of separations. arXiv preprint arXiv:2107.11839","author":"Cheu Albert","year":"2021","unstructured":"Albert Cheu. 2021. Differential privacy in the shuffle model: A survey of separations. arXiv preprint arXiv:2107.11839 (2021)."},{"key":"e_1_3_2_1_17_1","volume-title":"Shuffle private stochastic convex optimization. arXiv preprint arXiv:2106.09805","author":"Cheu Albert","year":"2021","unstructured":"Albert Cheu, Matthew Joseph, Jieming Mao, and Binghui Peng. 2021. Shuffle private stochastic convex optimization. arXiv preprint arXiv:2106.09805 (2021)."},{"key":"e_1_3_2_1_18_1","volume-title":"14th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2017","author":"Corrigan-Gibbs Henry","year":"2017","unstructured":"Henry Corrigan-Gibbs and Dan Boneh. 2017. Prio: Private, Robust, and Scalable Computation of Aggregate Statistics. In 14th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2017, Boston, MA, USA, March 27--29, 2017. USENIX Association, 259--282."},{"key":"e_1_3_2_1_19_1","unstructured":"Ivan Damg\u00e5rd. [n. d.]. On ? Protocols. https:\/\/www.cs.au.dk\/~ivan\/Sigma.pdf."},{"key":"e_1_3_2_1_20_1","unstructured":"George Danezis and Claudia Diaz. 2008. A Survey of Anonymous Communication Channels. Technical Report MSR-TR-2008--35 Microsoft Research."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2023-0126"},{"key":"e_1_3_2_1_22_1","volume-title":"How to prove any NP statement jointly? Efficient Distributedprover Zero-Knowledge Protocols. PETS","author":"Dayama Pankaj","year":"2022","unstructured":"Pankaj Dayama, Arpita Patra, Protik Paul, Nitin Singh, and Dhinakaran Vinayagamurthy. 2022. How to prove any NP statement jointly? Efficient Distributedprover Zero-Knowledge Protocols. PETS (2022)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA465464"},{"key":"e_1_3_2_1_24_1","volume-title":"Article 5 (Dec.","author":"Edman Matthew","year":"2009","unstructured":"Matthew Edman and B\u00fclent Yener. 2009. On Anonymity in an Electronic Society: A Survey of Anonymous Communication Systems. ACM Comput. Surv. 42, 1, Article 5 (Dec. 2009), 35 pages."},{"key":"e_1_3_2_1_25_1","volume-title":"Clarion: Anonymous communication from multiparty shuffling protocols. Cryptology ePrint Archive","author":"Eskandarian Saba","year":"2021","unstructured":"Saba Eskandarian and Dan Boneh. 2021. Clarion: Anonymous communication from multiparty shuffling protocols. Cryptology ePrint Archive (2021)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1561\/3300000019"},{"key":"e_1_3_2_1_27_1","volume-title":"Conference on the theory and application of cryptographic techniques. Springer, 186--194","author":"Fiat Amos","year":"1986","unstructured":"Amos Fiat and Adi Shamir. 1986. How to prove yourself: Practical solutions to identification and signature problems. In Conference on the theory and application of cryptographic techniques. Springer, 186--194."},{"volume-title":"Proceedings of the 9th ACM Conference on Computer and Communications Security. 193--206","author":"Michael","key":"e_1_3_2_1_28_1","unstructured":"Michael J. Freedman and Robert Morris. 2002. Tarzan: A Peer-to-Peer Anonymizing Network Layer. In Proceedings of the 9th ACM Conference on Computer and Communications Security. 193--206."},{"key":"e_1_3_2_1_29_1","volume-title":"Plonk: Permutations over lagrange-bases for oecumenical noninteractive arguments of knowledge. Cryptology ePrint Archive","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 (2019)."},{"volume-title":"Eurocrypt","author":"Ghazi Badih","key":"e_1_3_2_1_30_1","unstructured":"Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, and Ameya Velingker. 2021. On the power of multiple anonymous messages: Frequency estimation and selection in the shuffle model of differential privacy. In Eurocrypt. Springer."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45724-2_27"},{"key":"e_1_3_2_1_32_1","volume-title":"Suhas Diggavi, Peter Kairouz, and Ananda Theertha Suresh.","author":"Girgis Antonious","year":"2021","unstructured":"Antonious Girgis, Deepesh Data, Suhas Diggavi, Peter Kairouz, and Ananda Theertha Suresh. 2021. Shuffled model of differential privacy in federated learning. In AISTATS."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2024.3366225"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/293411.293443"},{"volume-title":"On the Size of Pairing-Based Non-interactive Arguments","author":"Groth Jens","key":"e_1_3_2_1_35_1","unstructured":"Jens Groth. 2016. On the Size of Pairing-Based Non-interactive Arguments. Springer."},{"key":"e_1_3_2_1_36_1","volume-title":"Efficient Oblivious Sorting and Shuffling for Hardware Enclaves. Cryptology ePrint Archive","author":"Gu Tianyao","year":"2023","unstructured":"Tianyao Gu, Yilei Wang, Bingnan Chen, Afonso Tinoco, Elaine Shi, and Ke Yi. 2023. Efficient Oblivious Sorting and Shuffling for Hardware Enclaves. Cryptology ePrint Archive (2023)."},{"key":"e_1_3_2_1_37_1","volume-title":"ANONIZE: A Large-Scale Anonymous Survey System","author":"Hohenberger Susan","year":"2014","unstructured":"Susan Hohenberger, Steven A. Myers, Rafael Pass, and Abhi Shelat. 2014. ANONIZE: A Large-Scale Anonymous Survey System. In IEEE S & P."},{"volume-title":"Cryptography from anonymity","author":"Ishai Yuval","key":"e_1_3_2_1_38_1","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. 2006. Cryptography from anonymity. In FOCS. IEEE."},{"key":"e_1_3_2_1_39_1","volume-title":"2013 ACM SIGSAC Conference on Computer and Communications Security, CCS'13","author":"Keller Marcel","year":"2013","unstructured":"Marcel Keller, Peter Scholl, and Nigel P. Smart. 2013. An architecture for practical actively secure MPC with dishonest majority. In 2013 ACM SIGSAC Conference on Computer and Communications Security, CCS'13, Berlin, Germany, November 4--8, 2013, Ahmad-Reza Sadeghi, Virgil D. Gligor, and Moti Yung (Eds.). ACM, 549--560."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17053"},{"key":"e_1_3_2_1_41_1","volume-title":"Pianist: Scalable zkRollups via Fully Distributed Zero-Knowledge Proofs. Cryptology ePrint Archive","author":"Liu Tianyi","year":"2023","unstructured":"Tianyi Liu, Tiancheng Xie, Jiaheng Zhang, Dawn Song, and Yupeng Zhang. 2023. Pianist: Scalable zkRollups via Fully Distributed Zero-Knowledge Proofs. Cryptology ePrint Archive (2023)."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653683"},{"key":"e_1_3_2_1_43_1","volume-title":"14th Annual Computer Security Applications Conference (ACSAC 1998","author":"Mu Yi","year":"1998","unstructured":"Yi Mu and Vijay Varadharajan. 1998. Anonymous Secure E-Voting Over a Network. In 14th Annual Computer Security Applications Conference (ACSAC 1998), 7--11 December 1998, Scottsdale, AZ, USA. IEEE Computer Society, 293--299."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","unstructured":"Emmanuela Orsini. 2022. Efficient Actively Secure MPC with a Dishonest Majority: a Survey. Cryptology ePrint Archive Paper 2022\/417. https:\/\/doi.org\/ 10.1007\/978--3-030--68869--1_3 https:\/\/eprint.iacr.org\/2022\/417.","DOI":"10.1007\/978--3-030--68869--1_3"},{"key":"e_1_3_2_1_45_1","unstructured":"Alex Ozdemir and Dan Boneh. 2022. Experimenting with Collaborative {zk- SNARKs}:{Zero-Knowledge} Proofs for Distributed Secrets."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/290163.290168"},{"volume-title":"P5: A Protocol for Scalable Anonymous Communication","author":"Sherwood Rob","key":"e_1_3_2_1_47_1","unstructured":"Rob Sherwood, Bobby Bhattacharjee, and Aravind Srinivasan. 2002. P5: A Protocol for Scalable Anonymous Communication. In IEEE S & P."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77883-5_17"},{"key":"e_1_3_2_1_49_1","volume-title":"Michael Backes, and Claudia Diaz.","author":"Shirazi Fatemeh","year":"2018","unstructured":"Fatemeh Shirazi, Milivoj Simeonovski, Muhammad Rizwan Asghar, Michael Backes, and Claudia Diaz. 2018. A Survey on Routing in Anonymous Communication Protocols. ACM Comput. Surv. 51, 3, Article 51 (June 2018), 39 pages."},{"key":"e_1_3_2_1_50_1","volume-title":"Raluca Ada Popa, and Ion Stoica","author":"Wu Howard","year":"2018","unstructured":"Howard Wu, Wenting Zheng, Alessandro Chiesa, Raluca Ada Popa, and Ion Stoica. 2018. {DIZK}: A distributed zero knowledge proof system. In USENIX Security."},{"key":"e_1_3_2_1_51_1","unstructured":"Tiancheng Xie Jiaheng Zhang Zerui Cheng Fan Zhang Yupeng Zhang Yongzheng Jia Dan Boneh and Dawn Song. 2022. zkbridge: Trustless crosschain bridges made practical. In CCS."},{"key":"e_1_3_2_1_52_1","volume-title":"Condorcet's theory of voting. American Political science review 82, 4","author":"Young H Peyton","year":"1988","unstructured":"H Peyton Young. 1988. Condorcet's theory of voting. American Political science review 82, 4 (1988), 1231--1244."},{"key":"e_1_3_2_1_53_1","volume-title":"Conan: Distributed Proofs of Compliance for Anonymous Data Collection. Cryptology ePrint Archive, Paper 2023\/1900. https:\/\/eprint.iacr.org\/2023\/1900","author":"Zhou Mingxun","year":"2023","unstructured":"Mingxun Zhou, Elaine Shi, and Giulia Fanti. 2023. Conan: Distributed Proofs of Compliance for Anonymous Data Collection. Cryptology ePrint Archive, Paper 2023\/1900. https:\/\/eprint.iacr.org\/2023\/1900"},{"key":"e_1_3_2_1_54_1","volume-title":"Cashmere: Resilient Anonymous Routing. In NSDI.","author":"Zhuang Li","year":"2005","unstructured":"Li Zhuang, Feng Zhou, Ben Y. Zhao, and Antony Rowstron. 2005. Cashmere: Resilient Anonymous Routing. In NSDI."}],"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.3690264","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690264","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:22:36Z","timestamp":1755843756000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":54,"alternative-id":["10.1145\/3658644.3690264","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690264","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"}}]}}