{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:06Z","timestamp":1750220586972,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T00:00:00Z","timestamp":1604880000000},"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,11,9]]},"DOI":"10.1145\/3411497.3420218","type":"proceedings-article","created":{"date-parts":[[2020,11,9]],"date-time":"2020-11-09T20:59:15Z","timestamp":1604955555000},"page":"21-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["SoK on Performance Bounds in Anonymous Communication"],"prefix":"10.1145","author":[{"given":"Christiane","family":"Kuhn","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friederike","family":"Kitzing","sequence":"additional","affiliation":[{"name":"Technical University Dresden, Dresden, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thorsten","family":"Strufe","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,11,9]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Timothy G Abbott Katherine J Lai Michael R Lieberman and Eric C Price. 2007. Browser-based attacks on Tor. In PoPETs.  Timothy G Abbott Katherine J Lai Michael R Lieberman and Eric C Price. 2007. Browser-based attacks on Tor. In PoPETs."},{"key":"e_1_3_2_1_2_1","volume-title":"On the Complexity of Anonymous Communication Through Public Networks. arXiv preprint arXiv:1902.06306","author":"Ando Megumi","year":"2019","unstructured":"Megumi Ando , Anna Lysyanskaya , and Eli Upfal . 2019. On the Complexity of Anonymous Communication Through Public Networks. arXiv preprint arXiv:1902.06306 ( 2019 ). Megumi Ando, Anna Lysyanskaya, and Eli Upfal. 2019. On the Complexity of Anonymous Communication Through Public Networks. arXiv preprint arXiv:1902.06306 (2019)."},{"key":"e_1_3_2_1_3_1","volume-title":"mboxAnoA: A Framework for Analyzing Anonymous Communication Protocols. Journal of Privacy and Confidentiality","author":"Backes Michael","year":"2017","unstructured":"Michael Backes , Aniket Kate , Praveen Manoharan , Sebastian Meiser , and Esfandiar Mohammadi . 2017. mboxAnoA: A Framework for Analyzing Anonymous Communication Protocols. Journal of Privacy and Confidentiality ( 2017 ). Michael Backes, Aniket Kate, Praveen Manoharan, Sebastian Meiser, and Esfandiar Mohammadi. 2017. mboxAnoA: A Framework for Analyzing Anonymous Communication Protocols. Journal of Privacy and Confidentiality (2017)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Kevin Bauer Damon McCoy Dirk Grunwald Tadayoshi Kohno and Douglas Sicker. 2007. Low-resource routing attacks against tor. In WPES.  Kevin Bauer Damon McCoy Dirk Grunwald Tadayoshi Kohno and Douglas Sicker. 2007. Low-resource routing attacks against tor. In WPES.","DOI":"10.1145\/1314333.1314336"},{"key":"e_1_3_2_1_5_1","volume-title":"The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of cryptology","author":"Chaum David","year":"1988","unstructured":"David Chaum . 1988. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of cryptology ( 1988 ). David Chaum. 1988. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of cryptology (1988)."},{"key":"e_1_3_2_1_6_1","volume-title":"Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM","author":"Chaum David L","year":"1981","unstructured":"David L Chaum . 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM ( 1981 ). David L Chaum. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM (1981)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813628"},{"volume-title":"Private information retrieval","author":"Chor Benny","key":"e_1_3_2_1_8_1","unstructured":"Benny Chor , Oded Goldreich , Eyal Kushilevitz , and Madhu Sudan . 1995. Private information retrieval . In IEEE FOCS. Benny Chor, Oded Goldreich, Eyal Kushilevitz, and Madhu Sudan. 1995. Private information retrieval. In IEEE FOCS."},{"key":"e_1_3_2_1_9_1","volume-title":"Riposte: An anonymous messaging system handling millions of users","author":"Corrigan-Gibbs Henry","year":"2015","unstructured":"Henry Corrigan-Gibbs , Dan Boneh , and David Mazi\u00e8res . 2015 . Riposte: An anonymous messaging system handling millions of users . In IEEE S &P. Henry Corrigan-Gibbs, Dan Boneh, and David Mazi\u00e8res. 2015. Riposte: An anonymous messaging system handling millions of users. In IEEE S&P."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Paul Cuff and Lanqing Yu. 2016. Differential privacy as a mutual information constraint. In ACM SIGSAC.  Paul Cuff and Lanqing Yu. 2016. Differential privacy as a mutual information constraint. In ACM SIGSAC.","DOI":"10.1145\/2976749.2978308"},{"key":"e_1_3_2_1_11_1","volume-title":"mbox","author":"Debajyoti Das","year":"2018","unstructured":"Debajyoti Das et al mbox . 2018 . Anonymity Trilemma : Strong Anonymity, Low Bandwidth Overhead, Low Latency-Choose Two. In IEEE S &P. Debajyoti Das et almbox. 2018. Anonymity Trilemma: Strong Anonymity, Low Bandwidth Overhead, Low Latency-Choose Two. In IEEE S&P."},{"key":"e_1_3_2_1_12_1","volume-title":"mbox","author":"Debajyoti Das","year":"2019","unstructured":"Debajyoti Das et al mbox . 2019 . Not all is lost for anonymity -- but quite a lot is. Coordination among users can help anonymity. In HotPETs . Debajyoti Das et almbox. 2019. Not all is lost for anonymity -- but quite a lot is. Coordination among users can help anonymity. In HotPETs."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA465464"},{"key":"e_1_3_2_1_14_1","volume-title":"On anonymity in an electronic society: A survey of anonymous communication systems. ACM CSUR","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 CSUR ( 2009 ). Matthew Edman and B\u00fclent Yener. 2009. On anonymity in an electronic society: A survey of anonymous communication systems. ACM CSUR (2009)."},{"key":"e_1_3_2_1_15_1","volume-title":"On the Limits of Provable Anonymity. IACR Cryptology ePrint Archive","author":"Gelernter Nethanel","year":"2013","unstructured":"Nethanel Gelernter and Amir Herzberg . 2013. On the Limits of Provable Anonymity. IACR Cryptology ePrint Archive ( 2013 ). Nethanel Gelernter and Amir Herzberg. 2013. On the Limits of Provable Anonymity. IACR Cryptology ePrint Archive (2013)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61996-8_37"},{"key":"e_1_3_2_1_17_1","unstructured":"Alejandro Hevia and Daniele Micciancio. 2008. An indistinguishability-based characterization of anonymous channels. In PETs.  Alejandro Hevia and Daniele Micciancio. 2008. An indistinguishability-based characterization of anonymous channels. In PETs."},{"key":"e_1_3_2_1_18_1","volume-title":"On Privacy Notion in Anonymous Communication. PETs","author":"Kuhn Christiane","year":"2019","unstructured":"Christiane Kuhn , Martin Beck , Stefan Schiffner , Eduard Jorswieck , and Thorsten Strufe . 2019. On Privacy Notion in Anonymous Communication. PETs ( 2019 ). Christiane Kuhn, Martin Beck, Stefan Schiffner, Eduard Jorswieck, and Thorsten Strufe. 2019. On Privacy Notion in Anonymous Communication. PETs (2019)."},{"key":"e_1_3_2_1_19_1","unstructured":"Christiane Kuhn Martin Beck and Thorsten Strufe. 2020. Breaking and (Partially) Fixing Provably Secure Onion Routing. IEEE S&P (2020).  Christiane Kuhn Martin Beck and Thorsten Strufe. 2020. Breaking and (Partially) Fixing Provably Secure Onion Routing. IEEE S&P (2020)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Albert Kwon David Lazar Srinivas Devadas and Bryan Ford. 2016. Riffle. PETs (2016).  Albert Kwon David Lazar Srinivas Devadas and Bryan Ford. 2016. Riffle. PETs (2016).","DOI":"10.1515\/popets-2016-0008"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787491"},{"volume-title":"Low-cost traffic analysis of Tor","author":"Murdoch Steven J","key":"e_1_3_2_1_22_1","unstructured":"Steven J Murdoch and George Danezis . 2005. Low-cost traffic analysis of Tor . In IEEE S &P. Steven J Murdoch and George Danezis. 2005. Low-cost traffic analysis of Tor. In IEEE S&P."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Simon Oya Carmela Troncoso and Fernando P\u00e9rez-Gonz\u00e1lez. 2014. Do dummies pay off? limits of dummy traffic protection in anonymous communications. In PETs.  Simon Oya Carmela Troncoso and Fernando P\u00e9rez-Gonz\u00e1lez. 2014. Do dummies pay off? limits of dummy traffic protection in anonymous communications. In PETs.","DOI":"10.1007\/978-3-319-08506-7_11"},{"key":"e_1_3_2_1_24_1","unstructured":"Ania M Piotrowska Jamie Hayes Tariq Elahi Sebastian Meiser and George Danezis. 2017. The loopix anonymity system. In USENIX.  Ania M Piotrowska Jamie Hayes Tariq Elahi Sebastian Meiser and George Danezis. 2017. The loopix anonymity system. In USENIX."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Tim Ruffing Pedro Moreno-Sanchez and Aniket Kate. 2017. P2P Mixing and Unlinkable Bitcoin Transactions.. In NDSS.  Tim Ruffing Pedro Moreno-Sanchez and Aniket Kate. 2017. P2P Mixing and Unlinkable Bitcoin Transactions.. In NDSS.","DOI":"10.14722\/ndss.2017.23415"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Andrei Serjantov Roger Dingledine and Paul Syverson. 2002. From a trickle to a flood: Active attacks on several mix types. In Information Hiding.  Andrei Serjantov Roger Dingledine and Paul Syverson. 2002. From a trickle to a flood: Active attacks on several mix types. In Information Hiding.","DOI":"10.1007\/3-540-36415-3_3"},{"key":"e_1_3_2_1_27_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 CSUR ( 2018). Fatemeh Shirazi, Milivoj Simeonovski, Muhammad Rizwan Asghar, Michael Backes, and Claudia Diaz. 2018. A survey on routing in anonymous communication protocols. ACM CSUR (2018)."},{"key":"e_1_3_2_1_28_1","volume-title":"The Capacity of Anonymous Communications","author":"Sun Hua","year":"2018","unstructured":"Hua Sun . 2018. The Capacity of Anonymous Communications . IEEE Transactions on Information Theory ( 2018 ). Hua Sun. 2018. The Capacity of Anonymous Communications. IEEE Transactions on Information Theory (2018)."},{"key":"e_1_3_2_1_29_1","volume-title":"mbox","author":"Den Hooff Jelle Van","year":"2015","unstructured":"Jelle Van Den Hooff mbox . 2015 . Vuvuzela : Scalable private messaging resistant to traffic analysis. In ACM SOSP. Jelle Van Den Hooff et almbox. 2015. Vuvuzela: Scalable private messaging resistant to traffic analysis. In ACM SOSP."},{"key":"e_1_3_2_1_30_1","unstructured":"David Isaac Wolinsky Henry Corrigan-Gibbs Bryan Ford and Aaron Johnson. 2012. Dissent in numbers: Making strong anonymity scale. In USENIX.  David Isaac Wolinsky Henry Corrigan-Gibbs Bryan Ford and Aaron Johnson. 2012. Dissent in numbers: Making strong anonymity scale. In USENIX."}],"event":{"name":"CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Virtual Event USA","acronym":"CCS '20"},"container-title":["Proceedings of the 19th Workshop on Privacy in the Electronic Society"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3411497.3420218","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3411497.3420218","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:31:41Z","timestamp":1750195901000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3411497.3420218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,9]]},"references-count":30,"alternative-id":["10.1145\/3411497.3420218","10.1145\/3411497"],"URL":"https:\/\/doi.org\/10.1145\/3411497.3420218","relation":{},"subject":[],"published":{"date-parts":[[2020,11,9]]},"assertion":[{"value":"2020-11-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}