{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:17:06Z","timestamp":1766067426632,"version":"3.45.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"vor","delay-in-days":366,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF"},{"name":"DARPA"},{"name":"ONR"},{"name":"The Simons Foundation"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,11,12]]},"DOI":"10.1145\/3460120.3484539","type":"proceedings-article","created":{"date-parts":[[2021,11,13]],"date-time":"2021-11-13T12:05:34Z","timestamp":1636805134000},"page":"1484-1506","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Secure Complaint-Enabled Source-Tracking for Encrypted Messaging"],"prefix":"10.1145","author":[{"given":"Charlotte","family":"Peale","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Saba","family":"Eskandarian","sequence":"additional","affiliation":[{"name":"UNC Chapel Hill, Chapel Hill, NC, USA"}]},{"given":"Dan","family":"Boneh","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,11,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_5"},{"key":"e_1_3_2_2_2_1","unstructured":"Dan Boneh and Victor Shoup. 2020. A Graduate Course in Applied Cryptography."},{"key":"e_1_3_2_2_3_1","unstructured":"Jan Camenisch and Markus Stadler. 1997. Proof systems for general statements about discrete logarithms. Technical Report\/ETH Zurich Department of Computer Science Vol. 260 (1997)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2660267.2660328"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417887"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/4372.4373"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-020-09360-1"},{"key":"e_1_3_2_2_8_1","volume-title":"Riposte: An Anonymous Messaging System Handling Millions of Users. In 2015 IEEE Symposium on Security and Privacy, SP 2015","author":"Corrigan-Gibbs Henry","year":"2015","unstructured":"Henry Corrigan-Gibbs, Dan Boneh, and David Mazi\u00e8 res. 2015. Riposte: An Anonymous Messaging System Handling Millions of Users. In 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, May 17--21, 2015. IEEE Computer Society, San Jose, 321--338."},{"key":"e_1_3_2_2_9_1","unstructured":"Henry de Valence. 2019. zkp: Experimental zero-knowledge proof compiler in Rust macros. https:\/\/github.com\/hdevalence\/zkp."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-009--9044--3"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1102199.1102216"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96884-1_6"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2808138.2808143"},{"key":"e_1_3_2_2_14_1","first-page":"664","article-title":"Message Franking via Committing Authenticated Encryption","volume":"2017","author":"Grubbs Paul","year":"2017","unstructured":"Paul Grubbs, Jiahui Lu, and Thomas Ristenpart. 2017. Message Franking via Committing Authenticated Encryption. IACR Cryptol. ePrint Arch., Vol. 2017 (2017), 664.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_15_1","unstructured":"Seny Kamara Mallory Knodel Emma Llans\u00f3 Greg Nojeim Lucy Qin Dhanaraj Thakur and Caitlin Vogus. 2021. Outside looking in: Approaches to content moderation in end-to-end encrypted systems. https:\/\/cdt.org\/insights\/outside-looking-in-approaches-to-content-moderation-in-end-to-end-encrypted-systems\/"},{"key":"e_1_3_2_2_16_1","unstructured":"Anunay Kulshrestha and Jonathan Mayer. 2021. Identifying Harmful Media in End-to-End Encrypted Communication: Efficient Private Membership Computation. In USENIX Security. USENIX Virtual Event."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132755"},{"key":"e_1_3_2_2_18_1","volume-title":"XRD: Scalable Messaging System with Cryptographic Privacy. In 17th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2020","author":"Kwon Albert","year":"2020","unstructured":"Albert Kwon, David Lu, and Srinivas Devadas. 2020. XRD: Scalable Messaging System with Cryptographic Privacy. In 17th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2020, Santa Clara, CA, USA, February 25--27, 2020. USENIX, Santa Clara, 759--776."},{"key":"e_1_3_2_2_19_1","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2018","author":"Lazar David","year":"2018","unstructured":"David Lazar, Yossi Gilad, and Nickolai Zeldovich. 2018. Karaoke: Distributed Private Messaging Immune to Passive Traffic Analysis. In 13th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2018, Carlsbad, CA, USA, October 8--10, 2018. USENIX, Carlsbad, 711--725."},{"key":"e_1_3_2_2_20_1","unstructured":"Isis Lovecruft. 2020. ed25519-dalek: Fast and efficient ed25519 signing and verification in Rust. https:\/\/github.com\/dalek-cryptography\/ed25519-dalek."},{"key":"e_1_3_2_2_21_1","unstructured":"Isis Lovecruft and Henry de Valence. 2020. curve25519-dalek: A pure-Rust implementation of group operations on Ristretto and Curve25519. https:\/\/github.com\/dalek-cryptography\/curve25519-dalek."},{"key":"e_1_3_2_2_22_1","unstructured":"Moxie Marlinspike. 2013. Simplifying OTR Deniability."},{"key":"e_1_3_2_2_23_1","volume-title":"Perrin","author":"Marlinspike Movie","year":"2016","unstructured":"Movie Marlinspike and Trevor (ed.) Perrin. 2016. Signal >> Specifications >> The X3DH Key Agreement Protocol. https:\/\/signal.org\/docs\/specifications\/x3dh\/. (Accessed on 09\/03\/2020)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--46766--1_9"},{"key":"e_1_3_2_2_25_1","unstructured":"Trevor Perrin and Moxie Marlinspike. 2016. The Double Ratchet Algorithm. https:\/\/signal.org\/docs\/specifications\/doubleratchet\/."},{"key":"e_1_3_2_2_26_1","unstructured":"Katitza Rodriguez and Seth Schoen. 2020. FAQ: Why Brazil's Plan to Mandate Traceability in Private Messaging Apps Will Break User's Expectation of Privacy and Security. https:\/\/www.eff.org\/deeplinks\/2020\/08\/faq-why-brazils-plan-mandate-traceability-private-messaging-apps-will-break-users."},{"key":"e_1_3_2_2_27_1","unstructured":"Prasanto K Roy. 2019. Why India wants to track WhatsApp messages. https:\/\/www.bbc.com\/news\/world-asia-india-50167569."},{"key":"e_1_3_2_2_28_1","unstructured":"Manish Singh. 2020 a. India likely to force Facebook WhatsApp to identify the originator of messages. https:\/\/techcrunch.com\/2020\/01\/21\/india-likely-to-force-facebook-whatsapp-to-identify-the-originator-of-messages\/."},{"key":"e_1_3_2_2_29_1","unstructured":"Manish Singh. 2020 b. WhatsApp is now delivering roughly 100 billion messages a day. https:\/\/techcrunch.com\/2020\/10\/29\/whatsapp-is-now-delivering-roughly-100-billion-messages-a-day\/."},{"key":"e_1_3_2_2_30_1","unstructured":"Udbhav Tiwari and Jochai Ben-Avie. 2020. Mozilla's analysis: Brazil's fake news law harms privacy security and free expression. https:\/\/blog.mozilla.org\/netpolicy\/2020\/06\/29\/brazils-fake-news-law-harms-privacy-security-and-free-expression\/."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0054019"},{"key":"e_1_3_2_2_32_1","first-page":"565","article-title":"a. Asymmetric Message Franking: Content Moderation for Metadata-Private End-to-End Encryption","volume":"2019","author":"Tyagi Nirvan","year":"2019","unstructured":"Nirvan Tyagi, Paul Grubbs, Julia Len, Ian Miers, and Thomas Ristenpart. 2019 a. Asymmetric Message Franking: Content Moderation for Metadata-Private End-to-End Encryption. IACR Cryptol. ePrint Arch., Vol. 2019 (2019), 565.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319535.3354243"},{"key":"e_1_3_2_2_34_1","volume-title":"SoK: Secure Messaging. In 2015 IEEE Symposium on Security and Privacy. IEEE","author":"Unger Nik","year":"2015","unstructured":"Nik Unger, Sergej Dechand, Joseph Bonneau, Sascha Fahl, Perl Henning, Ian Goldberg, and Matthew Smith. 2015. SoK: Secure Messaging. In 2015 IEEE Symposium on Security and Privacy. IEEE, San Jose, 232--249."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813616"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2018-0003"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815417"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-57878-7_10"},{"key":"e_1_3_2_2_39_1","unstructured":"S.R. Verschoor. 2020. double-ratchet: Pure Rust implementation of the Double Ratchet algorithm. https:\/\/github.com\/sebastianv89\/double-ratchet."}],"event":{"name":"CCS '21: 2021 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event Republic of Korea","acronym":"CCS '21"},"container-title":["Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484539","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484539","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3460120.3484539","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T20:52:35Z","timestamp":1763499155000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3460120.3484539"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,12]]},"references-count":39,"alternative-id":["10.1145\/3460120.3484539","10.1145\/3460120"],"URL":"https:\/\/doi.org\/10.1145\/3460120.3484539","relation":{},"subject":[],"published":{"date-parts":[[2021,11,12]]},"assertion":[{"value":"2021-11-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}