Roger Dingledine commited on 2008-04-26 21:38:42
Zeige 1 geänderte Dateien mit 15 Einfügungen und 0 Löschungen.
... | ... |
@@ -1050,6 +1050,21 @@ strategies need to be adjusted for asymmetric links? For example, on |
1050 | 1050 |
asymmetric links, is it actually possible to differentiate client traffic from |
1051 | 1051 |
natural bursts due to their asymmetric capacity? Or is it easier than |
1052 | 1052 |
symmetric links for some other reason?</li> |
1053 |
+<li>Repeat Murdoch and Danezis's <a |
|
1054 |
+href="http://www.cl.cam.ac.uk/~sjm217/projects/anon/#torta">attack from |
|
1055 |
+Oakland 05</a> on the current Tor network. See if you can learn why it |
|
1056 |
+works well on some nodes and not well on others. (My theory is that the |
|
1057 |
+fast nodes with spare capacity resist the attack better.) If that's true, |
|
1058 |
+then experiment with the RelayBandwidthRate and RelayBandwidthBurst |
|
1059 |
+options to run a relay that is used as a client while relaying the |
|
1060 |
+attacker's traffic: as we crank down the RelayBandwidthRate, does the |
|
1061 |
+attack get harder? What's the right ratio of RelayBandwidthRate to |
|
1062 |
+actually capacity? Or is it a ratio at all? While we're at it, does a |
|
1063 |
+much larger set of candidate relays increase the false positive rate |
|
1064 |
+or other complexity for the attack? (The Tor network is now almost two |
|
1065 |
+orders of magnitude larger than it was when they wrote their paper.) Be |
|
1066 |
+sure to read <a href="http://freehaven.net/anonbib/#clog-the-queue">Don't |
|
1067 |
+Clog the Queue</a> too.</li> |
|
1053 | 1068 |
<li>The "routing zones attack": most of the literature thinks of |
1054 | 1069 |
the network path between Alice and her entry node (and between the |
1055 | 1070 |
exit node and Bob) as a single link on some graph. In practice, |
1056 | 1071 |