SoK on Performance Bounds in Anonymous Communication-Reference-Cited by-同舟云学术

SoK on Performance Bounds in Anonymous Communication

Published:2020-11-09 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 19th Workshop on Privacy in the Electronic Society
language:
Short-container-title:

Author:

Kuhn Christiane¹,Kitzing Friederike²,Strufe Thorsten¹

Affiliation:

1. Karlsruhe Institute of Technology, Karlsruhe, Germany

2. Technical University Dresden, Dresden, Germany

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3411497.3420218

Reference30 articles.

1. 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.

2. 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).

3. 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).

4. 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.

5. 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).