{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:11:26Z","timestamp":1779174686536,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,11,15]],"date-time":"2023-11-15T00:00:00Z","timestamp":1700006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,11,15]]},"DOI":"10.1145\/3576915.3616681","type":"proceedings-article","created":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:35:13Z","timestamp":1700570113000},"page":"1919-1933","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Interactive Proofs For Differentially Private Counting"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6412-844X","authenticated-orcid":false,"given":"Ari","family":"Biswas","sequence":"first","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0698-0922","authenticated-orcid":false,"given":"Graham","family":"Cormode","sequence":"additional","affiliation":[{"name":"Meta AI, Coventry, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,11,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Prio: Privacy preserving aggregate statistics via boolean shares. In Security and Cryptography for Networks. 516--539.","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 Security and Cryptography for Networks. 516--539."},{"key":"e_1_3_2_1_2_1","volume-title":"Helios: Web-based Open-Audit Voting.. In USENIX security symposium","author":"Adida Ben","year":"2008","unstructured":"Ben Adida. 2008. Helios: Web-based Open-Audit Voting.. In USENIX security symposium, Vol. 17. 335--348."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24632-9_31"},{"key":"e_1_3_2_1_4_1","volume-title":"arXiv:1911.06879 [cs]","author":"Balcer Victor","year":"2020","unstructured":"Victor Balcer and Albert Cheu. 2020. Separating Local & Shuffled Differential Privacy via Histograms. arXiv:1911.06879 [cs] (2020). arXiv: 1911.06879."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_22"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Carsten Baum Ivan Damg\u00e5rd and Claudio Orlandi. 2014. Publicly auditable secure multi-party computation. In Security and Cryptography for Networks. 175--196.","DOI":"10.1007\/978-3-319-10879-7_11"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"James Bell Kallista A Bonawitz Adri\u00e0 Gasc\u00f3n Tancr\u00e8de Lepoint and Mariana Raykova. 2020. Secure single-server aggregation with (poly) logarithmic overhead. In ACM CCS. 1253--1269.","DOI":"10.1145\/3372297.3417885"},{"key":"e_1_3_2_1_9_1","volume-title":"Sparse Histograms in the Two-Server Model. Cryptology ePrint Archive","author":"Bell James","year":"2022","unstructured":"James Bell, Adria Gascon, Badih Ghazi, Ravi Kumar, Pasin Manurangsi, Mariana Raykova, and Phillipp Schoppmann. 2022. Distributed, Private, Sparse Histograms in the Two-Server Model. Cryptology ePrint Archive (2022)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345465"},{"key":"e_1_3_2_1_11_1","unstructured":"Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 2019. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali. 351--371."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008908.1008911"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Jonas B\u00f6hler and Florian Kerschbaum. 2021. Secure Multi-party Computation of Differentially Private Heavy Hitters. In ACM CCS. 2361--2377.","DOI":"10.1145\/3460120.3484557"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Dan Boneh Joseph Bonneau Benedikt B\u00fcnz and Ben Fisch. 2018. Verifiable delay functions. In CRYPTO. 757--788.","DOI":"10.1007\/978-3-319-96884-1_25"},{"key":"e_1_3_2_1_15_1","volume-title":"Lightweight Techniques for Private Heavy Hitters. arXiv:2012.14884 [cs]","author":"Boneh Dan","year":"2021","unstructured":"Dan Boneh, Elette Boyle, Henry Corrigan-Gibbs, Niv Gilboa, and Yuval Ishai. 2021. Lightweight Techniques for Private Heavy Hitters. arXiv:2012.14884 [cs] (2021)."},{"key":"e_1_3_2_1_16_1","volume-title":"Differential Perspectives: Epistemic Disconnects Surrounding the US Census Bureau's Use of Differential Privacy. Harvard Data Science Review (Forthcoming)","author":"Sarathy Jayshree","year":"2022","unstructured":"danah boyd and Jayshree Sarathy. 2022. Differential Perspectives: Epistemic Disconnects Surrounding the US Census Bureau's Use of Differential Privacy. Harvard Data Science Review (Forthcoming) (2022)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai. 2016. Function Secret Sharing: Improvements and Extensions. In ACM CCS. 1292--1303.","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-36030-6_14"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_23"},{"key":"e_1_3_2_1_20_1","volume-title":"Bulletproofs: Short proofs for confidential transactions and more","author":"B\u00fcnz Benedikt","year":"2018","unstructured":"Benedikt B\u00fcnz, Jonathan Bootle, Dan Boneh, Andrew Poelstra, Pieter Wuille, and Greg Maxwell. 2018. Bulletproofs: Short proofs for confidential transactions and more. In IEEE S&P. 315--334."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Jeffrey Champion Abhi Shelat and Jonathan Ullman. 2019. Securely sampling biased coins with applications to differential privacy. In ACM CCS. 603--614.","DOI":"10.1145\/3319535.3354256"},{"key":"e_1_3_2_1_22_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_23_1","volume-title":"Manipulation attacks in local differential privacy","author":"Cheu Albert","unstructured":"Albert Cheu, Adam Smith, and Jonathan Ullman. 2021. Manipulation attacks in local differential privacy. In IEEE S&P. 883--900."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Richard Cleve. 1986. Limits on the security of coin flips when half the processors are faulty. In ACM STOC. 364--369.","DOI":"10.1145\/12130.12168"},{"key":"e_1_3_2_1_25_1","volume-title":"Prio: Private, Robust, and Scalable Computation of Aggregate Statistics. arXiv:1703.06255 [cs]","author":"Corrigan-Gibbs Henry","year":"2017","unstructured":"Henry Corrigan-Gibbs and Dan Boneh. 2017. Prio: Private, Robust, and Scalable Computation of Aggregate Statistics. arXiv:1703.06255 [cs] (2017)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Ronald Cramer Ivan Damg\u00e5rd and Berry Schoenmakers. 1994. Proofs of partial knowledge and simplified design of witness hiding protocols. In CRYPTO. 174--187.","DOI":"10.1007\/3-540-48658-5_19"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Ivan Damg\u00e5rd. 2000. Efficient concurrent zero-knowledge in the auxiliary string model. In the Theory and Applications of Cryptographic Techniques. 418--430.","DOI":"10.1007\/3-540-45539-6_30"},{"key":"e_1_3_2_1_28_1","volume-title":"STAR: Distributed Secret Sharing for Private Threshold Aggregation Reporting. arXiv preprint arXiv:2109.10074","author":"Davidson Alex","year":"2021","unstructured":"Alex Davidson, Peter Snyder, EB Quirk, Joseph Genereux, and Benjamin Livshits. 2021. STAR: Distributed Secret Sharing for Private Threshold Aggregation Reporting. arXiv preprint arXiv:2109.10074 (2021)."},{"key":"e_1_3_2_1_29_1","unstructured":"Zeyu Ding Daniel Kifer Thomas Steinke Yuxin Wang Yingtai Xiao Danfeng Zhang et al. 2021. The permute-and-flip mechanism is identical to report-noisy-max with exponential noise. arXiv preprint arXiv:2105.07260 (2021)."},{"key":"e_1_3_2_1_30_1","volume-title":"Line-point zero knowledge and its applications. Cryptology ePrint Archive","author":"Dittmer Samuel","year":"2020","unstructured":"Samuel Dittmer, Yuval Ishai, and Rafail Ostrovsky. 2020. Line-point zero knowledge and its applications. Cryptology ePrint Archive (2020)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Krishnaram Kenthapadi Frank McSherry Ilya Mironov and Moni Naor. 2006 a. Our data ourselves: Privacy via distributed noise generation. In the theory and applications of cryptographic techniques. 486--503.","DOI":"10.1007\/11761679_29"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Frank McSherry Kobbi Nissim and Adam Smith. 2006 b. Calibrating noise to sensitivity in private data analysis. In Theory of cryptography conference. 265--284.","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796553"},{"key":"e_1_3_2_1_34_1","volume-title":"Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity. arXiv:1811.12469 [cs, stat]","author":"Erlingsson \u00dalfar","year":"2020","unstructured":"\u00dalfar Erlingsson, Vitaly Feldman, Ilya Mironov, Ananth Raghunathan, Kunal Talwar, and Abhradeep Thakurta. 2020. Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity. arXiv:1811.12469 [cs, stat] (2020)."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287287"},{"key":"e_1_3_2_1_36_1","volume-title":"On the Power of Multiple Anonymous Messages. arXiv:1908.11358 [cs, stat]","author":"Ghazi Badih","year":"2020","unstructured":"Badih Ghazi, Noah Golowich, Ravi Kumar, Rasmus Pagh, and Ameya Velingker. 2020. On the Power of Multiple Anonymous Messages. arXiv:1908.11358 [cs, stat] (2020)."},{"key":"e_1_3_2_1_37_1","volume-title":"Basic tools digitally print. 1. paperback version ed.).","author":"Goldreich Oded","unstructured":"Oded Goldreich. 2007. Foundations of cryptography. Vol. 1: Basic tools digitally print. 1. paperback version ed.). Vol. 1. Cambridge Univ. Press, Cambridge."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19571-6_25"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/120887631"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3488932.3497758"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00457-5_34"},{"key":"e_1_3_2_1_42_1","unstructured":"Brennan Center For Justice. 2021. Alabama v. U.S. Dept of Commerce. https:\/\/www.brennancenter.org\/our-work\/court-cases\/alabama-v-us-dept-commerce"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/090756090"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Shiva Prasad Kasiviswanathan Mark Rudelson and Adam Smith. 2013. The power of linear reconstruction attacks. In ACM-SIAM SODA. 1415--1433.","DOI":"10.1137\/1.9781611973105.102"},{"key":"e_1_3_2_1_45_1","volume-title":"Preventing Manipulation Attack in Local Differential Privacy Using Verifiable Randomization Mechanism. In IFIP Conf. on Data and Applications Security and Privacy. 43--60","author":"Kato Fumiyuki","year":"2021","unstructured":"Fumiyuki Kato, Yang Cao, and Masatoshi Yoshikawa. 2021. Preventing Manipulation Attack in Local Differential Privacy Using Verifiable Randomization Mechanism. In IFIP Conf. on Data and Applications Security and Privacy. 43--60."},{"key":"e_1_3_2_1_46_1","volume-title":"How to simulate it--a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography","author":"Lindell Yehuda","year":"2017","unstructured":"Yehuda Lindell. 2017. How to simulate it--a tutorial on the simulation proof technique. Tutorials on the Foundations of Cryptography (2017), 277--346."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Ueli Maurer. 2009. Unifying zero-knowledge proofs of knowledge. In Cryptology in Africa. 272--286.","DOI":"10.1007\/978-3-642-02384-2_17"},{"key":"e_1_3_2_1_48_1","volume-title":"The limits of two-party differential privacy","author":"McGregor Andrew","unstructured":"Andrew McGregor, Ilya Mironov, Toniann Pitassi, Omer Reingold, Kunal Talwar, and Salil Vadhan. 2010. The limits of two-party differential privacy. In IEEE FOCS. 81--90."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.66"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_8"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"crossref","unstructured":"Torben Pryds Pedersen. 1991. Non-interactive and information-theoretic secure verifiable secret sharing. In CRYPTO. 129--140.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtrangeo.2021.103020"},{"key":"e_1_3_2_1_53_1","volume-title":"Crypt\u03b5: Crypto-assisted differential privacy on untrusted servers. In ACM SIGMOD. 603--619.","author":"Chowdhury Amrita Roy","year":"2020","unstructured":"Amrita Roy Chowdhury, Chenghong Wang, Xi He, Ashwin Machanavajjhala, and Somesh Jha. 2020. Crypt\u03b5: Crypto-assisted differential privacy on untrusted servers. In ACM SIGMOD. 603--619."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_1_55_1","unstructured":"Justin Thaler. 2020. Proofs arguments and zero-knowledge."},{"key":"e_1_3_2_1_56_1","volume-title":"Tutorials on the Foundations of Cryptography","author":"Vadhan Salil","unstructured":"Salil Vadhan. 2017. The complexity of differential privacy. In Tutorials on the Foundations of Cryptography. Springer, 347--450."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"e_1_3_2_1_58_1","volume-title":"Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits","author":"Weng Chenkai","unstructured":"Chenkai Weng, Kang Yang, Jonathan Katz, and Xiao Wang. 2021. Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for boolean and arithmetic circuits. In IEEE S&P. 1074--1091. io"}],"event":{"name":"CCS '23: ACM SIGSAC Conference on Computer and Communications Security","location":"Copenhagen Denmark","acronym":"CCS '23","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3616681","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3576915.3616681","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T01:39:13Z","timestamp":1755740353000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3576915.3616681"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,15]]},"references-count":58,"alternative-id":["10.1145\/3576915.3616681","10.1145\/3576915"],"URL":"https:\/\/doi.org\/10.1145\/3576915.3616681","relation":{},"subject":[],"published":{"date-parts":[[2023,11,15]]},"assertion":[{"value":"2023-11-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}