roadmap-2007.tex 29 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586
  1. \documentclass{article}
  2. \newenvironment{tightlist}{\begin{list}{$\bullet$}{
  3. \setlength{\itemsep}{0mm}
  4. \setlength{\parsep}{0mm}
  5. % \setlength{\labelsep}{0mm}
  6. % \setlength{\labelwidth}{0mm}
  7. % \setlength{\topsep}{0mm}
  8. }}{\end{list}}
  9. \newcommand{\tmp}[1]{{\bf #1} [......] \\}
  10. \begin{document}
  11. \title{Tor Development Roadmap: Wishlist for Nov 2006--Dec 2007}
  12. \author{Roger Dingledine \and Nick Mathewson \and Shava Nerad}
  13. \maketitle
  14. \pagestyle{plain}
  15. % TO DO:
  16. % add cites
  17. % add time estimates
  18. \section{Introduction}
  19. Hi, Roger! Hi, Shava. This paragraph should get deleted soon. Right now,
  20. this document goes into about as much detail as I'd like to go into for a
  21. technical audience, since that's the audience I know best. It doesn't have
  22. time estimates everywhere. It isn't well prioritized, and it doesn't
  23. distinguish well between things that need lots of research and things that
  24. don't. The breakdowns don't all make sense. There are lots of things where
  25. I don't make it clear how they fit into larger goals, and lots of larger
  26. goals that don't break down into little things. It isn't all stuff we can do
  27. for sure, and it isn't even all stuff we can do for sure in 2007. The
  28. tmp\{\} macro indicates stuff I haven't said enough about. That said, here
  29. goes...
  30. Tor (the software) and Tor (the overall software/network/support/document
  31. suite) are now experiencing all the crises of success. Over the next year,
  32. we're probably going to grow more in terms of users, developers, and funding
  33. than before. This gives us the opportunity to perform long-neglected
  34. maintenance tasks.
  35. \section{Code and design infrastructure}
  36. \subsection{Protocol revision}
  37. To maintain backward compatibility, we've postponed major protocol
  38. changes and redesigns for a long time. Because of this, there are a number
  39. of sensible revisions we've been putting off until we could deploy several of
  40. them at once. To do each of these, we first need to discuss design
  41. alternatives with other cryptographers and outside collaborators to
  42. make sure that our choices are secure.
  43. First of all, our protocol needs better {\bf versioning support} so that we
  44. can make backward-incompatible changes to our core protocol. There are
  45. difficult anonymity issues here, since many naive designs would make it easy
  46. to tell clients apart (and then track them) based on their supported versions.
  47. With protocol versioning support would come the ability to {\bf future-proof
  48. our ciphersuites}. For example, not only our OR protocol, but also our
  49. directory protocol, is pretty firmly tied to the SHA-1 hash function, which
  50. though not yet known to be insecure for our purposes, has begun to show
  51. its age. We should
  52. remove assumptions thoughout our design based on the assumption that public
  53. keys, secret keys, or digests will remain any particular size indefinitely.
  54. A new protocol could support {\bf multiple cell sizes}. Right now, all data
  55. passes through the Tor network divided into 512-byte cells. This is
  56. efficient for high-bandwidth protocols, but inefficient for protocols
  57. like SSH or AIM that send information in small chunks. Of course, we need to
  58. investigate the extent to which multiple sizes could make it easier for an
  59. adversary to fingerprint a traffic pattern.
  60. Our OR {\bf authentication protocol}, though provably
  61. secure\cite{tap:pet2006}, relies more on particular aspects of RSA and our
  62. implementation thereof than we had initially believed. To future-proof
  63. against changes, we should replace it with a less delicate approach.
  64. We might design a {\bf stream migration} feature so that streams tunneled
  65. over Tor could be more resilient to dropped connections and changed IPs.
  66. As a part of our design, we should investigate possible {\bf cipher modes}
  67. other than counter mode. For example, a mode with built-in integrity
  68. checking, error propagation, and random access could simplify our protocol
  69. significantly. Sadly, many of these are patented and unavailable for us.
  70. \subsection{Scalability}
  71. \subsubsection{Improved directory efficiency}
  72. Right now, clients download a statement of the {\bf network status} made by
  73. each directory authority. We could reduce network bandwidth significantly by
  74. having the authorities jointly sign a statement reflecting their vote on the
  75. current network status. This would save clients up to 160K per hour, and
  76. make their view of the network more uniform. Of course, we'd need to make
  77. sure the voting process was secure and resilient to failures in the network.
  78. We should {\bf shorten router descriptors}, since the current format includes
  79. a great deal of information that's only of interest to the directory
  80. authorities, and not of interest to clients. We can do this by having each
  81. router upload a short-form and a long-form signed descriptor, and having
  82. clients download only the short form. Even a naive version of this would
  83. save about 40\% of the bandwidth currently spent by clients downloading
  84. descriptors.
  85. We should {\bf have routers upload their descriptors even less often}, so
  86. that clients do not need to download replacements every 18 hours whether any
  87. information has changed or not. (As of Tor 0.1.2.3-alpha, clients tolerate
  88. routers that don't upload often, but routers still upload at least every 18
  89. hours to support older clients.)
  90. \subsubsection{Non-clique topology}
  91. Our current network design achieves a certain amount of its anonymity by
  92. making clients act like each other through the simple expedient of making
  93. sure that all clients know all servers, and that any server can talk to any
  94. other server. But as the number of servers increases to serve an
  95. ever-greater number of clients, these assumptions become impractical.
  96. At worst, if these scalability issues become troubling before a solution is
  97. found, we can design and build a solution to {\bf split the network into
  98. multiple slices} until a better solution comes along. This is not ideal,
  99. since rather than looking like all other users from a point of view of path
  100. selection, users would ``only'' look like 200,000--300,000 other users.
  101. We are in the process of designing {\bf improved schemes for network
  102. scalability}. Some approaches focus on limiting what an adversary can know
  103. about what a user knows; others focus on reducing the extent to which an
  104. adversary can exploit this knowledge. These are currently in their infancy,
  105. and will probably not be needed in 2007, but they must be designed in 2007 if
  106. they are to be deployed in 2008.
  107. \subsubsection{Relay incentives}
  108. To support more users on the network, we need to get more servers. So far,
  109. we've relied on volunteerism to attract server operators, and so far it's
  110. served us well. But in the long run, we need to {\bf design incentices for
  111. users to run servers} and relay traffic for others. Most obviously, we
  112. could try to build the network so that servers offered improved service for
  113. other servers, but we would need to do so without weakening anonymity and
  114. making it obvious which connections originate from users running servers. We
  115. have some preliminary designs here~\cite{challenges}, but need to perform
  116. some more research to make sure they would be safe and effective.
  117. \subsection{Portability}
  118. Our {\bf Windows implementation}, though much improved, continues to lag
  119. behind Unix and Mac OS X, especially when running as a server. We hope to
  120. merge promising patches from Mike Chiussi to address this point, and bring
  121. Windows performance on par with other platforms.
  122. We should have {\bf better support for portable devices}, including modes of
  123. operation that require less RAM, and that write to disk less frequently (to
  124. avoid wearing out flash RAM).
  125. \subsection{Performance: resource usage}
  126. We've been working on {\bf using less RAM}, especially on servers. This has
  127. paid off a lot for directory caches in the 0.1.2, which in some cases are
  128. using 90\% less memory than they used to require. But we can do better,
  129. especially in the area around our buffer management algorithms, by using an
  130. approach more like the BSD and Linux kernels use instead of our current ring
  131. buffer approach. (For OR connections, we can just use queues of cell-sized
  132. chunks produced with a specialized allocator.) This could potentially save
  133. around 25 to 50\% of the memory currently allocated for network buffers, and
  134. make Tor a more attractive proposition for restricted-memory environments
  135. like old computers, mobile devices, and the like.
  136. We should improve our {\bf bandwidth limiting}. The current system has been
  137. crucial in making users willing to run servers: nobody is willing to run a
  138. server if it might use an unbounded amount of bandwidth, especially if they
  139. are charged for their usage. We can make our system better by letting users
  140. configure bandwidth limits independently for their own traffic and traffic
  141. relayed for others; and by adding write limits for users running directory
  142. servers.
  143. On many hosts, sockets are still in short supply, and will be until we can
  144. migrate our protocol to UDP. We can {\bf use fewer sockets} by making our
  145. self-to-self connections happen internally to the code rather than involving
  146. the operating system's socket implementation.
  147. \subsection{Performance: network usage}
  148. We know too little about how well our current path
  149. selection algorithms actually spread traffic around the network in practice.
  150. We should {\bf research the efficacy of our traffic allocation} and either
  151. assure ourselves that it is close enough to optimal as to need no improvement
  152. (unlikely) or {\bf identify ways to improve network usage}, and get more
  153. users' traffic delivered faster. Performing this research will require
  154. careful thought about anonymity implications.
  155. We should also {\bf examine the efficacy of our congestion control
  156. algorithm}, and see whether we can improve client performance in the
  157. presence of a congested network through dynamic `sendme' window sizes or
  158. other means. This will have anonymity implications too if we aren't careful.
  159. % \tmp{Tune pathgen algorithms to use it better.}
  160. %
  161. % I think I've included this in the above -NM
  162. \subsection{Performance scenario: one Tor client, many users}
  163. We should {\bf improve Tor's performance when a single Tor handles many
  164. clients}. Many organizations want to manage a single Tor client on their
  165. firewall for many users, rather than having each user install a separate
  166. Tor client. We haven't optimized for this scenario, and it is likely that
  167. there are some code paths in the current implementation that become
  168. inefficient when a single Tor is servicing hundreds or thousands of client
  169. connections. (Additionally, it is likely that such clients have interesting
  170. anonymity requirements the we should investigate.) We should profile Tor
  171. under appropriate loads, identify bottlenecks, and fix them.
  172. % \tmp{Other stress-testing, and fix bottlenecks we find.}
  173. %
  174. % I've moved this into 'improved testing harness' below
  175. \subsection{Tor servers on asymmetric bandwidth}
  176. \tmp{Roger, please write? I don't know what to say here.}
  177. \subsection{Running Tor as both client and server}
  178. \tmp{many performance tradeoffs and balances that need more attention.
  179. Roger, please write.}
  180. \subsection{Protocol redesign for UDP}
  181. Tor has relayed only TCP traffic since its first versions, and has used
  182. TLS-over-TCP to do so. This approach has proved reliable and flexible, but
  183. in the long term we will need to allow UDP traffic on the network, and switch
  184. some or all of the network to using a UDP transport. {\bf Supporting UDP
  185. traffic} will make Tor more suitable for protocols that require UDP, such
  186. as many VOIP protocols. {\bf Using a UDP transport} could greatly reduce
  187. resource limitations on servers, and make the network far less interruptable
  188. by lossy connections. Either of these protocol changes would require a great
  189. deal of design work, however. We hope to be able to enlist the aid of a few
  190. talented graduate students to assist with the initial design and
  191. specification, but the actual implementation will require significant testing
  192. of different reliable transport approaches.
  193. \section{Blocking resistance}
  194. \subsection{Design for blocking resistance}
  195. We have written a design document explaining our general approach to blocking
  196. resistance. We should workshop it with other experts in the field to get
  197. their ideas about how we can improve Tor's efficacy as an anti-censorship
  198. tool.
  199. \subsection{Implementation: client-side and bridges-side}
  200. Our anticensorship design calls for some nodes to act as ``bridges'' that can
  201. circumvent a national firewall, and others inside the firewall to act as pure
  202. clients. This part of the design is quite clear-cut; we're probably ready to begin
  203. implementing it. To implement bridges, we need only to have servers publish
  204. themselves as limited-availability relays to a special bridge authority if
  205. they judge they'd make good servers. Clients need a flexible interface to
  206. learn about bridges and to act on knowledge of bridges.
  207. Clients also need to {\bf use the encrypted directory variant} added in Tor
  208. 0.1.2.3-alpha. This will let them retrieve directory information over Tor
  209. once they've got their initial bridges.
  210. Bridges will want to be able to {\bf listen on multiple addresses and ports}
  211. if they can, to give the adversary more ports to block.
  212. Additionally, we should {\bf resist content-based filters}. Though an
  213. adversary can't see what users are saying, some aspects of our protocol are
  214. easy to fingerprint {\em as} Tor. We should correct this where possible.
  215. \subsection{Implementation: bridge authorities}
  216. The design here is also reasonably clear-cut: we need to run some
  217. directory authorities with a slightly modified protocol that doesn't leak
  218. the entire list of bridges. Thus users can learn up-to-date information
  219. for bridges they already know about, but they can't learn about arbitrary
  220. new bridges.
  221. \subsection{Implementation: how users discover bridges}
  222. Our design anticipates an arms race between discovery methods and censors.
  223. We need to begin the infrastructure on our side quickly, preferably in a
  224. flexible language like Python, so we can adapt quickly to censorship.
  225. \subsection{Resisting censorship of the Tor website, docs, and mirrors}
  226. We should take some effort to consider {\bf initial distribution of Tor and
  227. related information} in countries where the Tor website and mirrors are
  228. censored. (Right now, most countries that block access to Tor block only the
  229. main website and leave mirrors and the network itself untouched.) Falling
  230. back on word-of-mouth is always a good last resort, but we should also take
  231. steps to make sure it's relatively easy for users to get ahold of a copy.
  232. \section{Security}
  233. \subsection{Security research projects}
  234. We should investigate approaches with some promise to help Tor resist
  235. end-to-end traffic correlation attacks. It's an open research question
  236. whether (and to what extent) {\bf mixed-latency} networks, {\bf low-volume
  237. long-distance padding}, or other approaches can resist these attacks, which
  238. are currently some of the most effective against careful Tor users. We
  239. should research these questions and perform simulations to identify
  240. opportunities for strengthening our design without dropping performance to
  241. unacceptable levels. %Cite something
  242. We've got some preliminary results suggesting that {\bf a topology-aware
  243. routing algorithm}~\cite{routing-zones} could reduce Tor users'
  244. vulnerability against local or ISP-level adversaries, by ensuring that they
  245. are never in a position to watch both ends of a connection. We need to
  246. examine the effects of this approach in more detail and consider side-effects
  247. on anonymity against other kinds of adversaries. If the approach still looks
  248. promising, we should investigate ways for clients to implement it (or an
  249. approximation of it) without having to download routing tables for the whole
  250. internet.
  251. %\tmp{defenses against end-to-end correlation} We don't expect any to work
  252. %right now, but it would be useful to learn that one did. Alternatively,
  253. %proving that one didn't would free up researchers in the field to go work on
  254. %other things.
  255. %
  256. % See above; I think I got this.
  257. We should research the efficacy of {\bf website fingperprinting} attacks,
  258. wherein an adversary tries to match the distinctive traffic and timing
  259. pattern of the resources constituting a given website to the traffic pattern
  260. of a user's client. These attacks work great in simulations, but in
  261. practice we hear they don't work nearly as well. We should get some actual
  262. numbers to investigte the issue, and figure out what's going on. If we
  263. resist these attacks, or can improve our design to resist them, we should.
  264. % add cites
  265. \subsection{Implementation security}
  266. Right now, each Tor node stores its keys unencrypted. We should {\bf encrypt
  267. more Tor keys} so that Tor authorities can require a startup password. We
  268. should look into adding intermediary medium-term ``signing keys'' between
  269. identity keys and onion keys, so that a password could be required to replace
  270. a signing key, but not to start Tor. This would improve Tor's long-term
  271. security, especially in its directory authority infrastructure.
  272. We should also {\bf mark RAM that holds key material as non-swappable} so
  273. that there is no risk of recovering key material from a hard disk
  274. compromise. This would require submitting patches upstream to OpenSSL, where
  275. support for marking memory as sensitive is currently in a very preliminary
  276. state.
  277. There are numerous tools for identifying trouble spots in code (such as
  278. Coverity or even VS2005's code analysis tool) and we should convince somebody
  279. to run some of them against the Tor codebase. Ideally, we could figure out a
  280. way to get our code checked periodically rather than just once.
  281. We should try {\bf protocol fuzzing} to identify errors in our
  282. implementation.
  283. Our guard nodes help prevent an attacker from being able to become a chosen
  284. client's entry point by having each client choose a few favorite entry points
  285. as ``guards'' and stick to them. We should implement a {\bf directory
  286. guards} feature to keep adversaries from enumerating Tor users by acting as
  287. a directory cache.
  288. \subsection{Detect corrupt exits and other servers}
  289. With the success of our network, we've attracted servers in many locations,
  290. operated by many kinds of people. Unfortunately, some of these locations
  291. have compromised or defective networks, and some of these people are
  292. untrustworthy or incompetent. Our current design relies on authority
  293. administrators to identify bad nodes and mark them as nonfunctioning. We
  294. should {\bf automate the process of identifying malfunctioning nodes} as
  295. follows:
  296. We should create a generic {\bf feedback mechanism for add-on tools} like
  297. Mike Perry's ``Snakes on a Tor'' to report failing nodes to authorities.
  298. We should write tools to {\bf detect more kinds of innocent node failure},
  299. such as nodes whose network providers intercept SSL, nodes whose network
  300. providers censor popular websites, and so on. We should also try to detect
  301. {\bf routers that snoop traffic}; we could do this by launching connections
  302. to throwaway accounts, and seeing which accounts get used.
  303. We should add {\bf an efficient way for authorities to mark a set of servers
  304. as probably collaborating} though not necessarily otherwise dishonest.
  305. This happens when an administrator starts multiple routers, but doesn't mark
  306. them as belonging to the same family.
  307. To avoid attacks where an adversary claims good performance in order to
  308. attract traffic, we should {\bf have authorities measure node performance}
  309. (including stability and bandwidth) themselves, and not simply believe what
  310. they're told. Measuring bandwidth can be tricky, since it's hard to
  311. distinguish between a server with low capacity, and a high-capacity server
  312. with most of its capacity in use.
  313. {\bf Operating a directory authority should be easier.} We rely on authority
  314. operators to keep the network running well, but right now their job involves
  315. too much busywork and administrative overhead. A better interface for them
  316. to use could free their time to work on exception cases rather than on
  317. adding named nodes to the network.
  318. \subsection{Protocol security}
  319. In addition to other protocol changes discussed above,
  320. % And should we move somve of them down here? -NM
  321. we should add {\bf hooks for denial-of-service resistance}; we have some
  322. prelimiary designs, but we shouldn't postpone them until we realy need them.
  323. If somebody tries a DDoS attack against the Tor network, we won't want to
  324. wait for all the servers and clients to upgrade to a new version.
  325. \section{Development infrastructure}
  326. \subsection{Build farm}
  327. We've begun to deploy a cross-platform distributed build farm of hosts
  328. that build and test the Tor source every time it changes in our development
  329. repository.
  330. We need to {\bf get more participants}, so that we can test a larger variety
  331. of platforms. (Previously, we've only found out when our code had broken on
  332. obscure platforms when somebody got around to building it.)
  333. We need also to {\bf add our dependencies} to the build farm, so that we can
  334. ensure that libraries we need (especially libevent) do not stop working on
  335. any important platform between one release and the next.
  336. \subsection{Improved testing harness}
  337. Currently, our {\bf unit tests} cover only about XX\% of the code base. This
  338. is uncomfortably low; we should write more and switch to a more flexible
  339. testing framework.
  340. We should also write flexible {\bf automated single-host deployment tests} so
  341. we can more easily verify that the current codebase works with the network.
  342. We should build automated {\bf stress testing} frameworks so we can see which
  343. realistic loads cause Tor to perform badly, and regularly profile Tor against
  344. these loads. This would give us {\it in vitro} performance values to
  345. supplement our deployment experience.
  346. \subsection{Centralized build system}
  347. We currently rely on a separate packager to maintain the packaging system and
  348. to build Tor on each platform for which we distribute binaries. Separate
  349. package maintainers is sensible, but separate package builders has meant
  350. long turnaround times between source releases and package releases. We
  351. should create the necessary infrastructure for us to produce binaries for all
  352. major packages within an hour or so of source release.
  353. \subsection{Improved metrics}
  354. We need a way to {\bf measure the network's health, capacity, and degree of
  355. utilization}. Our current means for doing this are ad hoc and not
  356. completely accurate.
  357. We need better ways to {\bf tell which countries are users are coming from,
  358. and how many there are}. A good perspective of the network helps us
  359. allocate resources and identify trouble spots, but our current approaches
  360. will work less and less well as we make it harder for adversaries to
  361. enumerate users. We'll probably want to shift to a smarter, statistical
  362. approach rather than our current ``count and extrapolate'' method.
  363. % \tmp{We'd like to know how much of the network is getting used.}
  364. % I think this is covered above -NM
  365. \subsection{Controller library}
  366. We've done lots of design and development on our controller interface, which
  367. allows UI applications and other tools to interact with Tor. We could
  368. encourage the development of more such tools by releasing a {\bf
  369. general-purpose controller library}, ideally with API support for several
  370. popular programming languages.
  371. \section{User experience}
  372. \subsection{Get blocked less, get blocked less broadly}
  373. Right now, some services block connections from the Tor network because
  374. they don't have a better
  375. way to keep vandals from abusing them than blocking IP addresses associated
  376. with vandalism. Our approach so far has been to educate them about better
  377. solutions that currently exist, but we should also {\bf create better
  378. solutions for limiting vandalism by anonymous users} like credential and
  379. blind-signature based implementations, and encourage their use. Other
  380. promising starting points including writing a patch and explanation for
  381. Wikipedia, and helping Freenode to document, maintain, and expand its
  382. current Tor-friendly position.
  383. Those who do block Tor users also block overbroadly, sometimes blacklisting
  384. operators of Tor servers that do not permit exit to their services. We could
  385. obviate innocent reasons for doing so by designing a {\bf narrowly-targeted Tor
  386. RBL service} so that those who wanted to overblock Tor clould no longer
  387. plead incompetence.
  388. \subsection{All-in-one bundle}
  389. We need a well-tested, well-documented bundle of Tor and supporting
  390. applications configured to use it correctly. We have an intial
  391. implementation well under way, but it will need additional work in
  392. identifying requisite Firefox extensions, identifying security threats,
  393. improving user experience, and so on. This will need significantly more work
  394. before it's ready for a general public release.
  395. \subsection{LiveCD Tor}
  396. We need a nice bootable livecd containing a minimal OS and a few applications
  397. configured to use it correctly. The Anonym.OS project demonstrated that this
  398. is quite feasible, but their project is not currently maintained.
  399. \subsection{A Tor client in a VM}
  400. \tmp{a.k.a JanusVM} which is quite related to the firewall-level deployment
  401. section below . Roger, can you write this?
  402. %\subsection{Interface improvements}
  403. %\tmp{Allow controllers to manipulate server status.}
  404. % (Why is this in the User Experience section?) -RD
  405. % I think it's better left to a generic ``make controller iface bettter'' item.
  406. \subsection{Firewall-level deployment}
  407. Another useful deployment mode for some users is using {\bf Tor in a firewall
  408. configuration}, and directing all their traffic through Tor. This can be a
  409. little tricky to set up currently, but it's an effective way to make sure no
  410. traffic leaves the host un-anonymized. To achieve this, we need to {\bf
  411. improve and port our new TransPort} feature which allows Tor to be used
  412. without SOCKS support; to {\bf add an anonymizing DNS proxy} feature to Tor;
  413. and to {\bf construct a recommended set of firewall configurations} to redirect
  414. traffic to Tor.
  415. This is an area where {\bf deployment via a livecd}, or an installation
  416. targetted at specialized home routing hardware, could be useful.
  417. \subsection{Assess software and configurations for anonymity risks}
  418. Right now, users and packagers are more or less on their own when selecting
  419. firefox extensions. We should {\bf assemble a recommended list of browser
  420. extensions} through experiment, and include this in the application bundles
  421. we distribute.
  422. We should also describe {\bf best practices for using Tor with each class of
  423. application}. \tmp{Roger, say more}
  424. The Foxtor and Torbutton extensions serve similar purposes; we should pick a
  425. favorite, and merge in the useful features of the other.
  426. %\tmp{clean up our own bundled software:
  427. %E.g. Merge the good features of Foxtor into Torbutton}
  428. %
  429. % What else did you have in mind? -NM
  430. \subsection{Localization}
  431. Right now, most of our user-facing code is internationalized. We need to
  432. internationalize the last few hold-outs (like the Tor installer), and get
  433. more translations for the parts that are already internationalized.
  434. %[Do you mean the Vidalia bundle installer, or the Tor-installer-for-experts?
  435. %-RD]
  436. % The latter -NM
  437. Also, we should look into a {\bf unified translator's solution}. Currently,
  438. since different tools have been internationalized using the
  439. framework-appropriate method, different tools require translators to localize
  440. them via different interfaces. Inasmuch as possible, we should make
  441. translators only need to use a single tool to translate the whole Tor suite.
  442. \section{Support}
  443. \tmp{would be nice to set up some actual user support infrastructure, especially
  444. focusing on server operators and on coordinating volunteers.} Roger, can you
  445. write this ? I don't know what ``user support infrastructure'' is.
  446. \section{Documentation}
  447. \subsection{Unified documentation scheme}
  448. We need to {\bf inventory our documentation.} Our documentation so far has
  449. been mostly produced on an {\it ad hoc} basis, in response to particular
  450. needs and requests. We should figure out what documentation we have, which of
  451. it (if any) should get priority, and whether we can't put it all into a
  452. single format.
  453. We could {\bf unify the docs} into a single book-like thing. This will also
  454. help us identify what sections of the ``book'' are missing.
  455. \subsection{Missing technical documentation}
  456. We should {\bf revise our design paper} to reflect the new decisions and
  457. research we've made since it was published in 2004. This will help other
  458. researchers evaluate and suggest improvements to Tor's current design.
  459. Other projects sometimes implement the client side of our prototocol. We
  460. encourage this, but we should write {\bf a document about how to avoid
  461. excessive resource use}, so we don't need to worry that they will do so
  462. without regard to the effect of their choices on server resources.
  463. \subsection{Missing user documentation}
  464. Our documentation falls into two broad categories: some is `discoursive' and
  465. explains in detail why users should take certain actions, and other
  466. documenation is `comprehensive' and describes all of Tor's features. Right
  467. now, we have no document that is both deep, readable, and thorough. We
  468. should correct this by identifying missing spots in our design.
  469. \bibliographystyle{plain} \bibliography{tor-design}
  470. \end{document}