Roger Dingledine commited on 2008-07-14 04:19:07
Zeige 1 geänderte Dateien mit 18 Einfügungen und 16 Löschungen.
... | ... |
@@ -1105,22 +1105,6 @@ than fixed-size windows? That seemed to go well in an <a |
1105 | 1105 |
href="http://www.psc.edu/networking/projects/hpn-ssh/theory.php">ssh |
1106 | 1106 |
throughput experiment</a>. We'll need to measure and tweak, and maybe |
1107 | 1107 |
overhaul if the results are good.</li> |
1108 |
-<li>To let dissidents in remote countries use Tor without being blocked |
|
1109 |
-at their country's firewall, we need a way to get tens of thousands of |
|
1110 |
-relays, not just a few hundred. We can imagine a Tor client GUI that |
|
1111 |
-has a "Tor for Freedom" button at the top that opens a port and relays a |
|
1112 |
-few KB/s of traffic into the Tor network. (A few KB/s shouldn't be too |
|
1113 |
-much hassle, and there are few abuse issues since they're not being exit |
|
1114 |
-nodes.) But how do we distribute a list of these volunteer clients to the |
|
1115 |
-good dissidents in an automated way that doesn't let the country-level |
|
1116 |
-firewalls intercept and enumerate them? This probably needs to work on a |
|
1117 |
-human-trust level. See our <a href="<page documentation>#DesignDoc">early |
|
1118 |
-blocking-resistance design document</a> and our |
|
1119 |
-<a |
|
1120 |
-href="https://wiki.torproject.org/noreply/TheOnionRouter/TorFAQ#BlockingResistance">FAQ |
|
1121 |
-entry</a> on this, and then read the <a |
|
1122 |
-href="http://freehaven.net/anonbib/topic.html#Communications_20Censorship">censorship |
|
1123 |
-resistance section of anonbib</a>.</li> |
|
1124 | 1108 |
<li>Our censorship-resistance goals include preventing |
1125 | 1109 |
an attacker who's looking at Tor traffic on the wire from <a |
1126 | 1110 |
href="https://www.torproject.org/svn/trunk/doc/design-paper/blocking.html#sec:network-fingerprint">distinguishing |
... | ... |
@@ -1159,6 +1143,24 @@ hurt, or not matter? Consider: cookies and recognizing Torbutton users |
1159 | 1143 |
by their rotating UserAgents; malicious websites who only attack certain |
1160 | 1144 |
browsers; and whether the answers to question one impact this answer. |
1161 | 1145 |
</li> |
1146 |
+<li>Right now Tor clients are willing to reuse a given circuit for ten |
|
1147 |
+minutes after it's first used. The goal is to avoid loading down the |
|
1148 |
+network with too many circuit extend operations, yet to also avoid having |
|
1149 |
+clients use the same circuit for so long that the exit node can build a |
|
1150 |
+useful pseudonymous profile of them. Alas, ten minutes is probably way |
|
1151 |
+too long, especially if connections from multiple protocols (e.g. IM and |
|
1152 |
+web browsing) are put on the same circuit. If we keep fixed the overall |
|
1153 |
+number of circuit extends that the network needs to do, are there more |
|
1154 |
+efficient and/or safer ways for clients to allocate streams to circuits, |
|
1155 |
+or for clients to build preemptive circuits? Perhaps this research item |
|
1156 |
+needs to start with gathering some traces of what connections typical |
|
1157 |
+clients try to launch, so you have something realistic to try to optimize. |
|
1158 |
+</li> |
|
1159 |
+<li>How many bridge relays do you need to know to maintain |
|
1160 |
+reachability? We should measure the churn in our bridges. If there is |
|
1161 |
+lots of churn, are there ways to keep bridge users more likely to stay |
|
1162 |
+connected? |
|
1163 |
+</li> |
|
1162 | 1164 |
</ol> |
1163 | 1165 |
|
1164 | 1166 |
<p> |
1165 | 1167 |