{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T05:52:00Z","timestamp":1780465920409,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":82,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,30]],"date-time":"2020-10-30T00:00:00Z","timestamp":1604016000000},"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":[[2020,10,30]]},"DOI":"10.1145\/3372297.3417261","type":"proceedings-article","created":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T18:27:02Z","timestamp":1604341622000},"page":"1233-1252","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Blinder -- Scalable, Robust Anonymous Committed Broadcast"],"prefix":"10.1145","author":[{"given":"Ittai","family":"Abraham","sequence":"first","affiliation":[{"name":"VMware Research, Herzliya, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Benny","family":"Pinkas","sequence":"additional","affiliation":[{"name":"Bar Ilan University, Ramat Gan, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Avishay","family":"Yanai","sequence":"additional","affiliation":[{"name":"VMware Research, Herzliya, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,11,2]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Srinivas Devadas Danny Dolev Kartik Nayak and Ling Ren. 2019 a. Synchronous Byzantine Agreement with Expected O(1) Rounds Expected O(n(2 )) Communication and Optimal Resilience. In Financial Cryptography and Data Security. 320--334.  Ittai Abraham Srinivas Devadas Danny Dolev Kartik Nayak and Ling Ren. 2019 a. Synchronous Byzantine Agreement with Expected O(1) Rounds Expected O(n(2 )) Communication and Optimal Resilience. In Financial Cryptography and Data Security. 320--334.","DOI":"10.1007\/978-3-030-32101-7_20"},{"key":"e_1_3_2_2_2_1","volume-title":"2019 b. Sync HotStuff: Simple and Practical Synchronous State Machine Replication. ePrint 2019\/270","author":"Abraham Ittai","year":"2019"},{"key":"e_1_3_2_2_3_1","volume-title":"Blinder: MPC Based Scalable and Robust Anonymous Committed Broadcast. eprint archive Report 2020\/248","author":"Abraham Ittai","year":"2020"},{"key":"e_1_3_2_2_4_1","unstructured":"Nikolaos Alexopoulos Aggelos Kiayias Riivo Talviste and Thomas Zacharias. 2017. MCMix: Anonymous Messaging via Secure Multiparty Computation. In USENIX. 1217--1234.  Nikolaos Alexopoulos Aggelos Kiayias Riivo Talviste and Thomas Zacharias. 2017. MCMix: Anonymous Messaging via Secure Multiparty Computation. In USENIX. 1217--1234."},{"key":"e_1_3_2_2_5_1","volume-title":"Setty","author":"Angel Sebastian","year":"2016"},{"key":"e_1_3_2_2_6_1","article-title":"Digital speech and democratic culture: A theory of freedom of expression for the information society","volume":"79","author":"Balkin J.M.","year":"2004","journal-title":"New York University Law Review"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26951-7_22"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"crossref","unstructured":"Zuzana Beerliov\u00e1-Trubiniov\u00e1 and Martin Hirt. 2008. Perfectly-Secure MPC with Linear Communication Complexity. In TCC. 213--230.  Zuzana Beerliov\u00e1-Trubiniov\u00e1 and Martin Hirt. 2008. Perfectly-Secure MPC with Linear Communication Complexity. In TCC. 213--230.","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC. 1--10.  Michael Ben-Or Shafi Goldwasser and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In STOC. 1--10.","DOI":"10.1145\/62212.62213"},{"key":"e_1_3_2_2_10_1","volume-title":"Zerocash: Decentralized Anonymous Payments from Bitcoin","author":"Ben-Sasson Eli","year":"2014"},{"key":"e_1_3_2_2_11_1","volume-title":"Web MIXes: A System for Anonymous and Unobservable Internet Access. In Workshop on Design Issues in Anonymity and Unobservability","author":"Berthold Oliver","year":"2000"},{"key":"e_1_3_2_2_12_1","unstructured":"Oliver Berthold and Heinrich Langos. [n.d.]. Dummy Traffic against Long Term Intersection Attacks. In PET.  Oliver Berthold and Heinrich Langos. [n.d.]. Dummy Traffic against Long Term Intersection Attacks. In PET."},{"key":"e_1_3_2_2_13_1","unstructured":"BitDegree. 2020. Zcash vs. Monero. https:\/\/www.bitdegree.org\/tutorials\/zcash-vs-monero\/  BitDegree. 2020. Zcash vs. Monero. https:\/\/www.bitdegree.org\/tutorials\/zcash-vs-monero\/"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132769"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787491"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Stevens Le Blond David R. Choffnes Wenxuan Zhou Peter Druschel Hitesh Ballani and Paul Francis. 2013. Towards efficient traffic-analysis resistant anonymity networks. In ACM SIGCOMM. 303--314.  Stevens Le Blond David R. Choffnes Wenxuan Zhou Peter Druschel Hitesh Ballani and Paul Francis. 2013. Towards efficient traffic-analysis resistant anonymity networks. In ACM SIGCOMM. 303--314.","DOI":"10.1145\/2486001.2486002"},{"key":"e_1_3_2_2_17_1","volume-title":"Niv Gilboa, and Yuval Ishai.","author":"Boneh Dan","year":"2020"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2015-0008"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Elette Boyle Niv Gilboa and Yuval Ishai. 2016. Function Secret Sharing: Improvements and Extensions. In CCS. 1292--1303.  Elette Boyle Niv Gilboa and Yuval Ishai. 2016. Function Secret Sharing: Improvements and Extensions. In CCS. 1292--1303.","DOI":"10.1145\/2976749.2978429"},{"key":"e_1_3_2_2_20_1","volume-title":"Brijesh Joshi, and Rob Johnson.","author":"Cai Xiang","year":"2012"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358563"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00206326"},{"key":"e_1_3_2_2_23_1","volume-title":"Sherman","author":"Chaum David","year":"2016"},{"key":"e_1_3_2_2_24_1","volume-title":"Talek: Private Group Messaging with Hidden Access Patterns. CoRR","author":"Cheng Raymond","year":"2020"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_13"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Koji Chida Daniel Genkin Koki Hamada Dai Ikarashi Ryo Kikuchi Yehuda Lindell and Ariel Nof. 2018. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In CRYPTO. 34--64.  Koji Chida Daniel Genkin Koki Hamada Dai Ikarashi Ryo Kikuchi Yehuda Lindell and Ariel Nof. 2018. Fast Large-Scale Honest-Majority MPC for Malicious Adversaries. In CRYPTO. 34--64.","DOI":"10.1007\/978-3-319-96878-0_2"},{"key":"e_1_3_2_2_27_1","volume-title":"Birman","author":"Cooper David A.","year":"1995"},{"key":"e_1_3_2_2_28_1","volume-title":"Riposte: An Anonymous Messaging System Handling Millions of Users. In SP. 321--338.","author":"Corrigan-Gibbs Henry","year":"2015"},{"key":"e_1_3_2_2_29_1","unstructured":"cutlass. 2014. CUDA Templates for Linear Algebra Subroutines. https:\/\/github.com\/NVIDIA\/cutlass.  cutlass. 2014. CUDA Templates for Linear Algebra Subroutines. https:\/\/github.com\/NVIDIA\/cutlass."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Ivan Damgard and Jesper Buus Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO. 572--590.  Ivan Damgard and Jesper Buus Nielsen. 2007. Scalable and Unconditionally Secure Multiparty Computation. In CRYPTO. 572--590.","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"e_1_3_2_2_31_1","unstructured":"George Danezis Roger Dingledine and Nick Mathewson. [n.d.]. Mixminion: Design of a Type III Anonymous Remailer Protocol. In (S&P).  George Danezis Roger Dingledine and Nick Mathewson. [n.d.]. Mixminion: Design of a Type III Anonymous Remailer Protocol. In (S&P)."},{"key":"e_1_3_2_2_32_1","volume-title":"Syverson","author":"Dingledine Roger","year":"2004"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"crossref","unstructured":"\u00da lfar Erlingsson Vitaly Feldman Ilya Mironov Ananth Raghunathan Kunal Talwar and Abhradeep Thakurta. 2019. Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity. In SODA. 2468--2479.  \u00da lfar Erlingsson Vitaly Feldman Ilya Mironov Ananth Raghunathan Kunal Talwar and Abhradeep Thakurta. 2019. Amplification by Shuffling: From Local to Central Differential Privacy via Anonymity. In SODA. 2468--2479.","DOI":"10.1137\/1.9781611975482.151"},{"key":"e_1_3_2_2_35_1","volume-title":"Express: Lowering the Cost of Metadata-hiding Communication with Cryptographic Privacy. CoRR","author":"Eskandarian Saba","year":"2019"},{"key":"e_1_3_2_2_36_1","unstructured":"Zcash Foundation. 2019. Zcash Privacy and Security Recommendation. https:\/\/z.cash\/support\/security\/privacy-security-recommendations  Zcash Foundation. 2019. Zcash Privacy and Security Recommendation. https:\/\/z.cash\/support\/security\/privacy-security-recommendations"},{"key":"e_1_3_2_2_37_1","volume-title":"Two-Thirds Honest-Majority MPC for Malicious Adversaries at Almost the Cost of Semi-Honest. ePrint Archive 2019\/658","author":"Furukawa Jun","year":"2019"},{"key":"e_1_3_2_2_38_1","volume-title":"David Isaac Wolinsky, and Bryan Ford","author":"Gibbs Henry Corrigan","year":"2013"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Niv Gilboa and Yuval Ishai. 2014. Distributed Point Functions and Their Applications. In EUROCRYPT. 640--658.  Niv Gilboa and Yuval Ishai. 2014. Distributed Point Functions and Their Applications. In EUROCRYPT. 640--658.","DOI":"10.1007\/978-3-642-55220-5_35"},{"key":"e_1_3_2_2_40_1","first-page":"568","article-title":"SBFT: A Scalable and Decentralized Trust Infrastructure","volume":"2019","author":"Golan-Gueta Guy","year":"2019","journal-title":"DSN"},{"key":"e_1_3_2_2_41_1","volume-title":"Mixing Email with Babel. In 1996 Symposium on Network and Distributed System Security, (S)NDSS '96","author":"G\u00fclc\u00fc Ceki","year":"1996"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Koki Hamada Ryo Kikuchi Dai Ikarashi Koji and KatsuChidami Takahashi. 2012. Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms. In ICISC. 202--216.  Koki Hamada Ryo Kikuchi Dai Ikarashi Koji and KatsuChidami Takahashi. 2012. Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms. In ICISC. 202--216.","DOI":"10.1007\/978-3-642-37682-5_15"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1698750.1698753"},{"key":"e_1_3_2_2_44_1","volume-title":"Dang Vinh Pham, and Dieter Rautenbach","author":"Kesdogan Dogan","year":"2006"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"crossref","unstructured":"Dogan Kesdogan Jan Egner and Roland B\u00fcschkes. 1998. Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System. In Information Hiding. 83--98.  Dogan Kesdogan Jan Egner and Roland B\u00fcschkes. 1998. Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System. In Information Hiding. 83--98.","DOI":"10.1007\/3-540-49380-8_7"},{"key":"e_1_3_2_2_46_1","volume-title":"Dawn Xiaodong Song, and Ke Yang","author":"Kissner Lea","year":"2004"},{"key":"e_1_3_2_2_47_1","volume-title":"Technologies of Protest: Insurgent Social Movements and the First Amendment in the Era of the Internet","author":"Kreimer Seth","year":"2001"},{"key":"e_1_3_2_2_48_1","unstructured":"Albert Kwon Mashael AlSabah David Lazar Marc Dacier and Srinivas Devadas. 2015. Circuit Fingerprinting Attacks: Passive Deanonymization of Tor Hidden Services. In USENIX. 287--302.  Albert Kwon Mashael AlSabah David Lazar Marc Dacier and Srinivas Devadas. 2015. Circuit Fingerprinting Attacks: Passive Deanonymization of Tor Hidden Services. In USENIX. 287--302."},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132755"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1515\/popets-2016-0008","article-title":"Riffle: An Efficient Communication System With Strong Anonymity","volume":"2016","author":"Kwon Albert","year":"2016","journal-title":"PoPETs"},{"key":"e_1_3_2_2_51_1","volume-title":"Karaoke: Distributed Private Messaging Immune to Passive Traffic Analysis. In USENIX. 711--725.","author":"Lazar David","year":"2018"},{"key":"e_1_3_2_2_52_1","volume-title":"Alpenhorn: Bootstrapping Secure Communication without Leaking Metadata. In USENIX. 571--586.","author":"Lazar David","year":"2016"},{"key":"e_1_3_2_2_53_1","volume-title":"USENIX Security Symposium. USENIX Association","author":"Leibowitz Hemi","year":"2019"},{"key":"e_1_3_2_2_54_1","volume-title":"Wright","author":"Levine Brian Neil","year":"2004"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Nick Mathewson and Roger Dingledine. 2004. Practical Traffic Analysis: Extending and Resisting Statistical Disclosure. In PET. 17--34.  Nick Mathewson and Roger Dingledine. 2004. Practical Traffic Analysis: Extending and Resisting Statistical Disclosure. In PET. 17--34.","DOI":"10.1007\/11423409_2"},{"key":"e_1_3_2_2_57_1","unstructured":"Prateek Mittal Femi G. Olumofin Carmela Troncoso Nikita Borisov and Ian Goldberg. 2011. PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval. In USENIX.  Prateek Mittal Femi G. Olumofin Carmela Troncoso Nikita Borisov and Ian Goldberg. 2011. PIR-Tor: Scalable Anonymous Communication Using Private Information Retrieval. In USENIX."},{"key":"e_1_3_2_2_58_1","volume-title":"Pisces: Anonymous Communication Using Social Networks. In NDSS. 1--18.","author":"Mittal Prateek","year":"2013"},{"key":"e_1_3_2_2_59_1","volume-title":"Murdoch and George Danezis","author":"Steven","year":"2005"},{"key":"e_1_3_2_2_60_1","volume-title":"Murdoch and Piotr Zielinski","author":"Steven","year":"2007"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"crossref","unstructured":"Lan Nguyen and Reihaneh Safavi-Naini. 2003. Breaking and Mending Resilient Mix-Nets. In PET. 66--80.  Lan Nguyen and Reihaneh Safavi-Naini. 2003. Breaking and Mending Resilient Mix-Nets. In PET. 66--80.","DOI":"10.1007\/978-3-540-40956-4_5"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"crossref","unstructured":"Andriy Panchenko Lukas Niessen Andreas Zinnen and Thomas Engel. 2011. Website fingerprinting in onion routing based anonymization networks. In ACMWPES. 103--114.  Andriy Panchenko Lukas Niessen Andreas Zinnen and Thomas Engel. 2011. Website fingerprinting in onion routing based anonymization networks. In ACMWPES. 103--114.","DOI":"10.1145\/2046556.2046570"},{"key":"e_1_3_2_2_63_1","doi-asserted-by":"crossref","unstructured":"Birgit Pfitzmann. 1994. Breaking Efficient Anonymous Channel. In EUROCRYPT. 332--340.  Birgit Pfitzmann. 1994. Breaking Efficient Anonymous Channel. In EUROCRYPT. 332--340.","DOI":"10.1007\/BFb0053448"},{"key":"e_1_3_2_2_64_1","doi-asserted-by":"crossref","unstructured":"Birgit Pfitzmann and Andreas Pfitzmann. 1989. How to Break the Direct RSA-Implementation of Mixes. In EUROCRYPT. 373--381.  Birgit Pfitzmann and Andreas Pfitzmann. 1989. How to Break the Direct RSA-Implementation of Mixes. In EUROCRYPT. 373--381.","DOI":"10.1007\/3-540-46885-4_37"},{"key":"e_1_3_2_2_65_1","unstructured":"Ania M. Piotrowska Jamie Hayes Tariq Elahi Sebastian Meiser and George Danezis. 2017. The Loopix Anonymity System. In USENIX Security. 1199--1216.  Ania M. Piotrowska Jamie Hayes Tariq Elahi Sebastian Meiser and George Danezis. 2017. The Loopix Anonymity System. In USENIX Security. 1199--1216."},{"key":"e_1_3_2_2_66_1","volume-title":"Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems. In PET. 10--29.","author":"Raymond Jean-Francois","year":"2000"},{"key":"e_1_3_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.668972"},{"key":"e_1_3_2_2_68_1","doi-asserted-by":"crossref","unstructured":"Len Sassaman Bram Cohen and Nick Mathewson. 2005. The pynchon gate: a secure method of pseudonymous mail retrieval. In WPES. 1--9.  Len Sassaman Bram Cohen and Nick Mathewson. 2005. The pynchon gate: a secure method of pseudonymous mail retrieval. In WPES. 1--9.","DOI":"10.1145\/1102199.1102201"},{"key":"e_1_3_2_2_69_1","volume-title":"Syverson","author":"Serjantov Andrei","year":"2002"},{"key":"e_1_3_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359176"},{"key":"e_1_3_2_2_71_1","volume-title":"Multiparty Routing: Secure Routing for Mixnets. CoRR","author":"Shirazi Fatemeh","year":"2017"},{"key":"e_1_3_2_2_72_1","doi-asserted-by":"crossref","unstructured":"Vitaly Shmatikov and Ming-Hsiu Wang. 2006. Timing Analysis in Low-Latency Mix Networks: Attacks and Defenses. In ESORICS. 18--33.  Vitaly Shmatikov and Ming-Hsiu Wang. 2006. Timing Analysis in Low-Latency Mix Networks: Attacks and Defenses. In ESORICS. 18--33.","DOI":"10.1007\/11863908_2"},{"key":"e_1_3_2_2_73_1","volume-title":"FNT-based Reed-Solomon Erasure Codes. CoRR","author":"Soro Alexandre","year":"2009"},{"key":"e_1_3_2_2_74_1","volume-title":"Anonymous Communication Policies for the Internet: Results and Recommendations of the AAAS Conference. Inf. Soc.","volume":"15","author":"Teich Al","year":"1999"},{"key":"e_1_3_2_2_75_1","volume-title":"Stadium: A Distributed Metadata-Private Messaging System. In SOSP. 423--440.","author":"Tyagi Nirvan","year":"2017"},{"key":"e_1_3_2_2_76_1","doi-asserted-by":"crossref","unstructured":"Jelle van den Hooff David Lazar Matei Zaharia and Nickolai Zeldovich. 2015. Vuvuzela: scalable private messaging resistant to traffic analysis. In SOSP. 137--152.  Jelle van den Hooff David Lazar Matei Zaharia and Nickolai Zeldovich. 2015. Vuvuzela: scalable private messaging resistant to traffic analysis. In SOSP. 137--152.","DOI":"10.1145\/2815400.2815417"},{"key":"e_1_3_2_2_77_1","unstructured":"Nicolas van Saberhagen. 2013. Monero. https:\/\/cryptonote.org\/whitepaper.pdf  Nicolas van Saberhagen. 2013. Monero. https:\/\/cryptonote.org\/whitepaper.pdf"},{"key":"e_1_3_2_2_78_1","doi-asserted-by":"crossref","DOI":"10.2139\/ssrn.200469","volume-title":"Information Privacy, and the Troubling Implications of a Right to Stop People from Speaking About You","author":"Volokh Eugene","year":"1999"},{"key":"e_1_3_2_2_79_1","volume-title":"Nameless in Cyberspac e Anonymity on the Internet","author":"Wallac Jonathan","year":"2019"},{"key":"e_1_3_2_2_80_1","doi-asserted-by":"crossref","unstructured":"Tao Wang and Ian Goldberg. 2013. Improved website fingerprinting on Tor. In ACMWPES. 201--212.  Tao Wang and Ian Goldberg. 2013. Improved website fingerprinting on Tor. In ACMWPES. 201--212.","DOI":"10.1145\/2517840.2517851"},{"key":"e_1_3_2_2_81_1","volume-title":"abs\/1907.10701","author":"Wang Yu","year":"2019"},{"key":"e_1_3_2_2_82_1","volume-title":"Selected Areas in Cryptography Workshop, SAC. 160--175","author":"Wikstr\u00f6m Douglas","year":"2003"},{"key":"e_1_3_2_2_83_1","unstructured":"David Isaac Wolinsky Henry Corrigan-Gibbs Bryan Ford and Aaron Johnson. 2012. Dissent in Numbers: Making Strong Anonymity Scale. In USENIX OSDI. 179--182.  David Isaac Wolinsky Henry Corrigan-Gibbs Bryan Ford and Aaron Johnson. 2012. Dissent in Numbers: Making Strong Anonymity Scale. In USENIX OSDI. 179--182."}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","location":"Virtual Event USA","acronym":"CCS '20","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"]},"container-title":["Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417261","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3372297.3417261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:30Z","timestamp":1750197690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3372297.3417261"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,30]]},"references-count":82,"alternative-id":["10.1145\/3372297.3417261","10.1145\/3372297"],"URL":"https:\/\/doi.org\/10.1145\/3372297.3417261","relation":{},"subject":[],"published":{"date-parts":[[2020,10,30]]},"assertion":[{"value":"2020-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}