challenges.tex 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524
  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. see \ref{subsec:routing-zones} for discussion of larger
  149. adversaries and our dispersal goals.
  150. \section{Crossroads: Policy issues}
  151. \label{sec:crossroads-policy}
  152. Many of the issues the Tor project needs to address are not just a
  153. matter of system design or technology development. In particular, the
  154. Tor project's \emph{image} with respect to its users and the rest of
  155. the Internet impacts the security it can provide.
  156. As an example to motivate this section, some U.S.~Department of Enery
  157. penetration testing engineers are tasked with compromising DoE computers
  158. from the outside. They only have a limited number of ISPs from which to
  159. launch their attacks, and they found that the defenders were recognizing
  160. attacks because they came from the same IP space. These engineers wanted
  161. to use Tor to hide their tracks. First, from a technical standpoint,
  162. Tor does not support the variety of IP packets they would like to use in
  163. such attacks (see Section \ref{subsec:ip-vs-tcp}). But aside from this,
  164. we also decided that it would probably be poor precedent to encourage
  165. such use -- even legal use that improves national security -- and managed
  166. to dissuade them.
  167. With this image issue in mind, here we discuss the Tor user base and
  168. Tor's interaction with other services on the Internet.
  169. \subsection{Usability}
  170. Usability: fc03 paper was great, except the lower latency you are the
  171. less useful it seems it is.
  172. A Tor gui, how jap's gui is nice but does not reflect the security
  173. they provide.
  174. Public perception, and thus advertising, is a security parameter.
  175. \subsection{Image, usability, and sustainability}
  176. Image: substantial non-infringing uses. Image is a security parameter,
  177. since it impacts user base and perceived sustainability.
  178. Sustainability. Previous attempts have been commercial which we think
  179. adds a lot of unnecessary complexity and accountability. Freedom didn't
  180. collect enough money to pay its servers; JAP bandwidth is supported by
  181. continued money, and they periodically ask what they will do when it
  182. dries up.
  183. good uses are kept private, bad uses are publicized. not good.
  184. \subsection{Reputability}
  185. Yet another factor in the safety of a given network is its reputability:
  186. the perception of its social value based on its current users. If I'm
  187. the only user of a system, it might be socially accepted, but I'm not
  188. getting any anonymity. Add a thousand Communists, and I'm anonymous,
  189. but everyone thinks I'm a Commie. Add a thousand random citizens (cancer
  190. survivors, privacy enthusiasts, and so on) and now I'm hard to profile.
  191. The more cancer survivors on Tor, the better for the human rights
  192. activists. The more script kiddies, the worse for the normal users. Thus,
  193. reputability is an anonymity issue for two reasons. First, it impacts
  194. the sustainability of the network: a network that's always about to be
  195. shut down has difficulty attracting and keeping users, so its anonymity
  196. set suffers. Second, a disreputable network attracts the attention of
  197. powerful attackers who may not mind revealing the identities of all the
  198. users to uncover the few bad ones.
  199. While people therefore have an incentive for the network to be used for
  200. ``more reputable'' activities than their own, there are still tradeoffs
  201. involved when it comes to anonymity. To follow the above example, a
  202. network used entirely by cancer survivors might welcome some Communists
  203. onto the network, though of course they'd prefer a wider variety of users.
  204. The impact of public perception on security is especially important
  205. during the bootstrapping phase of the network, where the first few
  206. widely publicized uses of the network can dictate the types of users it
  207. attracts next.
  208. \subsection{Tor and file-sharing}
  209. Bittorrent and dmca. Should we add an IDS to autodetect protocols and
  210. snipe them?
  211. \subsection{Tor and blacklists}
  212. Takedowns and efnet abuse and wikipedia complaints and irc
  213. networks.
  214. \subsection{Other}
  215. Tor's scope: How much should Tor aim to do? Applications that leak
  216. data. We can say they're not our problem, but they're somebody's problem.
  217. Should we allow revocation of anonymity if a threshold of
  218. servers want to?
  219. Logging. Making logs not revealing. A happy coincidence that verbose
  220. logging is our \#2 performance bottleneck. Is there a way to detect
  221. modified servers, or to have them volunteer the information that they're
  222. logging verbosely? Would that actually solve any attacks?
  223. \section{Crossroads: Scaling and Design choices}
  224. \label{sec:crossroads-design}
  225. \subsection{Transporting the stream vs transporting the packets}
  226. We periodically run into ex ZKS employees who tell us that the process of
  227. anonymizing IPs should ``obviously'' be done at the IP layer. Here are
  228. the issues that need to be resolved before we'll be ready to switch Tor
  229. over to arbitrary IP traffic.
  230. \begin{enumerate}
  231. \setlength{\itemsep}{0mm}
  232. \setlength{\parsep}{0mm}
  233. \item [IP packets reveal OS characteristics.] We still need to do
  234. IP-level packet normalization, to stop things like IP fingerprinting
  235. \cite{ip-fingerprinting}. There exist libraries \cite{ip-normalizing}
  236. that can help with this.
  237. \item [Application-level streams still need scrubbing.] We still need
  238. Tor to be easy to integrate with user-level application-specific proxies
  239. such as Privoxy. So it's not just a matter of capturing packets and
  240. anonymizing them at the IP layer.
  241. \item [Certain protocols will still leak information.] For example,
  242. DNS requests destined for my local DNS servers need to be rewritten
  243. to be delivered to some other unlinkable DNS server. This requires
  244. understanding the protocols we are transporting.
  245. \item [The crypto is unspecified.] First we need a block-level encryption
  246. approach that can provide security despite
  247. packet loss and out-of-order delivery. Freedom allegedly had one, but it was
  248. never publicly specified, and we believe it's likely vulnerable to tagging
  249. attacks \cite{tor-design}. Also, TLS over UDP is not implemented or even
  250. specified, though some early work has begun on that \cite{ben-tls-udp}.
  251. \item [We'll still need to tune network parameters]. Since the above
  252. encryption system will likely need sequence numbers and maybe more to do
  253. replay detection, handle duplicate frames, etc, we will be reimplementing
  254. some subset of TCP anyway to manage throughput, congestion control, etc.
  255. \item [Exit policies for arbitrary IP packets mean building a secure
  256. IDS.] Our server operators tell us that exit policies are one of
  257. the main reasons they're willing to run Tor over previous attempts
  258. at anonymizing networks. Adding an IDS to handle exit policies would
  259. increase the security complexity of Tor, and would likely not work anyway,
  260. as evidenced by the entire field of IDS and counter-IDS papers.
  261. \item [The Tor-internal name spaces would need to be redesigned.] We
  262. support hidden service \tt{.onion} addresses, and other special addresses
  263. like \tt{.exit} (see Section \ref{subsec:}), by intercepting the addresses
  264. when they are passed to the Tor client.
  265. \end{enumerate}
  266. \subsection{Mid-latency}
  267. Mid-latency. Can we do traffic shape to get any defense against George's
  268. PET2004 paper? Will padding or long-range dummies do anything then? Will
  269. it kill the user base or can we get both approaches to play well together?
  270. explain what mid-latency is. propose a single network where users of
  271. varying latency goals can combine.
  272. Note that in practice as the network is growing and we accept cable
  273. modem and dsl nodes, and nodes in other continents, we're *already*
  274. looking at many-second delays for some transactions. The engineering
  275. required to get this lower is going to be extremely hard. It's worth
  276. considering how hard it would be to accept the fixed (higher) latency
  277. and improve the protection we get from it.
  278. % can somebody besides arma flesh this section out?
  279. %\subsection{The DNS problem in practice}
  280. \subsection{Measuring performance and capacity}
  281. How to measure performance without letting people selectively deny service
  282. by distinguishing pings. Heck, just how to measure performance at all. In
  283. practice people have funny firewalls that don't match up to their exit
  284. policies and Tor doesn't deal.
  285. Network investigation: Is all this bandwidth publishing thing a good idea?
  286. How can we collect stats better? Note weasel's smokeping, at
  287. http://seppia.noreply.org/cgi-bin/smokeping.cgi?target=Tor
  288. which probably gives george and steven enough info to break tor?
  289. \subsection{Plausible deniability}
  290. Does running a server help you or harm you? George's Oakland attack.
  291. Plausible deniability -- without even running your traffic through Tor! We
  292. have to pick the path length so adversary can't distinguish client from
  293. server (how many hops is good?).
  294. \subsection{Helper nodes}
  295. When does fixing your entry or exit node help you?
  296. Helper nodes in the literature don't deal with churn, and
  297. especially active attacks to induce churn.
  298. Do general DoS attacks have anonymity implications? See e.g. Adam
  299. Back's IH paper, but I think there's more to be pointed out here.
  300. \subsection{Location-hidden services}
  301. Survivable services are new in practice, yes? Hidden services seem
  302. less hidden than we'd like, since they stay in one place and get used
  303. a lot. They're the epitome of the need for helper nodes. This means
  304. that using Tor as a building block for Free Haven is going to be really
  305. hard. Also, they're brittle in terms of intersection and observation
  306. attacks. Would be nice to have hot-swap services, but hard to design.
  307. in practice, sites like bloggers without borders (www.b19s.org) are
  308. running tor servers but more important are advertising a hidden-service
  309. address on their front page. doing this can provide increased robustness
  310. if they used the dual-IP approach we describe in tor-design, but in
  311. practice they do it to a) increase visibility of the tor project and their
  312. support for privacy, and b) to offer a way for their users, using vanilla
  313. software, to get end-to-end encryption and end-to-end authentication to
  314. their website.
  315. \section{Crossroads: Scaling}
  316. %\label{sec:crossroads-scaling}
  317. %P2P + anonymity issues:
  318. Tor is running today with hundreds of servers and tens of thousands of
  319. users, but it will certainly not scale to millions.
  320. Scaling Tor involves three main challenges. First is safe server
  321. discovery, both bootstrapping -- how a Tor client can robustly find an
  322. initial server list -- and ongoing -- how a Tor client can learn about
  323. a fair sample of honest servers and not let the adversary control his
  324. circuits (see Section x). Second is detecting and handling the speed
  325. and reliability of the variety of servers we must use if we want to
  326. accept many servers (see Section y).
  327. Since the speed and reliability of a circuit is limited by its worst link,
  328. we must learn to track and predict performance. Finally, in order to get
  329. a large set of servers in the first place, we must address incentives
  330. for users to carry traffic for others (see Section incentives).
  331. \subsection{Incentives}
  332. There are three behaviors we need to encourage for each server: relaying
  333. traffic; providing good throughput and reliability while doing it;
  334. and allowing traffic to exit the network from that server.
  335. We encourage these behaviors through \emph{indirect} incentives, that
  336. is, designing the system and educating users in such a way that users
  337. with certain goals will choose to relay traffic. In practice, the
  338. main incentive for running a Tor server is social benefit: volunteers
  339. altruistically donate their bandwidth and time. We also keep public
  340. rankings of the throughput and reliability of servers, much like
  341. seti@home. We further explain to users that they can get \emph{better
  342. security} by operating a server, because they get plausible deniability
  343. (indeed, they may not need to route their own traffic through Tor at all
  344. -- blending directly with other traffic exiting Tor may be sufficient
  345. protection for them), and because they can use their own Tor server
  346. as entry or exit point and be confident it's not run by the adversary.
  347. Finally, we can improve the usability and feature set of the software:
  348. rate limiting support and easy packaging decrease the hassle of
  349. maintaining a server, and our configurable exit policies allow each
  350. operator to advertise a policy describing the hosts and ports to which
  351. he feels comfortable connecting.
  352. Beyond these, however, there is also a need for \emph{direct} incentives:
  353. providing payment or other resources in return for high-quality service.
  354. Paying actual money is problematic: decentralized e-cash systems are
  355. not yet practical, and a centralized collection system not only reduces
  356. robustness, but also has failed in the past (the history of commercial
  357. anonymizing networks is littered with failed attempts). A more promising
  358. option is to use a tit-for-tat incentive scheme: provide better service
  359. to nodes that have provided good service to you.
  360. Unfortunately, such an approach introduces new anonymity problems.
  361. Does the incentive system enable the adversary to attract more traffic by
  362. performing well? Typically a user who chooses evenly from all options is
  363. most resistant to an adversary targetting him, but that approach prevents
  364. us from handling heterogeneous servers \cite{casc-rep}.
  365. When a server (call him Steve) performs well for Alice, does Steve gain
  366. reputation with the entire system, or just with Alice? If the entire
  367. system, how does Alice tell everybody about her experience in a way that
  368. prevents her from lying about it yet still protects her identity? If
  369. Steve's behavior only affects Alice's behavior, does this allow Steve to
  370. selectively perform only for Alice, and then break her anonymity later
  371. when somebody (presumably Alice) routes through his node?
  372. These are difficult and open questions, yet choosing not to scale means
  373. leaving most users to a less secure network or no anonymizing network
  374. at all. We will start with a simplified approach to the tit-for-tat
  375. incentive scheme based on two rules: (1) each node should measure the
  376. service it receives from adjacent nodes, and provide service relative to
  377. the received service, but (2) when a node is making decisions that affect
  378. its own security (e.g. when building a circuit for its own application
  379. connections), it should choose evenly from a sufficiently large set of
  380. nodes that meet some minimum service threshold. This approach allows us
  381. to discourage bad service without opening Alice up as much to attacks.
  382. %XXX rewrite the above so it sounds less like a grant proposal and
  383. %more like a "if somebody were to try to solve this, maybe this is a
  384. %good first step".
  385. %We should implement the above incentive scheme in the
  386. %deployed Tor network, in conjunction with our plans to add the necessary
  387. %associated scalability mechanisms. We will do experiments (simulated
  388. %and/or real) to determine how much the incentive system improves
  389. %efficiency over baseline, and also to determine how far we are from
  390. %optimal efficiency (what we could get if we ignored the anonymity goals).
  391. \subsection{Peer-to-peer / practical issues}
  392. Network discovery, sybil, node admission, scaling. It seems that the code
  393. will ship with something and that's our trust root. We could try to get
  394. people to build a web of trust, but no. Where we go from here depends
  395. on what threats we have in mind. Really decentralized if your threat is
  396. RIAA; less so if threat is to application data or individuals or...
  397. Making use of servers with little bandwidth. How to handle hammering by
  398. certain applications.
  399. Handling servers that are far away from the rest of the network, e.g. on
  400. the continents that aren't North America and Europe. High latency,
  401. often high packet loss.
  402. Running Tor servers behind NATs, behind great-firewalls-of-China, etc.
  403. Restricted routes. How to propagate to everybody the topology? BGP
  404. style doesn't work because we don't want just *one* path. Point to
  405. Geoff's stuff.
  406. \subsection{ISP-class adversaries}
  407. Routing-zones. It seems that our threat model comes down to diversity and
  408. dispersal. But hard for Alice to know how to act. Many questions remain.
  409. \subsection{The China problem}
  410. We have lots of users in Iran and similar (we stopped
  411. logging, so it's hard to know now, but many Persian sites on how to use
  412. Tor), and they seem to be doing ok. But the China problem is bigger. Cite
  413. Stefan's paper, and talk about how we need to route through clients,
  414. and we maybe we should start with a time-release IP publishing system +
  415. advogato based reputation system, to bound the number of IPs leaked to the
  416. adversary.
  417. \section{The Future}
  418. \label{sec:conclusion}
  419. \bibliographystyle{plain} \bibliography{tor-design}
  420. \end{document}