|
ABSTRACT
We analyze information leaks in the lookup mechanisms of structured peer-to-peer anonymous communication systems and how these leaks can be used to compromise anonymity. We show that the techniques that are used to combat active attacks on the lookup mechanism dramatically increase information leaks and increase the efficacy of passive attacks. Thus there is a trade-off between robustness to active and passive attacks. We study this trade-off in two P2P anonymous systems, Salsa and AP3. In both cases, we find that, by combining both passive and active attacks, anonymity can be compromised much more effectively than previously thought, rendering these systems insecure for most proposed uses. Our results hold even if security parameters are changed or other improvements to the systems are considered. Our study therefore motivates the search for new approaches to P2P anonymous communication.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
 |
2
|
Kevin Bauer , Damon McCoy , Dirk Grunwald , Tadayoshi Kohno , Douglas Sicker, Low-resource routing attacks against tor, Proceedings of the 2007 ACM workshop on Privacy in electronic society, October 29-29, 2007, Alexandria, Virginia, USA
[doi> 10.1145/1314333.1314336]
|
| |
3
|
S. M. Bellovin and D. A. Wagner, editors. IEEE Symposium on Security and Privacy, May 2003.
|
 |
4
|
Oliver Berthold , Hannes Federrath , Marit Köhntopp, Project “anonymity and unobservability in the Internet”, Proceedings of the tenth conference on Computers, freedom and privacy: challenging the assumptions, p.57-65, April 04-07, 2000, Toronto, Ontario, Canada
[doi> 10.1145/332186.332211]
|
| |
5
|
|
 |
6
|
Nikita Borisov , George Danezis , Prateek Mittal , Parisa Tabriz, Denial of service or denial of security?, Proceedings of the 14th ACM conference on Computer and communications security, October 28-31, 2007, Alexandria, Virginia, USA
[doi> 10.1145/1315245.1315258]
|
 |
7
|
Miguel Castro , Peter Druschel , Ayalvadi Ganesh , Antony Rowstron , Dan S. Wallach, Secure routing for structured peer-to-peer overlay networks, Proceedings of the 5th symposium on Operating systems design and implementation Due to copyright restrictions we are not able to make the PDFs for this conference available for downloading, December 09-11, 2002, Boston, Massachusetts
[doi> 10.1145/1060289.1060317]
|
| |
8
|
G. Ciaccio. Improving sender anonymity in a structured overlay with imprecise routing. In Danezis and Golle {13}, pages 190--207.
|
| |
9
|
|
| |
10
|
G. Danezis. Statistical disclosure attacks: Traffic confirmation in open environments. In Gritzalis, Vimercati, Samarati, and Katsikas, editors, Proceedings of Security and Privacy in the Age of Uncertainty, (SEC2003), pages 421--426, Athens, May 2003. IFIP TC11, Kluwer.
|
| |
11
|
|
| |
12
|
|
| |
13
|
G. Danezis and P. Golle, editors. Sixth Workshop on Privacy Enhancing Technologies, volume 4258 of Lecture Notes in Computer Science, Cambridge, UK, June 2006. Springer.
|
| |
14
|
|
| |
15
|
C. Diaz, S. Seys, J. Claessens, and B. Preneel. Towards measuring anonymity. In Dingledine and Syverson {17}, pages 184--188.
|
| |
16
|
|
| |
17
|
R. Dingledine and P. Syverson, editors. Privacy Enhancing Technologies Workshop, volume 2482 of Lecture Notes in Computer Science. Springer, April 2002.
|
| |
18
|
|
| |
19
|
|
| |
20
|
H. Federrath, editor. International Workshop on Design Issues in Anonymity and Unobservability, volume 2009 of Lecture Notes in Computer Science. Springer, July 2000.
|
 |
21
|
|
| |
22
|
D. Goodin. Tor at heart of embassy passwords leak. The Register, September 10 2007.
|
 |
23
|
|
| |
24
|
M. F. Kaashoek and D. R. Karger. Koorde: A simple degree-optimal distributed hash table. In F. Kaashoek and I. Stoica, editors, International Workshop on Peer-to-Peer Systems (IPTPS), volume 2735 of Lecture Notes in Computer Science, pages 98--107. Springer, Feb. 2003.
|
| |
25
|
A. Kapadia and N. Triandopoulos. Halo: High-assurance locate for distributed hash tables. In C. Cowan and G. Vigna, editors, Network and Distributed System Security Symposium, pages 61--79, Feb. 2008.
|
| |
26
|
|
| |
27
|
N. Mathewson and R. Dingledine. Practical traffic analysis: Extending and resisting statistical disclosure. In D. Martin and A. Serjantov, editors, Workshop on Privacy Enhancing Technologies, volume 3424 of Lecture Notes in Computer Science, pages 17--24. Springer, May 2004.
|
 |
28
|
Alan Mislove , Gaurav Oberoi , Ansley Post , Charles Reis , Peter Druschel , Dan S. Wallach, AP3: cooperative, decentralized anonymous communication, Proceedings of the 11th workshop on ACM SIGOPS European workshop, p.30-es, September 19-22, 2004, Leuven, Belgium
[doi> 10.1145/1133572.1133578]
|
| |
29
|
U. Moller, L. Cottrell, P. Palfrader, and L. Sassaman. Mixmaster Protocol - Version 2. IETF Internet Draft, July 2003.
|
 |
30
|
|
| |
31
|
|
| |
32
|
S. J. Murdoch and P. Zielinski. Sampled traffic analysis by Internet-exchange-level adversaries. In N. Borisov and P. Golle, editors, Privacy Enhancing Technologies Symposium, volume 4776 of Lecture Notes in Computer Science, pages 167--183. Springer, June 2007.
|
| |
33
|
A. Nambiar and M. Wright. The Salsa simulator. http://ranger.uta.edu/~mwright/code/salsa-sims.zip.
|
 |
34
|
|
| |
35
|
|
| |
36
|
Jean-François Raymond, Traffic analysis: protocols, attacks, design issues, and open problems, International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability, p.10-29, January 2001, Berkeley, California, United States
|
 |
37
|
|
 |
38
|
|
| |
39
|
|
| |
40
|
A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In Dingledine and Syverson {17}.
|
| |
41
|
|
| |
42
|
|
| |
43
|
Ion Stoica , Robert Morris , David Liben-Nowell , David R. Karger , M. Frans Kaashoek , Frank Dabek , Hari Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transactions on Networking (TON), v.11 n.1, p.17-32, February 2003
[doi> 10.1109/TNET.2002.808407]
|
| |
44
|
Paul Syverson , Gene Tsudik , Michael Reed , Carl Landwehr, Towards an analysis of onion routing security, International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability, p.96-114, January 2001, Berkeley, California, United States
|
| |
45
|
P. Tabriz and N. Borisov. Breaking the collusion detection mechanism of MorphMix. In Danezis and Golle {13}, pages 368--383.
|
| |
46
|
D. Wallach. A survey of peer-to-peer security issues. In M. Okada, B. Pierce, A. Scedrov, H. Tokuda, and A. Yonezawa, editors, International Symposium on Software Security, volume 2609 of Lecture Notes in Computer Science, pages 253--258. Springer, 2002.
|
| |
47
|
M. Wright, M. Adler, B. N. Levine, and C. Shields. An analysis of the degradation of anonymous protocols. In P. van oorschot and V. Gligor, editors, Network and Distributed System Security Symposium, pages 39--50, Feb. 2002.
|
| |
48
|
|
 |
49
|
|
| |
50
|
R. Wright and S. D. C. di Vimercati, editors. The 13th ACM Conference on Computer and Communications Security, New York, NY, USA, Oct. 2006. ACM.
|
| |
51
|
R. Wright and P. Syverson, editors. The 14th ACM Conference on Computer and Communications Security, New York, NY, USA, 2007. ACM
|
|