Hayes, J;
Troncoso, C;
Danezis, G;
(2016)
TASP: Towards anonymity sets that persist.
In: Weippl, E and Katzenbeisser, S and De Capitani di Vimercati, S, (eds.)
WPES '16: Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society.
(pp. pp. 177-180).
Association for Computing Machinery (ACM): New York, NY, USA.
Preview |
Text
TASP.pdf - Accepted Version Download (456kB) | Preview |
Abstract
Anonymous communication systems are vulnerable to long term passive "intersection attacks". Not all users of an anonymous communication system will be online at the same time, this leaks some information about who is talking to who. A global passive adversary observing all communications can learn the set of potential recipients of a message with more and more confidence over time. Nearly all deployed anonymous communication tools offer no protection against such attacks. In this work, we introduce TASP, a protocol used by an anonymous communication system that mitigates intersection attacks by intelligently grouping clients together into anonymity sets. We find that with a bandwidth overhead of just 8% we can dramatically extend the time necessary to perform a successful intersection attack.
Type: | Proceedings paper |
---|---|
Title: | TASP: Towards anonymity sets that persist |
Event: | WPES '16: 2016 ACM on Workshop on Privacy in the Electronic Society, 24 October 2016, Vienna, Austria |
ISBN-13: | 9781450345699 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1145/2994620.2994635 |
Publisher version: | https://doi.org/10.1145/2994620.2994635 |
Language: | English |
Additional information: | Copyright © 2016 ACM.Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/1532684 |
Archive Staff Only
View Item |