Don't clog the queue! Circuit clogging and mitigation in P2P anonymity schemes

9Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.
Get full text

Abstract

At Oakland 2005, Murdoch and Danezis described an attack on the Tor anonymity service that recovers the nodes in a Tor circuit, but not the client. We observe that in a peer-to-peer anonymity scheme, the client is part of the circuit and thus the technique can be of greater significance in this setting. We experimentally validate this conclusion by showing that "circuit clogging" can identify client nodes using the MorphMix peer-to-peer anonymity protocol. We also propose and empirically validate the use of the Stochastic Fair Queueing discipline on outgoing connections as an efficient and low-cost mitigation technique. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

McLachlan, J., & Hopper, N. (2008). Don’t clog the queue! Circuit clogging and mitigation in P2P anonymity schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5143 LNCS, pp. 31–46). https://doi.org/10.1007/978-3-540-85230-8_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free