roadmap-future.tex 42 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895
  1. \documentclass{article}
  2. \usepackage{url}
  3. \usepackage{fullpage}
  4. \newenvironment{tightlist}{\begin{list}{$\bullet$}{
  5. \setlength{\itemsep}{0mm}
  6. \setlength{\parsep}{0mm}
  7. % \setlength{\labelsep}{0mm}
  8. % \setlength{\labelwidth}{0mm}
  9. % \setlength{\topsep}{0mm}
  10. }}{\end{list}}
  11. \newcommand{\tmp}[1]{{\bf #1} [......] \\}
  12. \newcommand{\plan}[1]{ {\bf (#1)}}
  13. \begin{document}
  14. \title{Tor Development Roadmap: Wishlist for 2008 and beyond}
  15. \author{Roger Dingledine \and Nick Mathewson}
  16. \date{}
  17. \maketitle
  18. \pagestyle{plain}
  19. \section{Introduction}
  20. Tor (the software) and Tor (the overall software/network/support/document
  21. suite) are now experiencing all the crises of success. Over the next
  22. years, we're probably going to grow even more in terms of users, developers,
  23. and funding than before. This document attempts to lay out all the
  24. well-understood next steps that Tor needs to take. We should periodically
  25. reorganize it to reflect current and intended priorities.
  26. \section{Everybody can be a relay}
  27. We've made a lot of progress towards letting an ordinary Tor client also
  28. serve as a Tor relay. But these issues remain.
  29. \subsection{UPNP}
  30. We should teach Vidalia how to speak UPNP to automatically open and
  31. forward ports on common (e.g. Linksys) routers. There are some promising
  32. Qt-based UPNP libs out there, and in any case there are others (e.g. in
  33. Perl) that we can base it on.
  34. \subsection{``ORPort auto'' to look for a reachable port}
  35. Vidalia defaults to port 443 on Windows and port 8080 elsewhere. But if
  36. that port is already in use, or the ISP filters incoming connections
  37. on that port (some cablemodem providers filter 443 inbound), the user
  38. needs to learn how to notice this, and then pick a new one and type it
  39. into Vidalia.
  40. We should add a new option ``auto'' that cycles through a set of preferred
  41. ports, testing bindability and reachability for each of them, and only
  42. complains to the user once it's given up on the common choices.
  43. \subsection{Incentives design}
  44. Roger has been working with researchers at Rice University to simulate
  45. and analyze a new design where the directory authorities assign gold
  46. stars to well-behaving relays, and then all the relays give priority
  47. to traffic from gold-starred relays. The great feature of the design is
  48. that not only does it provide the (explicit) incentive to run a relay,
  49. but it also aims to grow the overall capacity of the network, so even
  50. non-relays will benefit.
  51. It needs more analysis, and perhaps more design work, before we try
  52. deploying it.
  53. \subsection{Windows libevent}
  54. Tor relays still don't work well or reliably on Windows XP or Windows
  55. Vista, because we don't use the Windows-native ``overlapped IO''
  56. approach. Christian King made a good start at teaching libevent about
  57. overlapped IO during Google Summer of Code 2007, and next steps are
  58. to a) finish that, b) teach Tor to do openssl calls on buffers rather
  59. than directly to the network, and c) teach Tor to use the new libevent
  60. buffers approach.
  61. \subsection{Network scaling}
  62. If we attract many more relays, we will need to handle the growing pains
  63. in terms of getting all the directory information to all the users.
  64. The first piece of this issue is a practical question: since the
  65. directory size scales linearly with more relays, at some point it
  66. will no longer be practical for every client to learn about every
  67. relay. We can try to reduce the amount of information each client needs
  68. to fetch (e.g. based on fetching less information preemptively as in
  69. Section~\ref{subsec:fewer-descriptor-fetches} below), but eventually
  70. clients will need to learn about only a subset of the network, and we
  71. will need to design good ways to divide up the network information.
  72. The second piece is an anonymity question that arises from this
  73. partitioning: if Tor's security comes from having all the clients
  74. behaving in similar ways, yet we are now giving different clients
  75. different directory information, how can we minimize the new anonymity
  76. attacks we introduce?
  77. \subsection{Using fewer sockets}
  78. Since in the current network every Tor relay can reach every other Tor
  79. relay, and we have many times more users than relays, pretty much every
  80. possible link in the network is in use. That is, the current network
  81. is a clique in practice.
  82. And since each of these connections requires a TCP socket, it's going
  83. to be hard for the network to grow much larger: many systems come with
  84. a default of 1024 file descriptors allowed per process, and raising
  85. that ulimit is hard for end users. Worse, many low-end gateway/firewall
  86. routers can't handle this many connections in their routing table.
  87. One approach is a restricted-route topology~\cite{danezis:pet2003}:
  88. predefine which relays can reach which other relays, and communicate
  89. these restrictions to the relays and the clients. We need to compute
  90. which links are acceptable in a way that's decentralized yet scalable,
  91. and in a way that achieves a small-worlds property; and we
  92. need an efficient (compact) way to characterize the topology information
  93. so all the users could keep up to date.
  94. Another approach would be to switch to UDP-based transport between
  95. relays, so we don't need to keep the TCP sockets open at all. Needs more
  96. investigation too.
  97. \subsection{Auto bandwidth detection and rate limiting, especially for
  98. asymmetric connections.}
  99. \subsection{Better algorithms for giving priority to local traffic}
  100. Proposal 111 made a lot of progress at separating local traffic from
  101. relayed traffic, so Tor users can rate limit the relayed traffic at a
  102. stricter level. But since we want to pass both traffic classes over the
  103. same TCP connection, we can't keep them entirely separate. The current
  104. compromise is that we treat all bytes to/from a given connectin as
  105. local traffic if any of the bytes within the past N seconds were local
  106. bytes. But a) we could use some more intelligent heuristics, and b)
  107. this leaks information to an active attacker about when local traffic
  108. was sent/received.
  109. \subsection{Tolerate absurdly wrong clocks, even for relays}
  110. Many of our users are on Windows, running with a clock several days or
  111. even several years off from reality. Some of them are even intentionally
  112. in this state so they can run software that will only run in the past.
  113. Before Tor 0.1.1.x, Tor clients would still function if their clock was
  114. wildly off --- they simply got a copy of the directory and believed it.
  115. Starting in Tor 0.1.1.x (and even moreso in Tor 0.2.0.x), the clients
  116. only use networkstatus documents that they believe to be recent, so
  117. clients with extremely wrong clocks no longer work. (This bug has been
  118. an unending source of vague and confusing bug reports.)
  119. The first step is for clients to recognize when all the directory material
  120. they're fetching has roughly the same offset from their current time,
  121. and then automatically correct for it.
  122. Once that's working well, clients who opt to become bridge relays should
  123. be able to use the same approach to serve accurate directory information
  124. to their bridge users.
  125. \subsection{Risks from being a relay}
  126. Three different research
  127. papers~\cite{back01,clog-the-queue,attack-tor-oak05} describe ways to
  128. identify the nodes in a circuit by running traffic through candidate nodes
  129. and looking for dips in the traffic while the circuit is active. These
  130. clogging attacks are not that scary in the Tor context so long as relays
  131. are never clients too. But if we're trying to encourage more clients to
  132. turn on relay functionality too (whether as bridge relays or as normal
  133. relays), then we need to understand this threat better and learn how to
  134. mitigate it.
  135. One promising research direction is to investigate the RelayBandwidthRate
  136. feature that lets Tor rate limit relayed traffic differently from local
  137. traffic. Since the attacker's ``clogging'' traffic is not in the same
  138. bandwidth class as the traffic initiated by the user, it may be harder
  139. to detect interference. Or it may not be.
  140. \subsection{First a bridge, then a public relay?}
  141. Once enough of the items in this section are done, I want all clients
  142. to start out automatically detecting their reachability and opting
  143. to be bridge relays.
  144. Then if they realize they have enough consistency and bandwidth, they
  145. should automatically upgrade to being non-exit relays.
  146. What metrics should we use for deciding when we're fast enough
  147. and stable enough to switch? Given that the list of bridge relays needs
  148. to be kept secret, it doesn't make much sense to switch back.
  149. \section{Tor on low resources / slow links}
  150. \subsection{Reducing directory fetches further}
  151. \label{subsec:fewer-descriptor-fetches}
  152. \subsection{AvoidDiskWrites}
  153. \subsection{Using less ram}
  154. \subsection{Better DoS resistance for tor servers / authorities}
  155. \section{Blocking resistance}
  156. \subsection{Better bridge-address-distribution strategies}
  157. \subsection{Get more volunteers running bridges}
  158. \subsection{Handle multiple bridge authorities}
  159. \subsection{Anonymity for bridge users: second layer of entry guards, etc?}
  160. \subsection{More TLS normalization}
  161. \subsection{Harder to block Tor software distribution}
  162. \subsection{Integration with Psiphon}
  163. \section{Packaging}
  164. \subsection{Switch Privoxy out for Polipo}
  165. - Make Vidalia able to launch more programs itself
  166. \subsection{Continue Torbutton improvements}
  167. especially better docs
  168. \subsection{Vidalia and stability (especially wrt ongoing Windows problems)}
  169. learn how to get useful crash reports (tracebacks) from Windows users
  170. \subsection{Polipo support on Windows}
  171. \subsection{Auto update for Tor, Vidalia, others}
  172. \subsection{Tor browser bundle for USB and standalone use}
  173. \subsection{LiveCD solution}
  174. \subsection{VM-based solution}
  175. \subsection{Tor-on-enclave-firewall configuration}
  176. \subsection{General tutorials on what common applications are Tor-friendly}
  177. \subsection{Controller libraries (torctl) plus documentation}
  178. \subsection{Localization and translation (Vidalia, Torbutton, web pages)}
  179. \section{Interacting better with Internet sites}
  180. \subsection{Make tordnsel (tor exitlist) better and more well-known}
  181. \subsection{Nymble}
  182. \subsection{Work with Wikipedia, Slashdot, Google(, IRC networks)}
  183. \subsection{IPv6 support for exit destinations}
  184. \section{Network health}
  185. \subsection{torflow / soat to detect bad relays}
  186. \subsection{make authorities more automated}
  187. \subsection{torstatus pages and better trend tracking}
  188. \subsection{better metrics for assessing network health / growth}
  189. - geoip usage-by-country reporting and aggregation
  190. (Once that's working, switch to Directory guards)
  191. \section{Performance research}
  192. \subsection{Load balance better}
  193. \subsection{Improve our congestion control algorithms}
  194. \subsection{Two-hops vs Three-hops}
  195. \subsection{Transport IP packets end-to-end}
  196. \section{Outreach and user education}
  197. \subsection{"Who uses Tor" use cases}
  198. \subsection{Law enforcement contacts}
  199. - "Was this IP address a Tor relay recently?" database
  200. \subsection{Commercial/enterprise outreach. Help them use Tor well and
  201. not fear it.}
  202. \subsection{NGO outreach and training.}
  203. - "How to be a safe blogger"
  204. \subsection{More activist coordinators, more people to answer user questions}
  205. \subsection{More people to hold hands of server operators}
  206. \subsection{Teaching the media about Tor}
  207. \subsection{The-dangers-of-plaintext awareness}
  208. \subsection{check.torproject.org and other "privacy checkers"}
  209. \subsection{Stronger legal FAQ for US}
  210. \subsection{Legal FAQs for other countries}
  211. \section{Anonymity research}
  212. \subsection{estimate relay bandwidth more securely}
  213. \subsection{website fingerprinting attacks}
  214. \subsection{safer e2e defenses}
  215. \subsection{Using Tor when you really need anonymity. Can you compose it
  216. with other steps, like more trusted guards or separate proxies?}
  217. \subsection{Topology-aware routing; routing-zones, steven's pet2007 paper.}
  218. \subsection{Exactly what do guard nodes provide?}
  219. Entry guards seem to defend against all sorts of attacks. Can we work
  220. through all the benefits they provide? Papers like Nikita's CCS 2007
  221. paper make me think their value is not well-understood by the research
  222. community.
  223. \section{Organizational growth and stability}
  224. \subsection{A contingency plan if Roger gets hit by a bus}
  225. - Get a new executive director
  226. \subsection{More diversity of funding}
  227. - Don't rely on any one funder as much
  228. - Don't rely on any sector or funder category as much
  229. \subsection{More Tor-funded people who are skilled at peripheral apps like
  230. Vidalia, Torbutton, Polipo, etc}
  231. \subsection{More coordinated media handling and strategy}
  232. \subsection{Clearer and more predictable trademark behavior}
  233. \subsection{More outside funding for internships, etc e.g. GSoC.}
  234. \section{Hidden services}
  235. \subsection{Scaling: how to handle many hidden services}
  236. \subsection{Performance: how to rendezvous with them quickly}
  237. \subsection{Authentication/authorization: how to tolerate DoS / load}
  238. \section{Tor as a general overlay network}
  239. \subsection{Choose paths / exit by country}
  240. \subsection{Easier to run your own private servers and have Tor use them
  241. anywhere in the path}
  242. \subsection{Easier to run an independent Tor network}
  243. \section{Code security/correctness}
  244. \subsection{veracode}
  245. \subsection{code audit}
  246. \subsection{more fuzzing tools}
  247. \subsection{build farm, better testing harness}
  248. \subsection{Long-overdue code refactoring and cleanup}
  249. \section{Protocol security}
  250. \subsection{safer circuit handshake}
  251. \subsection{protocol versioning for future compatibility}
  252. \subsection{cell sizes}
  253. \subsection{adapt to new key sizes, etc}
  254. \bibliographystyle{plain} \bibliography{tor-design}
  255. \end{document}
  256. \section{Code and design infrastructure}
  257. \subsection{Protocol revision}
  258. To maintain backward compatibility, we've postponed major protocol
  259. changes and redesigns for a long time. Because of this, there are a number
  260. of sensible revisions we've been putting off until we could deploy several of
  261. them at once. To do each of these, we first need to discuss design
  262. alternatives with other cryptographers and outside collaborators to
  263. make sure that our choices are secure.
  264. First of all, our protocol needs better {\bf versioning support} so that we
  265. can make backward-incompatible changes to our core protocol. There are
  266. difficult anonymity issues here, since many naive designs would make it easy
  267. to tell clients apart (and then track them) based on their supported versions.
  268. With protocol versioning support would come the ability to {\bf future-proof
  269. our ciphersuites}. For example, not only our OR protocol, but also our
  270. directory protocol, is pretty firmly tied to the SHA-1 hash function, which
  271. though not yet known to be insecure for our purposes, has begun to show
  272. its age. We should
  273. remove assumptions throughout our design based on the assumption that public
  274. keys, secret keys, or digests will remain any particular size indefinitely.
  275. Our OR {\bf authentication protocol}, though provably
  276. secure\cite{tap:pet2006}, relies more on particular aspects of RSA and our
  277. implementation thereof than we had initially believed. To future-proof
  278. against changes, we should replace it with a less delicate approach.
  279. \plan{For all the above: 2 person-months to specify, spread over several
  280. months with time for interaction with external participants. One
  281. person-month to implement. Start specifying in early 2007.}
  282. We might design a {\bf stream migration} feature so that streams tunneled
  283. over Tor could be more resilient to dropped connections and changed IPs.
  284. \plan{Not in 2007.}
  285. A new protocol could support {\bf multiple cell sizes}. Right now, all data
  286. passes through the Tor network divided into 512-byte cells. This is
  287. efficient for high-bandwidth protocols, but inefficient for protocols
  288. like SSH or AIM that send information in small chunks. Of course, we need to
  289. investigate the extent to which multiple sizes could make it easier for an
  290. adversary to fingerprint a traffic pattern. \plan{Not in 2007.}
  291. As a part of our design, we should investigate possible {\bf cipher modes}
  292. other than counter mode. For example, a mode with built-in integrity
  293. checking, error propagation, and random access could simplify our protocol
  294. significantly. Sadly, many of these are patented and unavailable for us.
  295. \plan{Not in 2007.}
  296. \subsection{Scalability}
  297. \subsubsection{Improved directory efficiency}
  298. We should {\bf have routers upload their descriptors even less often}, so
  299. that clients do not need to download replacements every 18 hours whether any
  300. information has changed or not. (As of Tor 0.1.2.3-alpha, clients tolerate
  301. routers that don't upload often, but routers still upload at least every 18
  302. hours to support older clients.) \plan{Must do, but not until 0.1.1.x is
  303. deprecated in mid 2007. 1 week.}
  304. \subsubsection{Non-clique topology}
  305. Our current network design achieves a certain amount of its anonymity by
  306. making clients act like each other through the simple expedient of making
  307. sure that all clients know all servers, and that any server can talk to any
  308. other server. But as the number of servers increases to serve an
  309. ever-greater number of clients, these assumptions become impractical.
  310. At worst, if these scalability issues become troubling before a solution is
  311. found, we can design and build a solution to {\bf split the network into
  312. multiple slices} until a better solution comes along. This is not ideal,
  313. since rather than looking like all other users from a point of view of path
  314. selection, users would ``only'' look like 200,000--300,000 other
  315. users.\plan{Not unless needed.}
  316. We are in the process of designing {\bf improved schemes for network
  317. scalability}. Some approaches focus on limiting what an adversary can know
  318. about what a user knows; others focus on reducing the extent to which an
  319. adversary can exploit this knowledge. These are currently in their infancy,
  320. and will probably not be needed in 2007, but they must be designed in 2007 if
  321. they are to be deployed in 2008.\plan{Design in 2007; unknown difficulty.
  322. Write a paper.}
  323. \subsubsection{Relay incentives}
  324. To support more users on the network, we need to get more servers. So far,
  325. we've relied on volunteerism to attract server operators, and so far it's
  326. served us well. But in the long run, we need to {\bf design incentives for
  327. users to run servers} and relay traffic for others. Most obviously, we
  328. could try to build the network so that servers offered improved service for
  329. other servers, but we would need to do so without weakening anonymity and
  330. making it obvious which connections originate from users running servers. We
  331. have some preliminary designs~\cite{incentives-txt,tor-challenges},
  332. but need to perform
  333. some more research to make sure they would be safe and effective.\plan{Write
  334. a draft paper; 2 person-months.}
  335. (XXX we did that)
  336. \subsection{Portability}
  337. Our {\bf Windows implementation}, though much improved, continues to lag
  338. behind Unix and Mac OS X, especially when running as a server. We hope to
  339. merge promising patches from Christian King to address this point, and bring
  340. Windows performance on par with other platforms.\plan{Do in 2007; 1.5 months
  341. to integrate not counting Mike's work.}
  342. We should have {\bf better support for portable devices}, including modes of
  343. operation that require less RAM, and that write to disk less frequently (to
  344. avoid wearing out flash RAM).\plan{Optional; 2 weeks.}
  345. \subsection{Performance: resource usage}
  346. We've been working on {\bf using less RAM}, especially on servers. This has
  347. paid off a lot for directory caches in the 0.1.2, which in some cases are
  348. using 90\% less memory than they used to require. But we can do better,
  349. especially in the area around our buffer management algorithms, by using an
  350. approach more like the BSD and Linux kernels use instead of our current ring
  351. buffer approach. (For OR connections, we can just use queues of cell-sized
  352. chunks produced with a specialized allocator.) This could potentially save
  353. around 25 to 50\% of the memory currently allocated for network buffers, and
  354. make Tor a more attractive proposition for restricted-memory environments
  355. like old computers, mobile devices, and the like.\plan{Do in 2007; 2-3 weeks
  356. plus one week measurement.} (XXX We did this, but we need to do something
  357. more/else.)
  358. \subsection{Performance: network usage}
  359. We know too little about how well our current path
  360. selection algorithms actually spread traffic around the network in practice.
  361. We should {\bf research the efficacy of our traffic allocation} and either
  362. assure ourselves that it is close enough to optimal as to need no improvement
  363. (unlikely) or {\bf identify ways to improve network usage}, and get more
  364. users' traffic delivered faster. Performing this research will require
  365. careful thought about anonymity implications.
  366. We should also {\bf examine the efficacy of our congestion control
  367. algorithm}, and see whether we can improve client performance in the
  368. presence of a congested network through dynamic `sendme' window sizes or
  369. other means. This will have anonymity implications too if we aren't careful.
  370. \plan{For both of the above: research, design and write
  371. a measurement tool in 2007: 1 month. See if we can interest a graduate
  372. student.}
  373. We should work on making Tor's cell-based protocol perform better on
  374. networks with low bandwidth
  375. and high packet loss.\plan{Do in 2007 if we're funded to do it; 4-6 weeks.}
  376. \subsection{Performance scenario: one Tor client, many users}
  377. We should {\bf improve Tor's performance when a single Tor handles many
  378. clients}. Many organizations want to manage a single Tor client on their
  379. firewall for many users, rather than having each user install a separate
  380. Tor client. We haven't optimized for this scenario, and it is likely that
  381. there are some code paths in the current implementation that become
  382. inefficient when a single Tor is servicing hundreds or thousands of client
  383. connections. (Additionally, it is likely that such clients have interesting
  384. anonymity requirements the we should investigate.) We should profile Tor
  385. under appropriate loads, identify bottlenecks, and fix them.\plan{Do in 2007
  386. if we're funded to do it; 4-8 weeks.}
  387. \subsection{Tor servers on asymmetric bandwidth}
  388. Tor should work better on servers that have asymmetric connections like cable
  389. or DSL. Because Tor has separate TCP connections between each
  390. hop, if the incoming bytes are arriving just fine and the outgoing bytes are
  391. all getting dropped on the floor, the TCP push-back mechanisms don't really
  392. transmit this information back to the incoming streams.\plan{Do in 2007 since
  393. related to bandwidth limiting. 3-4 weeks.}
  394. \subsection{Running Tor as both client and server}
  395. Many performance tradeoffs and balances that might need more attention.
  396. We first need to track and fix whatever bottlenecks emerge; but we also
  397. need to invent good algorithms for prioritizing the client's traffic
  398. without starving the server's traffic too much.\plan{No idea; try
  399. profiling and improving things in 2007.}
  400. \subsection{Protocol redesign for UDP}
  401. Tor has relayed only TCP traffic since its first versions, and has used
  402. TLS-over-TCP to do so. This approach has proved reliable and flexible, but
  403. in the long term we will need to allow UDP traffic on the network, and switch
  404. some or all of the network to using a UDP transport. {\bf Supporting UDP
  405. traffic} will make Tor more suitable for protocols that require UDP, such
  406. as many VOIP protocols. {\bf Using a UDP transport} could greatly reduce
  407. resource limitations on servers, and make the network far less interruptible
  408. by lossy connections. Either of these protocol changes would require a great
  409. deal of design work, however. We hope to be able to enlist the aid of a few
  410. talented graduate students to assist with the initial design and
  411. specification, but the actual implementation will require significant testing
  412. of different reliable transport approaches.\plan{Maybe do a design in 2007 if
  413. we find an interested academic. Ian or Ben L might be good partners here.}
  414. \section{Blocking resistance}
  415. \subsection{Design for blocking resistance}
  416. We have written a design document explaining our general approach to blocking
  417. resistance. We should workshop it with other experts in the field to get
  418. their ideas about how we can improve Tor's efficacy as an anti-censorship
  419. tool.
  420. \subsection{Implementation: client-side and bridges-side}
  421. Bridges will want to be able to {\bf listen on multiple addresses and ports}
  422. if they can, to give the adversary more ports to block.
  423. \subsection{Research: anonymity implications from becoming a bridge}
  424. see arma's bridge proposal; e.g. should bridge users use a second layer of
  425. entry guards?
  426. \subsection{Implementation: bridge authority}
  427. we run some
  428. directory authorities with a slightly modified protocol that doesn't leak
  429. the entire list of bridges. Thus users can learn up-to-date information
  430. for bridges they already know about, but they can't learn about arbitrary
  431. new bridges.
  432. we need a design for distributing the bridge authority over more than one
  433. server
  434. \subsection{Normalizing the Tor protocol on the wire}
  435. Additionally, we should {\bf resist content-based filters}. Though an
  436. adversary can't see what users are saying, some aspects of our protocol are
  437. easy to fingerprint {\em as} Tor. We should correct this where possible.
  438. Look like Firefox; or look like nothing?
  439. Future research: investigate timing similarities with other protocols.
  440. \subsection{Research: scanning-resistance}
  441. \subsection{Research/Design/Impl: how users discover bridges}
  442. Our design anticipates an arms race between discovery methods and censors.
  443. We need to begin the infrastructure on our side quickly, preferably in a
  444. flexible language like Python, so we can adapt quickly to censorship.
  445. phase one: personal bridges
  446. phase two: families of personal bridges
  447. phase three: more structured social network
  448. phase four: bag of tricks
  449. Research: phase five...
  450. Integration with Psiphon, etc?
  451. \subsection{Document best practices for users}
  452. Document best practices for various activities common among
  453. blocked users (e.g. WordPress use).
  454. \subsection{Research: how to know if a bridge has been blocked?}
  455. \subsection{GeoIP maintenance, and "private" user statistics}
  456. How to know if the whole idea is working?
  457. \subsection{Research: hiding whether the user is reading or publishing?}
  458. \subsection{Research: how many bridges do you need to know to maintain
  459. reachability?}
  460. \subsection{Resisting censorship of the Tor website, docs, and mirrors}
  461. We should take some effort to consider {\bf initial distribution of Tor and
  462. related information} in countries where the Tor website and mirrors are
  463. censored. (Right now, most countries that block access to Tor block only the
  464. main website and leave mirrors and the network itself untouched.) Falling
  465. back on word-of-mouth is always a good last resort, but we should also take
  466. steps to make sure it's relatively easy for users to get ahold of a copy.
  467. \section{Security}
  468. \subsection{Security research projects}
  469. We should investigate approaches with some promise to help Tor resist
  470. end-to-end traffic correlation attacks. It's an open research question
  471. whether (and to what extent) {\bf mixed-latency} networks, {\bf low-volume
  472. long-distance padding}, or other approaches can resist these attacks, which
  473. are currently some of the most effective against careful Tor users. We
  474. should research these questions and perform simulations to identify
  475. opportunities for strengthening our design without dropping performance to
  476. unacceptable levels. %Cite something
  477. \plan{Start doing this in 2007; write a paper. 8-16 weeks.}
  478. We've got some preliminary results suggesting that {\bf a topology-aware
  479. routing algorithm}~\cite{feamster:wpes2004} could reduce Tor users'
  480. vulnerability against local or ISP-level adversaries, by ensuring that they
  481. are never in a position to watch both ends of a connection. We need to
  482. examine the effects of this approach in more detail and consider side-effects
  483. on anonymity against other kinds of adversaries. If the approach still looks
  484. promising, we should investigate ways for clients to implement it (or an
  485. approximation of it) without having to download routing tables for the whole
  486. Internet. \plan{Not in 2007 unless a graduate student wants to do it.}
  487. %\tmp{defenses against end-to-end correlation} We don't expect any to work
  488. %right now, but it would be useful to learn that one did. Alternatively,
  489. %proving that one didn't would free up researchers in the field to go work on
  490. %other things.
  491. %
  492. % See above; I think I got this.
  493. We should research the efficacy of {\bf website fingerprinting} attacks,
  494. wherein an adversary tries to match the distinctive traffic and timing
  495. pattern of the resources constituting a given website to the traffic pattern
  496. of a user's client. These attacks work great in simulations, but in
  497. practice we hear they don't work nearly as well. We should get some actual
  498. numbers to investigate the issue, and figure out what's going on. If we
  499. resist these attacks, or can improve our design to resist them, we should.
  500. % add cites
  501. \plan{Possibly part of end-to-end correlation paper. Otherwise, not in 2007
  502. unless a graduate student is interested.}
  503. \subsection{Implementation security}
  504. We should also {\bf mark RAM that holds key material as non-swappable} so
  505. that there is no risk of recovering key material from a hard disk
  506. compromise. This would require submitting patches upstream to OpenSSL, where
  507. support for marking memory as sensitive is currently in a very preliminary
  508. state.\plan{Nice to do, but not in immediate Tor scope.}
  509. There are numerous tools for identifying trouble spots in code (such as
  510. Coverity or even VS2005's code analysis tool) and we should convince somebody
  511. to run some of them against the Tor codebase. Ideally, we could figure out a
  512. way to get our code checked periodically rather than just once.\plan{Almost
  513. no time once we talk somebody into it.}
  514. We should try {\bf protocol fuzzing} to identify errors in our
  515. implementation.\plan{Not in 2007 unless we find a grad student or
  516. undergraduate who wants to try.}
  517. Our guard nodes help prevent an attacker from being able to become a chosen
  518. client's entry point by having each client choose a few favorite entry points
  519. as ``guards'' and stick to them. We should implement a {\bf directory
  520. guards} feature to keep adversaries from enumerating Tor users by acting as
  521. a directory cache.\plan{Do in 2007; 2 weeks.}
  522. \subsection{Detect corrupt exits and other servers}
  523. With the success of our network, we've attracted servers in many locations,
  524. operated by many kinds of people. Unfortunately, some of these locations
  525. have compromised or defective networks, and some of these people are
  526. untrustworthy or incompetent. Our current design relies on authority
  527. administrators to identify bad nodes and mark them as nonfunctioning. We
  528. should {\bf automate the process of identifying malfunctioning nodes} as
  529. follows:
  530. We should create a generic {\bf feedback mechanism for add-on tools} like
  531. Mike Perry's ``Snakes on a Tor'' to report failing nodes to authorities.
  532. \plan{Do in 2006; 1-2 weeks.}
  533. We should write tools to {\bf detect more kinds of innocent node failure},
  534. such as nodes whose network providers intercept SSL, nodes whose network
  535. providers censor popular websites, and so on. We should also try to detect
  536. {\bf routers that snoop traffic}; we could do this by launching connections
  537. to throwaway accounts, and seeing which accounts get used.\plan{Do in 2007;
  538. ask Mike Perry if he's interested. 4-6 weeks.}
  539. We should add {\bf an efficient way for authorities to mark a set of servers
  540. as probably collaborating} though not necessarily otherwise dishonest.
  541. This happens when an administrator starts multiple routers, but doesn't mark
  542. them as belonging to the same family.\plan{Do during v2.1 directory protocol
  543. redesign; 1-2 weeks to implement.}
  544. To avoid attacks where an adversary claims good performance in order to
  545. attract traffic, we should {\bf have authorities measure node performance}
  546. (including stability and bandwidth) themselves, and not simply believe what
  547. they're told. We also measure stability by tracking MTBF. Measuring
  548. bandwidth will be tricky, since it's hard to distinguish between a server with
  549. low capacity, and a high-capacity server with most of its capacity in
  550. use. See also Nikita's NDSS 2008 paper.\plan{Do it if we can interest
  551. a grad student.}
  552. {\bf Operating a directory authority should be easier.} We rely on authority
  553. operators to keep the network running well, but right now their job involves
  554. too much busywork and administrative overhead. A better interface for them
  555. to use could free their time to work on exception cases rather than on
  556. adding named nodes to the network.\plan{Do in 2007; 4-5 weeks.}
  557. \subsection{Protocol security}
  558. In addition to other protocol changes discussed above,
  559. % And should we move some of them down here? -NM
  560. we should add {\bf hooks for denial-of-service resistance}; we have some
  561. preliminary designs, but we shouldn't postpone them until we really need them.
  562. If somebody tries a DDoS attack against the Tor network, we won't want to
  563. wait for all the servers and clients to upgrade to a new
  564. version.\plan{Research project; do this in 2007 if funded.}
  565. \section{Development infrastructure}
  566. \subsection{Build farm}
  567. We've begun to deploy a cross-platform distributed build farm of hosts
  568. that build and test the Tor source every time it changes in our development
  569. repository.
  570. We need to {\bf get more participants}, so that we can test a larger variety
  571. of platforms. (Previously, we've only found out when our code had broken on
  572. obscure platforms when somebody got around to building it.)
  573. We need also to {\bf add our dependencies} to the build farm, so that we can
  574. ensure that libraries we need (especially libevent) do not stop working on
  575. any important platform between one release and the next.
  576. \plan{This is ongoing as more buildbots arrive.}
  577. \subsection{Improved testing harness}
  578. Currently, our {\bf unit tests} cover only about 20\% of the code base. This
  579. is uncomfortably low; we should write more and switch to a more flexible
  580. testing framework.\plan{Ongoing basis, time permitting.}
  581. We should also write flexible {\bf automated single-host deployment tests} so
  582. we can more easily verify that the current codebase works with the
  583. network.\plan{Worthwhile in 2007; would save lots of time. 2-4 weeks.}
  584. We should build automated {\bf stress testing} frameworks so we can see which
  585. realistic loads cause Tor to perform badly, and regularly profile Tor against
  586. these loads. This would give us {\it in vitro} performance values to
  587. supplement our deployment experience.\plan{Worthwhile in 2007; 2-6 weeks.}
  588. We should improve our memory profiling code.\plan{...}
  589. \subsection{Centralized build system}
  590. We currently rely on a separate packager to maintain the packaging system and
  591. to build Tor on each platform for which we distribute binaries. Separate
  592. package maintainers is sensible, but separate package builders has meant
  593. long turnaround times between source releases and package releases. We
  594. should create the necessary infrastructure for us to produce binaries for all
  595. major packages within an hour or so of source release.\plan{We should
  596. brainstorm this at least in 2007.}
  597. \subsection{Improved metrics}
  598. We need a way to {\bf measure the network's health, capacity, and degree of
  599. utilization}. Our current means for doing this are ad hoc and not
  600. completely accurate
  601. We need better ways to {\bf tell which countries are users are coming from,
  602. and how many there are}. A good perspective of the network helps us
  603. allocate resources and identify trouble spots, but our current approaches
  604. will work less and less well as we make it harder for adversaries to
  605. enumerate users. We'll probably want to shift to a smarter, statistical
  606. approach rather than our current ``count and extrapolate'' method.
  607. \plan{All of this in 2007 if funded; 4-8 weeks}
  608. % \tmp{We'd like to know how much of the network is getting used.}
  609. % I think this is covered above -NM
  610. \subsection{Controller library}
  611. We've done lots of design and development on our controller interface, which
  612. allows UI applications and other tools to interact with Tor. We could
  613. encourage the development of more such tools by releasing a {\bf
  614. general-purpose controller library}, ideally with API support for several
  615. popular programming languages.\plan{2006 or 2007; 1-2 weeks.}
  616. \section{User experience}
  617. \subsection{Get blocked less, get blocked less broadly}
  618. Right now, some services block connections from the Tor network because
  619. they don't have a better
  620. way to keep vandals from abusing them than blocking IP addresses associated
  621. with vandalism. Our approach so far has been to educate them about better
  622. solutions that currently exist, but we should also {\bf create better
  623. solutions for limiting vandalism by anonymous users} like credential and
  624. blind-signature based implementations, and encourage their use. Other
  625. promising starting points including writing a patch and explanation for
  626. Wikipedia, and helping Freenode to document, maintain, and expand its
  627. current Tor-friendly position.\plan{Do a writeup here in 2007; 1-2 weeks.}
  628. Those who do block Tor users also block overbroadly, sometimes blacklisting
  629. operators of Tor servers that do not permit exit to their services. We could
  630. obviate innocent reasons for doing so by designing a {\bf narrowly-targeted Tor
  631. RBL service} so that those who wanted to overblock Tor could no longer
  632. plead incompetence.\plan{Possibly in 2007 if we decide it's a good idea; 3
  633. weeks.}
  634. \subsection{All-in-one bundle}
  635. We need a well-tested, well-documented bundle of Tor and supporting
  636. applications configured to use it correctly. We have an initial
  637. implementation well under way, but it will need additional work in
  638. identifying requisite Firefox extensions, identifying security threats,
  639. improving user experience, and so on. This will need significantly more work
  640. before it's ready for a general public release.
  641. \subsection{LiveCD Tor}
  642. We need a nice bootable livecd containing a minimal OS and a few applications
  643. configured to use it correctly. The Anonym.OS project demonstrated that this
  644. is quite feasible, but their project is not currently maintained.
  645. \subsection{A Tor client in a VM}
  646. \tmp{a.k.a JanusVM} which is quite related to the firewall-level deployment
  647. section below. JanusVM is a Linux kernel running in VMWare. It gets an IP
  648. address from the network, and serves as a DHCP server for its host Windows
  649. machine. It intercepts all outgoing traffic and redirects it into Privoxy,
  650. Tor, etc. This Linux-in-Windows approach may help us with scalability in
  651. the short term, and it may also be a good long-term solution rather than
  652. accepting all security risks in Windows.
  653. %\subsection{Interface improvements}
  654. %\tmp{Allow controllers to manipulate server status.}
  655. % (Why is this in the User Experience section?) -RD
  656. % I think it's better left to a generic ``make controller iface better'' item.
  657. \subsection{Firewall-level deployment}
  658. Another useful deployment mode for some users is using {\bf Tor in a firewall
  659. configuration}, and directing all their traffic through Tor. This can be a
  660. little tricky to set up currently, but it's an effective way to make sure no
  661. traffic leaves the host un-anonymized. To achieve this, we need to {\bf
  662. improve and port our new TransPort} feature which allows Tor to be used
  663. without SOCKS support; to {\bf add an anonymizing DNS proxy} feature to Tor;
  664. and to {\bf construct a recommended set of firewall configurations} to redirect
  665. traffic to Tor.
  666. This is an area where {\bf deployment via a livecd}, or an installation
  667. targeted at specialized home routing hardware, could be useful.
  668. \subsection{Assess software and configurations for anonymity risks}
  669. Right now, users and packagers are more or less on their own when selecting
  670. Firefox extensions. We should {\bf assemble a recommended list of browser
  671. extensions} through experiment, and include this in the application bundles
  672. we distribute.
  673. We should also describe {\bf best practices for using Tor with each class of
  674. application}. For example, Ethan Zuckerman has written a detailed
  675. tutorial on how to use Tor, Firefox, GMail, and Wordpress to blog with
  676. improved safety. There are many other cases on the Internet where anonymity
  677. would be helpful, and there are a lot of ways to screw up using Tor.
  678. The Foxtor and Torbutton extensions serve similar purposes; we should pick a
  679. favorite, and merge in the useful features of the other.
  680. %\tmp{clean up our own bundled software:
  681. %E.g. Merge the good features of Foxtor into Torbutton}
  682. %
  683. % What else did you have in mind? -NM
  684. \subsection{Localization}
  685. Right now, most of our user-facing code is internationalized. We need to
  686. internationalize the last few hold-outs (like the Tor expert installer), and get
  687. more translations for the parts that are already internationalized.
  688. Also, we should look into a {\bf unified translator's solution}. Currently,
  689. since different tools have been internationalized using the
  690. framework-appropriate method, different tools require translators to localize
  691. them via different interfaces. Inasmuch as possible, we should make
  692. translators only need to use a single tool to translate the whole Tor suite.
  693. \section{Support}
  694. It would be nice to set up some {\bf user support infrastructure} and
  695. {\bf contributor support infrastructure}, especially focusing on server
  696. operators and on coordinating volunteers.
  697. This includes intuitive and easy ticket systems for bug reports and
  698. feature suggestions (not just mailing lists with a half dozen people
  699. and no clear roles for who answers what), but it also includes a more
  700. personalized and efficient framework for interaction so we keep the
  701. attention and interest of the contributors, and so we make them feel
  702. helpful and wanted.
  703. \section{Documentation}
  704. \subsection{Unified documentation scheme}
  705. We need to {\bf inventory our documentation.} Our documentation so far has
  706. been mostly produced on an {\it ad hoc} basis, in response to particular
  707. needs and requests. We should figure out what documentation we have, which of
  708. it (if any) should get priority, and whether we can't put it all into a
  709. single format.
  710. We could {\bf unify the docs} into a single book-like thing. This will also
  711. help us identify what sections of the ``book'' are missing.
  712. \subsection{Missing technical documentation}
  713. We should {\bf revise our design paper} to reflect the new decisions and
  714. research we've made since it was published in 2004. This will help other
  715. researchers evaluate and suggest improvements to Tor's current design.
  716. Other projects sometimes implement the client side of our protocol. We
  717. encourage this, but we should write {\bf a document about how to avoid
  718. excessive resource use}, so we don't need to worry that they will do so
  719. without regard to the effect of their choices on server resources.
  720. \subsection{Missing user documentation}
  721. Our documentation falls into two broad categories: some is `discoursive' and
  722. explains in detail why users should take certain actions, and other
  723. documentation is `comprehensive' and describes all of Tor's features. Right
  724. now, we have no document that is both deep, readable, and thorough. We
  725. should correct this by identifying missing spots in our design.
  726. \bibliographystyle{plain} \bibliography{tor-design}
  727. \end{document}