Message splitting against the partial adversary

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

Abstract

We review threat models used in the evaluation of anonymity systems' vulnerability to traffic analysis. We then suggest that, under the partial adversary model, if multiple packets have to be sent through these systems, more anonymity can be achieved if senders route the packets via different paths. This is in contrast to the normal technique of using the same path for them all. We comment on the implications of this for message-based and connection-based anonymity systems. We then proceed to examine the only remaining traffic analysis attack - one which considers the entire system as a black box. We show that it is more difficult to execute than the literature suggests, and attempt to empirically estimate the parameters of the Mixmaster and the Mixminion systems needed in order to successfully execute the attack. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Serjantov, A., & Murdoch, S. J. (2006). Message splitting against the partial adversary. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3856 LNCS, pp. 26–39). Springer Verlag. https://doi.org/10.1007/11767831_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