challenges.tex 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560
  1. \documentclass{llncs}
  2. \usepackage{url}
  3. \usepackage{amsmath}
  4. \usepackage{epsfig}
  5. \newenvironment{tightlist}{\begin{list}{$\bullet$}{
  6. \setlength{\itemsep}{0mm}
  7. \setlength{\parsep}{0mm}
  8. % \setlength{\labelsep}{0mm}
  9. % \setlength{\labelwidth}{0mm}
  10. % \setlength{\topsep}{0mm}
  11. }}{\end{list}}
  12. \begin{document}
  13. \title{Challenges in practical low-latency stream anonymity (DRAFT)}
  14. \author{Roger Dingledine and Nick Mathewson}
  15. \institute{The Free Haven Project\\
  16. \email{\{arma,nickm\}@freehaven.net}}
  17. \maketitle
  18. \pagestyle{empty}
  19. \begin{abstract}
  20. foo
  21. \end{abstract}
  22. \section{Introduction}
  23. Tor is a low-latency anonymous communication overlay network
  24. \cite{tor-design} designed to be practical and usable for securing TCP
  25. streams over the Internet. We have been operating a publicly deployed
  26. Tor network since October 2003.
  27. Tor aims to resist observers and insiders by distributing each transaction
  28. over several nodes in the network. This ``distributed trust'' approach
  29. means the Tor network can be safely operated and used by a wide variety
  30. of mutually distrustful users, providing more sustainability and security
  31. than previous attempts at anonymizing networks.
  32. The Tor network has a broad range of users, including ordinary citizens
  33. who want to avoid being profiled for targeted advertisements, corporations
  34. who don't want to reveal information to their competitors, and law
  35. enforcement and government intelligence agencies who need
  36. to do operations on the Internet without being noticed.
  37. Tor has been funded by the U.S. Navy, for use in securing government
  38. communications, and also by the Electronic Frontier Foundation, for use
  39. in maintaining civil liberties for ordinary citizens online. The Tor
  40. protocol is one of the leading choices
  41. to be the anonymizing layer in the European Union's PRIME directive to
  42. help maintain privacy in Europe. The University of Dresden in Germany
  43. has integrated an independent implementation of the Tor protocol into
  44. their popular Java Anon Proxy anonymizing client. This wide variety of
  45. interests helps maintain both the stability and the security of the
  46. network.
  47. Tor has a weaker threat model than many anonymity designs in the
  48. literature. This is because we our primary requirements are to have a
  49. practical and useful network, and from there we aim to provide as much
  50. anonymity as we can.
  51. %need to discuss how we take the approach of building the thing, and then
  52. %assuming that, how much anonymity can we get. we're not here to model or
  53. %to simulate or to produce equations and formulae. but those have their
  54. %roles too.
  55. This paper aims to give the reader enough information to understand the
  56. technical and policy issues that Tor faces as we continue deployment,
  57. and to lay a research agenda for others to help in addressing some of
  58. these issues. Section \ref{sec:what-is-tor} gives an overview of the Tor
  59. design and ours goals. We go on in Section \ref{sec:related} to describe
  60. Tor's context in the anonymity space. Sections \ref{sec:crossroads-policy}
  61. and \ref{sec:crossroads-technical} describe the practical challenges,
  62. both policy and technical respectively, that stand in the way of moving
  63. from a practical useful network to a practical useful anonymous network.
  64. \section{What Is Tor}
  65. \label{sec:what-is-tor}
  66. \subsection{Distributed trust: safety in numbers}
  67. Tor provides \emph{forward privacy}, so that users can connect to
  68. Internet sites without revealing their logical or physical locations
  69. to those sites or to observers. It also provides \emph{location-hidden
  70. services}, so that critical servers can support authorized users without
  71. giving adversaries an effective vector for physical or online attacks.
  72. Our design provides this protection even when a portion of its own
  73. infrastructure is controlled by an adversary.
  74. To make private connections in Tor, users incrementally build a path or
  75. \emph{circuit} of encrypted connections through servers on the network,
  76. extending it one step at a time so that each server in the circuit only
  77. learns which server extended to it and which server it has been asked
  78. to extend to. The client negotiates a separate set of encryption keys
  79. for each step along the circuit.
  80. Once a circuit has been established, the client software waits for
  81. applications to request TCP connections, and directs these application
  82. streams along the circuit. Many streams can be multiplexed along a single
  83. circuit, so applications don't need to wait for keys to be negotiated
  84. every time they open a connection. Because each server sees no
  85. more than one end of the connection, a local eavesdropper or a compromised
  86. server cannot use traffic analysis to link the connection's source and
  87. destination. The Tor client software rotates circuits periodically
  88. to prevent long-term linkability between different actions by a
  89. single user.
  90. Tor differs from other deployed systems for traffic analysis resistance
  91. in its security and flexibility. Mix networks such as Mixmaster or its
  92. successor Mixminion \cite{minion-design}
  93. gain the highest degrees of anonymity at the expense of introducing highly
  94. variable delays, thus making them unsuitable for applications such as web
  95. browsing that require quick response times. Commercial single-hop proxies
  96. such as {\url{anonymizer.com}} present a single point of failure, where
  97. a single compromise can expose all users' traffic, and a single-point
  98. eavesdropper can perform traffic analysis on the entire network.
  99. Also, their proprietary implementations place any infrastucture that
  100. depends on these single-hop solutions at the mercy of their providers'
  101. financial health. Tor can handle any TCP-based protocol, such as web
  102. browsing, instant messaging and chat, and secure shell login; and it is
  103. the only implemented anonymizing design with an integrated system for
  104. secure location-hidden services.
  105. No organization can achieve this security on its own. If a single
  106. corporation or government agency were to build a private network to
  107. protect its operations, any connections entering or leaving that network
  108. would be obviously linkable to the controlling organization. The members
  109. and operations of that agency would be easier, not harder, to distinguish.
  110. Instead, to protect our networks from traffic analysis, we must
  111. collaboratively blend the traffic from many organizations and private
  112. citizens, so that an eavesdropper can't tell which users are which,
  113. and who is looking for what information. By bringing more users onto
  114. the network, all users become more secure \cite{econymics}.
  115. Naturally, organizations will not want to depend on others for their
  116. security. If most participating providers are reliable, Tor tolerates
  117. some hostile infiltration of the network. For maximum protection,
  118. the Tor design includes an enclave approach that lets data be encrypted
  119. (and authenticated) end-to-end, so high-sensitivity users can be sure it
  120. hasn't been read or modified. This even works for Internet services that
  121. don't have built-in encryption and authentication, such as unencrypted
  122. HTTP or chat, and it requires no modification of those services to do so.
  123. weasel's graph of \# nodes and of bandwidth, ideally from week 0.
  124. Tor has the following goals.
  125. and we made these assumptions when trying to design the thing.
  126. \section{Tor's position in the anonymity field}
  127. \label{sec:related}
  128. There are many other classes of systems: single-hop proxies, open proxies,
  129. jap, mixminion, flash mixes, freenet, i2p, mute/ants/etc, tarzan,
  130. morphmix, freedom. Give brief descriptions and brief characterizations
  131. of how we differ. This is not the breakthrough stuff and we only have
  132. a page or two for it.
  133. have a serious discussion of morphmix's assumptions, since they would
  134. seem to be the direct competition. in fact tor is a flexible architecture
  135. that would encompass morphmix, and they're nearly identical except for
  136. path selection and node discovery. and the trust system morphmix has
  137. seems overkill (and/or insecure) based on the threat model we've picked.
  138. \section{Threat model}
  139. discuss $\frac{c^2}{n^2}$, except how in practice the chance of owning
  140. the last hop is not c/n since that doesn't take the destination (website)
  141. into account. so in cases where the adversary does not also control the
  142. final destination we're in good shape, but if he *does* then we'd be better
  143. off with a system that lets each hop choose a path.
  144. in practice tor's threat model is based entirely on the goal of dispersal
  145. and diversity. george and steven describe an attack \cite{draft} that
  146. lets them determine the nodes used in a circuit; yet they can't identify
  147. alice or bob through this attack. so it's really just the endpoints that
  148. remain secure. and the enclave model seems particularly threatened by
  149. this, since this attack lets us identify endpoints when they're servers.
  150. see \ref{subsec:helper-nodes} for discussion of some ways to address this
  151. issue.
  152. see \ref{subsec:routing-zones} for discussion of larger
  153. adversaries and our dispersal goals.
  154. \section{Crossroads: Policy issues}
  155. \label{sec:crossroads-policy}
  156. Many of the issues the Tor project needs to address are not just a
  157. matter of system design or technology development. In particular, the
  158. Tor project's \emph{image} with respect to its users and the rest of
  159. the Internet impacts the security it can provide.
  160. As an example to motivate this section, some U.S.~Department of Enery
  161. penetration testing engineers are tasked with compromising DoE computers
  162. from the outside. They only have a limited number of ISPs from which to
  163. launch their attacks, and they found that the defenders were recognizing
  164. attacks because they came from the same IP space. These engineers wanted
  165. to use Tor to hide their tracks. First, from a technical standpoint,
  166. Tor does not support the variety of IP packets they would like to use in
  167. such attacks (see Section \ref{subsec:ip-vs-tcp}). But aside from this,
  168. we also decided that it would probably be poor precedent to encourage
  169. such use -- even legal use that improves national security -- and managed
  170. to dissuade them.
  171. With this image issue in mind, here we discuss the Tor user base and
  172. Tor's interaction with other services on the Internet.
  173. \subsection{Usability}
  174. Usability: fc03 paper was great, except the lower latency you are the
  175. less useful it seems it is.
  176. A Tor gui, how jap's gui is nice but does not reflect the security
  177. they provide.
  178. Public perception, and thus advertising, is a security parameter.
  179. \subsection{Image, usability, and sustainability}
  180. Image: substantial non-infringing uses. Image is a security parameter,
  181. since it impacts user base and perceived sustainability.
  182. Sustainability. Previous attempts have been commercial which we think
  183. adds a lot of unnecessary complexity and accountability. Freedom didn't
  184. collect enough money to pay its servers; JAP bandwidth is supported by
  185. continued money, and they periodically ask what they will do when it
  186. dries up.
  187. good uses are kept private, bad uses are publicized. not good.
  188. \subsection{Reputability}
  189. Yet another factor in the safety of a given network is its reputability:
  190. the perception of its social value based on its current users. If I'm
  191. the only user of a system, it might be socially accepted, but I'm not
  192. getting any anonymity. Add a thousand Communists, and I'm anonymous,
  193. but everyone thinks I'm a Commie. Add a thousand random citizens (cancer
  194. survivors, privacy enthusiasts, and so on) and now I'm hard to profile.
  195. The more cancer survivors on Tor, the better for the human rights
  196. activists. The more script kiddies, the worse for the normal users. Thus,
  197. reputability is an anonymity issue for two reasons. First, it impacts
  198. the sustainability of the network: a network that's always about to be
  199. shut down has difficulty attracting and keeping users, so its anonymity
  200. set suffers. Second, a disreputable network attracts the attention of
  201. powerful attackers who may not mind revealing the identities of all the
  202. users to uncover the few bad ones.
  203. While people therefore have an incentive for the network to be used for
  204. ``more reputable'' activities than their own, there are still tradeoffs
  205. involved when it comes to anonymity. To follow the above example, a
  206. network used entirely by cancer survivors might welcome some Communists
  207. onto the network, though of course they'd prefer a wider variety of users.
  208. The impact of public perception on security is especially important
  209. during the bootstrapping phase of the network, where the first few
  210. widely publicized uses of the network can dictate the types of users it
  211. attracts next.
  212. \subsection{Tor and file-sharing}
  213. Bittorrent and dmca. Should we add an IDS to autodetect protocols and
  214. snipe them?
  215. \subsection{Tor and blacklists}
  216. Takedowns and efnet abuse and wikipedia complaints and irc
  217. networks.
  218. \subsection{Other}
  219. Tor's scope: How much should Tor aim to do? Applications that leak
  220. data: we can say they're not our problem, but they're somebody's problem.
  221. Also, the more widely deployed Tor becomes, the more people who need a
  222. deployed overlay network tell us they'd like to use us if only we added
  223. the following more features. For example, Blossom \cite{blossom} and
  224. random community wireless projects both want source-routable overlay
  225. networks for their own purposes. Fortunately, our modular design separates
  226. routing from node discovery; so we could implement Morphmix in Tor just
  227. by implementing the Morphmix-specific node discovery and path selection
  228. pieces. On the other hand, we could easily get distracted building a
  229. general-purpose overlay library, and we're only a few developers.
  230. Should we allow revocation of anonymity if a threshold of
  231. servers want to?
  232. Logging. Making logs not revealing. A happy coincidence that verbose
  233. logging is our \#2 performance bottleneck. Is there a way to detect
  234. modified servers, or to have them volunteer the information that they're
  235. logging verbosely? Would that actually solve any attacks?
  236. \section{Crossroads: Scaling and Design choices}
  237. \label{sec:crossroads-design}
  238. \subsection{Transporting the stream vs transporting the packets}
  239. We periodically run into ex ZKS employees who tell us that the process of
  240. anonymizing IPs should ``obviously'' be done at the IP layer. Here are
  241. the issues that need to be resolved before we'll be ready to switch Tor
  242. over to arbitrary IP traffic.
  243. \begin{enumerate}
  244. \setlength{\itemsep}{0mm}
  245. \setlength{\parsep}{0mm}
  246. \item [IP packets reveal OS characteristics.] We still need to do
  247. IP-level packet normalization, to stop things like IP fingerprinting
  248. \cite{ip-fingerprinting}. There exist libraries \cite{ip-normalizing}
  249. that can help with this.
  250. \item [Application-level streams still need scrubbing.] We still need
  251. Tor to be easy to integrate with user-level application-specific proxies
  252. such as Privoxy. So it's not just a matter of capturing packets and
  253. anonymizing them at the IP layer.
  254. \item [Certain protocols will still leak information.] For example,
  255. DNS requests destined for my local DNS servers need to be rewritten
  256. to be delivered to some other unlinkable DNS server. This requires
  257. understanding the protocols we are transporting.
  258. \item [The crypto is unspecified.] First we need a block-level encryption
  259. approach that can provide security despite
  260. packet loss and out-of-order delivery. Freedom allegedly had one, but it was
  261. never publicly specified, and we believe it's likely vulnerable to tagging
  262. attacks \cite{tor-design}. Also, TLS over UDP is not implemented or even
  263. specified, though some early work has begun on that \cite{ben-tls-udp}.
  264. \item [We'll still need to tune network parameters]. Since the above
  265. encryption system will likely need sequence numbers and maybe more to do
  266. replay detection, handle duplicate frames, etc, we will be reimplementing
  267. some subset of TCP anyway to manage throughput, congestion control, etc.
  268. \item [Exit policies for arbitrary IP packets mean building a secure
  269. IDS.] Our server operators tell us that exit policies are one of
  270. the main reasons they're willing to run Tor over previous attempts
  271. at anonymizing networks. Adding an IDS to handle exit policies would
  272. increase the security complexity of Tor, and would likely not work anyway,
  273. as evidenced by the entire field of IDS and counter-IDS papers. Many
  274. potential abuse issues are resolved by the fact that Tor only transports
  275. valid TCP streams (as opposed to arbitrary IP including malformed packets
  276. and IP floods), so exit policies become even \emph{more} important as
  277. we become able to transport IP packets. We also need a way to compactly
  278. characterize the exit policies and let clients parse them to decide
  279. which nodes will allow which packets to exit.
  280. \item [The Tor-internal name spaces would need to be redesigned.] We
  281. support hidden service \tt{.onion} addresses, and other special addresses
  282. like \tt{.exit} (see Section \ref{subsec:}), by intercepting the addresses
  283. when they are passed to the Tor client.
  284. \end{enumerate}
  285. This list is discouragingly long right now, but we recognize that it
  286. would be good to investigate each of these items in further depth and to
  287. understand which are actual roadblocks and which are easier to resolve
  288. than we think. We certainly wouldn't mind if Tor one day is able to
  289. transport a greater variety of protocols.
  290. \subsection{Mid-latency}
  291. Mid-latency. Can we do traffic shape to get any defense against George's
  292. PET2004 paper? Will padding or long-range dummies do anything then? Will
  293. it kill the user base or can we get both approaches to play well together?
  294. explain what mid-latency is. propose a single network where users of
  295. varying latency goals can combine.
  296. Note that in practice as the network is growing and we accept cable
  297. modem and dsl nodes, and nodes in other continents, we're *already*
  298. looking at many-second delays for some transactions. The engineering
  299. required to get this lower is going to be extremely hard. It's worth
  300. considering how hard it would be to accept the fixed (higher) latency
  301. and improve the protection we get from it.
  302. % can somebody besides arma flesh this section out?
  303. %\subsection{The DNS problem in practice}
  304. \subsection{Measuring performance and capacity}
  305. How to measure performance without letting people selectively deny service
  306. by distinguishing pings. Heck, just how to measure performance at all. In
  307. practice people have funny firewalls that don't match up to their exit
  308. policies and Tor doesn't deal.
  309. Network investigation: Is all this bandwidth publishing thing a good idea?
  310. How can we collect stats better? Note weasel's smokeping, at
  311. http://seppia.noreply.org/cgi-bin/smokeping.cgi?target=Tor
  312. which probably gives george and steven enough info to break tor?
  313. \subsection{Plausible deniability}
  314. Does running a server help you or harm you? George's Oakland attack.
  315. Plausible deniability -- without even running your traffic through Tor! We
  316. have to pick the path length so adversary can't distinguish client from
  317. server (how many hops is good?).
  318. \subsection{Helper nodes}
  319. When does fixing your entry or exit node help you?
  320. Helper nodes in the literature don't deal with churn, and
  321. especially active attacks to induce churn.
  322. Do general DoS attacks have anonymity implications? See e.g. Adam
  323. Back's IH paper, but I think there's more to be pointed out here.
  324. \subsection{Location-hidden services}
  325. Survivable services are new in practice, yes? Hidden services seem
  326. less hidden than we'd like, since they stay in one place and get used
  327. a lot. They're the epitome of the need for helper nodes. This means
  328. that using Tor as a building block for Free Haven is going to be really
  329. hard. Also, they're brittle in terms of intersection and observation
  330. attacks. Would be nice to have hot-swap services, but hard to design.
  331. Game theory for helper nodes: if Alice offers a hidden service on a
  332. server (enclave model), and nobody ever uses helper nodes, then against
  333. George+Steven's attack she's totally nailed. If only Alice uses a helper
  334. node, then she's still identified as the source of the data. If everybody
  335. uses a helper node (including Alice), then the attack identifies the
  336. helper node and also Alice, and knows which one is which. If everybody
  337. uses a helper node (but not Alice), then the attacker figures the real
  338. source was a client that is using Alice as a helper node. [How's my
  339. logic here?]
  340. in practice, sites like bloggers without borders (www.b19s.org) are
  341. running tor servers but more important are advertising a hidden-service
  342. address on their front page. doing this can provide increased robustness
  343. if they used the dual-IP approach we describe in tor-design, but in
  344. practice they do it to a) increase visibility of the tor project and their
  345. support for privacy, and b) to offer a way for their users, using vanilla
  346. software, to get end-to-end encryption and end-to-end authentication to
  347. their website.
  348. \section{Crossroads: Scaling}
  349. %\label{sec:crossroads-scaling}
  350. %P2P + anonymity issues:
  351. Tor is running today with hundreds of servers and tens of thousands of
  352. users, but it will certainly not scale to millions.
  353. Scaling Tor involves three main challenges. First is safe server
  354. discovery, both bootstrapping -- how a Tor client can robustly find an
  355. initial server list -- and ongoing -- how a Tor client can learn about
  356. a fair sample of honest servers and not let the adversary control his
  357. circuits (see Section x). Second is detecting and handling the speed
  358. and reliability of the variety of servers we must use if we want to
  359. accept many servers (see Section y).
  360. Since the speed and reliability of a circuit is limited by its worst link,
  361. we must learn to track and predict performance. Finally, in order to get
  362. a large set of servers in the first place, we must address incentives
  363. for users to carry traffic for others (see Section incentives).
  364. \subsection{Incentives}
  365. There are three behaviors we need to encourage for each server: relaying
  366. traffic; providing good throughput and reliability while doing it;
  367. and allowing traffic to exit the network from that server.
  368. We encourage these behaviors through \emph{indirect} incentives, that
  369. is, designing the system and educating users in such a way that users
  370. with certain goals will choose to relay traffic. In practice, the
  371. main incentive for running a Tor server is social benefit: volunteers
  372. altruistically donate their bandwidth and time. We also keep public
  373. rankings of the throughput and reliability of servers, much like
  374. seti@home. We further explain to users that they can get \emph{better
  375. security} by operating a server, because they get plausible deniability
  376. (indeed, they may not need to route their own traffic through Tor at all
  377. -- blending directly with other traffic exiting Tor may be sufficient
  378. protection for them), and because they can use their own Tor server
  379. as entry or exit point and be confident it's not run by the adversary.
  380. Finally, we can improve the usability and feature set of the software:
  381. rate limiting support and easy packaging decrease the hassle of
  382. maintaining a server, and our configurable exit policies allow each
  383. operator to advertise a policy describing the hosts and ports to which
  384. he feels comfortable connecting.
  385. Beyond these, however, there is also a need for \emph{direct} incentives:
  386. providing payment or other resources in return for high-quality service.
  387. Paying actual money is problematic: decentralized e-cash systems are
  388. not yet practical, and a centralized collection system not only reduces
  389. robustness, but also has failed in the past (the history of commercial
  390. anonymizing networks is littered with failed attempts). A more promising
  391. option is to use a tit-for-tat incentive scheme: provide better service
  392. to nodes that have provided good service to you.
  393. Unfortunately, such an approach introduces new anonymity problems.
  394. Does the incentive system enable the adversary to attract more traffic by
  395. performing well? Typically a user who chooses evenly from all options is
  396. most resistant to an adversary targetting him, but that approach prevents
  397. us from handling heterogeneous servers \cite{casc-rep}.
  398. When a server (call him Steve) performs well for Alice, does Steve gain
  399. reputation with the entire system, or just with Alice? If the entire
  400. system, how does Alice tell everybody about her experience in a way that
  401. prevents her from lying about it yet still protects her identity? If
  402. Steve's behavior only affects Alice's behavior, does this allow Steve to
  403. selectively perform only for Alice, and then break her anonymity later
  404. when somebody (presumably Alice) routes through his node?
  405. These are difficult and open questions, yet choosing not to scale means
  406. leaving most users to a less secure network or no anonymizing network
  407. at all. We will start with a simplified approach to the tit-for-tat
  408. incentive scheme based on two rules: (1) each node should measure the
  409. service it receives from adjacent nodes, and provide service relative to
  410. the received service, but (2) when a node is making decisions that affect
  411. its own security (e.g. when building a circuit for its own application
  412. connections), it should choose evenly from a sufficiently large set of
  413. nodes that meet some minimum service threshold. This approach allows us
  414. to discourage bad service without opening Alice up as much to attacks.
  415. %XXX rewrite the above so it sounds less like a grant proposal and
  416. %more like a "if somebody were to try to solve this, maybe this is a
  417. %good first step".
  418. %We should implement the above incentive scheme in the
  419. %deployed Tor network, in conjunction with our plans to add the necessary
  420. %associated scalability mechanisms. We will do experiments (simulated
  421. %and/or real) to determine how much the incentive system improves
  422. %efficiency over baseline, and also to determine how far we are from
  423. %optimal efficiency (what we could get if we ignored the anonymity goals).
  424. \subsection{Peer-to-peer / practical issues}
  425. Network discovery, sybil, node admission, scaling. It seems that the code
  426. will ship with something and that's our trust root. We could try to get
  427. people to build a web of trust, but no. Where we go from here depends
  428. on what threats we have in mind. Really decentralized if your threat is
  429. RIAA; less so if threat is to application data or individuals or...
  430. Making use of servers with little bandwidth. How to handle hammering by
  431. certain applications.
  432. Handling servers that are far away from the rest of the network, e.g. on
  433. the continents that aren't North America and Europe. High latency,
  434. often high packet loss.
  435. Running Tor servers behind NATs, behind great-firewalls-of-China, etc.
  436. Restricted routes. How to propagate to everybody the topology? BGP
  437. style doesn't work because we don't want just *one* path. Point to
  438. Geoff's stuff.
  439. \subsection{ISP-class adversaries}
  440. Routing-zones. It seems that our threat model comes down to diversity and
  441. dispersal. But hard for Alice to know how to act. Many questions remain.
  442. \subsection{The China problem}
  443. We have lots of users in Iran and similar (we stopped
  444. logging, so it's hard to know now, but many Persian sites on how to use
  445. Tor), and they seem to be doing ok. But the China problem is bigger. Cite
  446. Stefan's paper, and talk about how we need to route through clients,
  447. and we maybe we should start with a time-release IP publishing system +
  448. advogato based reputation system, to bound the number of IPs leaked to the
  449. adversary.
  450. \section{The Future}
  451. \label{sec:conclusion}
  452. \bibliographystyle{plain} \bibliography{tor-design}
  453. \end{document}