dir-spec.txt 26 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580
  1. $Id$
  2. Tor directory protocol for 0.1.1.x series
  3. 0. Scope and preliminaries
  4. This document should eventually be merged into tor-spec.txt and replace
  5. the existing notes on directories.
  6. This is not a finalized version; what we actually wind up implementing
  7. may be very different from the system described here.
  8. 0.1. Goals
  9. There are several problems with the way Tor handles directories right
  10. now:
  11. 1. Directories are very large and use a lot of bandwidth.
  12. 2. Every directory server is a single point of failure.
  13. 3. Requiring every client to know every server won't scale.
  14. 4. Requiring every directory cache to know every server won't scale.
  15. 5. Our current "verified server" system is kind of nonsensical.
  16. 6. Getting more directory servers adds more points of failure and
  17. worsens possible partitioning attacks.
  18. This design tries to solve every problem except problems 3 and 4, and to
  19. be compatible with likely eventual solutions to problems 3 and 4.
  20. 1. Outline
  21. There is no longer any such thing as a "signed directory". Instead,
  22. directory servers sign a very compressed 'network status' object that
  23. lists the current descriptors and their status, and router descriptors
  24. continue to be self-signed by servers. Clients download network status
  25. listings periodically, and download router descriptors as needed. ORs
  26. upload descriptors relatively infrequently.
  27. There are multiple directory servers. Rather than doing anything
  28. complicated to coordinate themselves, clients simply rotate through them
  29. in order, and only use servers that most of the last several directory
  30. servers like.
  31. 2. Router descriptors
  32. Router descriptors are as described in the current tor-spec.txt
  33. document.
  34. ORs SHOULD generate a new router descriptor whenever any of the
  35. following events have occurred:
  36. - A period of time (24 hrs by default) has passed since the last
  37. time a descriptor was generated.
  38. - A descriptor field other than bandwidth or uptime has changed.
  39. - Bandwidth has changed by more than +/- 50% from the last time a
  40. descriptor was generated, and at least a given interval of time (1
  41. hr by default) has passed since then.
  42. - Uptime has been reset.
  43. After generating a descriptor, ORs upload it to every directory
  44. server they know.
  45. The router descriptor format is unchanged from tor-spec.txt.
  46. 3. Network status
  47. Directory servers generate, sign, and compress a network-status document
  48. as needed. As an optimization, they may rate-limit the number of such
  49. documents generated to once every few seconds. Directory servers should
  50. rate-limit at least to the point where these documents are generated no
  51. faster than once per second.
  52. The network status document contains a preamble, a set of router status
  53. entries, and a signature, in that order.
  54. We use the same meta-format as used for directories and router descriptors
  55. in "tor-spec.txt".
  56. The preamble contains:
  57. "network-status-version" -- A document format version. For this
  58. specification, the version is "1".
  59. "directory-source" -- The hostname, current IP address, and directory
  60. port of the directory server, separated by spaces.
  61. "directory-signing-key" -- The directory server's public signing key.
  62. "client-versions" -- A comma-separated list of recommended client versions
  63. "server-versions" -- A comma-separated list of recommended server versions
  64. "published" -- The publication time for this network-status object.
  65. "directory-options" -- A set of flags separated by spaces:
  66. "Names" if this directory server performs name bindings
  67. The directory-options entry is optional; the others are required and must
  68. appear exactly once. The "network-status-version" entry must appear first;
  69. the others may appear in any order.
  70. For each router, the router entry contains: (This format is designed for
  71. conciseness.)
  72. "r" -- followed by the following elements, separated by spaces:
  73. - The OR's nickname,
  74. - A hash of its identity key, encoded in base64, with trailing =
  75. signs removed.
  76. - A hash of its most recent descriptor, encoded in base64, with
  77. trailing = signs removed.
  78. - The publication time of its most recent descriptor.
  79. - An IP
  80. - An OR port
  81. - A directory port (or "0" for none")
  82. "s" -- A series of space-separated status flags:
  83. "Exit" if the router is useful for building general-purpose exit
  84. circuits
  85. "Stable" if the router tends to stay up for a long time
  86. "Fast" if the router has high bandwidth
  87. "Running" if the router is currently usable
  88. "Named" if the router's identity-nickname mapping is canonical.
  89. "Valid" if the router has been 'validated'.
  90. The "r" entry for each router must appear first and is required. The
  91. 's" entry is optional. Unrecognized flags, or extra elements on the
  92. "r" line must be ignored.
  93. The signature section contains:
  94. "directory-signature". A signature of the rest of the document using
  95. the directory server's signing key.
  96. We compress the network status list with zlib before transmitting it.
  97. 4. Directory server operation
  98. By default, directory servers remember all non-expired, non-superseded OR
  99. descriptors that they have seen.
  100. For each OR, a directory server remembers whether the OR was running and
  101. functional the last time they tried to connect to it, and possibly other
  102. liveness information.
  103. Directory server administrators may label some servers or IPs as
  104. blacklisted, and elect not to include them in their network-status lists.
  105. Thus, the network-status list includes all non-blacklisted,
  106. non-expired, non-superseded descriptors for ORs that the directory has
  107. observed at least once to be running.
  108. Directory server administrators may decide to support name binding. If
  109. they do, then they must maintain a file of nickname-to-identity-key
  110. mappings, and try to keep this file consistent with other directory
  111. servers. If they don't, they act as clients, and report bindings made by
  112. other directory servers (name X is bound to identity Y if at least one
  113. binding directory lists it, and no directory binds X to some other Y'.)
  114. The authoritative directory published by a host should be available at:
  115. http://<hostname>/tor/status/authority.z
  116. The most recent descriptor for a server whose identity key has a
  117. fingerprint of <F> should be available at:
  118. http://<hostname>/tor/server/fp/<F>.z
  119. A concatenated set of the most recent descriptors for all known servers
  120. should be available at:
  121. http://<hostname>/tor/server/all.z
  122. [XXXX specify concatenation of several servers.]
  123. 4.1. Caching
  124. Directory caches (most ORs) regularly download network status documents,
  125. and republish them at a URL based on the directory server's identity key:
  126. http://<hostname>/tor/status/<identity fingerprint>.z
  127. A concatenated list of all network-status documents should be available at:
  128. http://<hostname>/tor/status/all.z
  129. 5. Client operation
  130. Every OP or OR, including directory servers, acts as a client to the
  131. directory protocol.
  132. Each client maintains a list of trusted directory servers. Periodically
  133. (currently every 20 minutes), the client downloads a new network status. It
  134. chooses the directory server from which its current information is most
  135. out-of-date, and retries on failure until it finds a running server.
  136. When choosing ORs to build circuits, clients proceed as follows;
  137. - A server is "listed" if it is listed by more than half of the "live"
  138. network status documents the clients have downloaded. (A network
  139. status is "live" if it is the most recently downloaded network status
  140. document for a given directory server, and the server is a directory
  141. server trusted by the client, and the network-status document is no
  142. more than D (say, 10) days old.
  143. - A server is "live" if it is listed as running by at more-than-half of
  144. the last N (three) "live" downloaded network-status documents.
  145. Clients store network status documents so long as they are live.
  146. 5.1. Managing naming
  147. In order to provide human-memorable names for individual server
  148. identities, some directory servers bind names to IDs. Clients handle
  149. names in two ways:
  150. If a client is encountering a name it has not mapped before:
  151. If all the "binding" networks-status documents the client has so far
  152. received same claim that the name binds to some identity X, and the
  153. client has received at least three network-status documents, the client
  154. maps the name to X.
  155. If a client is encountering a name it has mapped before:
  156. It uses the last-mapped identity value, unless all of the "binding"
  157. network status documents bind the name to some other identity.
  158. 6. Remaining issues
  159. Client-knowledge partitioning is worrisome. Most versions of this don't
  160. seem to be worse than the Danezis-Murdoch tracing attack, since an
  161. attacker can't do more than deduce probable exits from entries (or vice
  162. versa). But what about when the client connects to A and B but in a
  163. different order? How bad can it be partitioned based on its knowledge?
  164. ================================================================================
  165. Everything below this line is obsolete.
  166. --------------------------------------------------------------------------------
  167. Tor network discovery protocol
  168. 0. Scope
  169. This document proposes a way of doing more distributed network discovery
  170. while maintaining some amount of admission control. We don't recommend
  171. you implement this as-is; it needs more discussion.
  172. Terminology:
  173. - Client: The Tor component that chooses paths.
  174. - Server: A relay node that passes traffic along.
  175. 1. Goals.
  176. We want more decentralized discovery for network topology and status.
  177. In particular:
  178. 1a. We want to let clients learn about new servers from anywhere
  179. and build circuits through them if they wish. This means that
  180. Tor nodes need to be able to Extend to nodes they don't already
  181. know about.
  182. 1b. We want to let servers limit the addresses and ports they're
  183. willing to extend to. This is necessary e.g. for middleman nodes
  184. who have jerks trying to extend from them to badmafia.com:80 all
  185. day long and it's drawing attention.
  186. 1b'. While we're at it, we also want to handle servers that *can't*
  187. extend to some addresses/ports, e.g. because they're behind NAT or
  188. otherwise firewalled. (See section 5 below.)
  189. 1c. We want to provide a robust (available) and not-too-centralized
  190. mechanism for tracking network status (which nodes are up and working)
  191. and admission (which nodes are "recommended" for certain uses).
  192. 2. Assumptions.
  193. 2a. People get the code from us, and they trust us (or our gpg keys, or
  194. something down the trust chain that's equivalent).
  195. 2b. Even if the software allows humans to change the client configuration,
  196. most of them will use the default that's provided. so we should
  197. provide one that is the right balance of robust and safe. That is,
  198. we need to hard-code enough "first introduction" locations that new
  199. clients will always have an available way to get connected.
  200. 2c. Assume that the current "ask them to email us and see if it seems
  201. suspiciously related to previous emails" approach will not catch
  202. the strong Sybil attackers. Therefore, assume the Sybil attackers
  203. we do want to defend against can produce only a limited number of
  204. not-obviously-on-the-same-subnet nodes.
  205. 2d. Roger has only a limited amount of time for approving nodes; shouldn't
  206. be the time bottleneck anyway; and is doing a poor job at keeping
  207. out some adversaries.
  208. 2e. Some people would be willing to offer servers but will be put off
  209. by the need to send us mail and identify themselves.
  210. 2e'. Some evil people will avoid doing evil things based on the perception
  211. (however true or false) that there are humans monitoring the network
  212. and discouraging evil behavior.
  213. 2e''. Some people will trust the network, and the code, more if they
  214. have the perception that there are trustworthy humans guiding the
  215. deployed network.
  216. 2f. We can trust servers to accurately report their characteristics
  217. (uptime, capacity, exit policies, etc), as long as we have some
  218. mechanism for notifying clients when we notice that they're lying.
  219. 2g. There exists a "main" core Internet in which most locations can access
  220. most locations. We'll focus on it (first).
  221. 3. Some notes on how to achieve.
  222. Piece one: (required)
  223. We ship with N (e.g. 20) directory server locations and fingerprints.
  224. Directory servers serve signed network-status pages, listing their
  225. opinions of network status and which routers are good (see 4a below).
  226. Dirservers collect and provide server descriptors as well. These don't
  227. need to be signed by the dirservers, since they're self-certifying
  228. and timestamped.
  229. (In theory the dirservers don't need to be the ones serving the
  230. descriptors, but in practice the dirservers would need to point people
  231. at the place that does, so for simplicity let's assume that they do.)
  232. Clients then get network-status pages from a threshold of dirservers,
  233. fetch enough of the corresponding server descriptors to make them happy,
  234. and proceed as now.
  235. Piece two: (optional)
  236. We ship with S (e.g. 3) seed keys (trust anchors), and ship with
  237. signed timestamped certs for each dirserver. Dirservers also serve a
  238. list of certs, maybe including a "publish all certs since time foo"
  239. functionality. If at least two seeds agree about something, then it
  240. is so.
  241. Now dirservers can be added, and revoked, without requiring users to
  242. upgrade to a new version. If we only ship with dirserver locations
  243. and not fingerprints, it also means that dirservers can rotate their
  244. signing keys transparently.
  245. But, keeping track of the seed keys becomes a critical security issue.
  246. And rotating them in a backward-compatible way adds complexity. Also,
  247. dirserver locations must be at least somewhere static, since each lost
  248. dirserver degrades reachability for old clients. So as the dirserver
  249. list rolls over we have no choice but to put out new versions.
  250. Piece three: (optional)
  251. Notice that this doesn't preclude other approaches to discovering
  252. different concurrent Tor networks. For example, a Tor network inside
  253. China could ship Tor with a different torrc and poof, they're using
  254. a different set of dirservers. Some smarter clients could be made to
  255. learn about both networks, and be told which nodes bridge the networks.
  256. ...
  257. 4. Unresolved issues.
  258. 4a. How do the dirservers decide whether to recommend a server? We
  259. could have them do it based on contact from the human, but by
  260. assumptions 2c and 2d above, that's going to be less effective, and
  261. more of a hassle, as we scale up. Thus I propose that they simply
  262. do some basic automatic measuring themselves, starting with the
  263. current "are they connected to me" measurement, and that's all
  264. that is done.
  265. We could blacklist as we notice evil servers, but then we're in
  266. the same boat all the irc networks are in. We could whitelist as we
  267. notice new servers, and stop whitelisting (maybe rolling back a bit)
  268. once an attack is in progress. If we assume humans aren't particularly
  269. good at this anyway, we could just do automated delayed whitelisting,
  270. and have a "you're under attack" switch the human can enable for a
  271. while to start acting more conservatively.
  272. Once upon a time we collected contact info for servers, which was
  273. mainly used to remind people that their servers are down and could
  274. they please restart. Now that we have a critical mass of servers,
  275. I've stopped doing that reminding. So contact info is less important.
  276. 4b. What do we do about recommended-versions? Do we need a threshold of
  277. dirservers to claim that your version is obsolete before you believe
  278. them? Or do we make it have less effect -- e.g. print a warning but
  279. never actually quit? Coordinating all the humans to upgrade their
  280. recommended-version strings at once seems bad. Maybe if we have
  281. seeds, the seeds can sign a recommended-version and upload it to
  282. the dirservers.
  283. 4c. What does it mean to bind a nickname to a key? What if each dirserver
  284. does it differently, so one nickname corresponds to several keys?
  285. Maybe the solution is that nickname<=>key bindings should be
  286. individually configured by clients in their torrc (if they want to
  287. refer to nicknames in their torrc), and we stop thinking of nicknames
  288. as globally unique.
  289. 4d. What new features need to be added to server descriptors so they
  290. remain compact yet support new functionality? Section 5 is a start
  291. of discussion of one answer to this.
  292. 5. Regarding "Blossom: an unstructured overlay network for end-to-end
  293. connectivity."
  294. SECTION 5A: Blossom Architecture
  295. Define "transport domain" as a set of nodes who can all mutually name each
  296. other directly, using transport-layer (e.g. HOST:PORT) naming.
  297. Define "clique" as a set of nodes who can all mutually contact each other directly,
  298. using transport-layer (e.g. HOST:PORT) naming.
  299. Neither transport domains and cliques form a partition of the set of all nodes.
  300. Just as cliques may overlap in theoretical graphs, transport domains and
  301. cliques may overlap in the context of Blossom.
  302. In this section we address possible solutions to the problem of how to allow
  303. Tor routers in different transport domains to communicate.
  304. First, we presume that for every interface between transport domains A and B,
  305. one Tor router T_A exists in transport domain A, one Tor router T_B exists in
  306. transport domain B, and (without loss of generality) T_A can open a persistent
  307. connection to T_B. Any Tor traffic between the two routers will occur over
  308. this connection, which effectively renders the routers equal partners in
  309. bridging between the two transport domains. We refer to the established link
  310. between two transport domains as a "bridge" (we use this term because there is
  311. no serious possibility of confusion with the notion of a layer 2 bridge).
  312. Next, suppose that the universe consists of transport domains connected by
  313. persistent connections in this manner. An individual router can open multiple
  314. connections to routers within the same foreign transport domain, and it can
  315. establish separate connections to routers within multiple foreign transport
  316. domains.
  317. As in regular Tor, each Blossom router pushes its descriptor to directory
  318. servers. These directory servers can be within the same transport domain, but
  319. they need not be. The trick is that if a directory server is in another
  320. transport domain, then that directory server must know through which Tor
  321. routers to send messages destined for the Tor router in question.
  322. Blossom routers can advertise themselves to other transport domains in two
  323. ways:
  324. (1) Directly push the descriptor to a directory server in the other transport
  325. domain. This probably works particularly well if the other transport domain is
  326. "the Internet", or if there are hard-coded directory servers in "the Internet".
  327. The router has the responsibility to inform the directory server about which
  328. routers can be used to reach it.
  329. (2) Push the descriptor to a directory server in the same transport domain.
  330. This is the easiest solution for the router, but it relies upon the existence
  331. of a directory server in the same transport domain that is capable of
  332. communicating with directory servers in the remote transport domain. In order
  333. for this to work, some individual Tor routers must have published their
  334. descriptors in remote transport domains (i.e. followed the first option) in
  335. order to provide a link by which directory servers can communiate
  336. bidirectionally.
  337. If all directory servers are within the same transport domain, then approach
  338. (1) is sufficient: routers can exist within multiple transport domains, and as
  339. long as the network of transport domains is fully connected by bridges, any
  340. router will be able to access any other router in a foreign transport domain
  341. simply by extending along the path specified by the directory server. However,
  342. we want the system to be truly decentralized, which means not electing any
  343. particular transport domain to be the master domain in which entries are
  344. published.
  345. This is the explanation for (2): in order for a directory server to share
  346. information with a directory server in a foreign transport domain to which it
  347. cannot speak directly, it must use Tor, which means referring to the other
  348. directory server by using a router in the foreign transport domain. However,
  349. in order to use Tor, it must be able to reach that router, which means that a
  350. descriptor for that router must exist in its table, along with a means of
  351. reaching it. Therefore, in order for a mutual exchange of information between
  352. routers in transport domain A and those in transport domain B to be possible,
  353. when routers in transport domain A cannot establish direct connections with
  354. routers in transport domain B, then some router in transport domain B must have
  355. pushed its descriptor to a directory server in transport domain A, so that the
  356. directory server in transport domain A can use that router to reach the
  357. directory server in transport domain B.
  358. Descriptors for Blossom routers are read-only, as for regular Tor routers, so
  359. directory servers cannot modify them. However, Tor directory servers also
  360. publish a "network-status" page that provide information about which nodes are
  361. up and which are not. Directory servers could provide an additional field for
  362. Blossom nodes. For each Blossom node, the directory server specifies a set of
  363. paths (may be only one) through the overlay (i.e. an ordered list of router
  364. names/IDs) to a router in a foreign transport domain. (This field may be a set
  365. of paths rather than a single path.)
  366. A new router publishing to a directory server in a foreign transport should
  367. include a list of routers. This list should be either:
  368. a. ...a list of routers to which the router has persistent connections, or, if
  369. the new router does not have any persistent connections,
  370. b. ...a (not necessarily exhaustive) list of fellow routers that are in the
  371. same transport domain.
  372. The directory server will be able to use this information to derive a path to
  373. the new router, as follows. If the new router used approach (a), then the
  374. directory server will define the set of paths to the new router as union of the
  375. set of paths to the routers on the list with the name of the last hop appended
  376. to each path. If the new router used approach (b), then the directory server
  377. will define the paths to the new router as the union of the set of paths to the
  378. routers specified in the list. The directory server will then insert the newly
  379. defined path into the field in the network-status page from the router.
  380. When confronted with the choice of multiple different paths to reach the same
  381. router, the Blossom nodes may use a route selection protocol similar in design
  382. to that used by BGP (may be a simple distance-vector route selection procedure
  383. that only takes into account path length, or may be more complex to avoid
  384. loops, cache results, etc.) in order to choose the best one.
  385. If a .exit name is not provided, then a path will be chosen whose nodes are all
  386. among the set of nodes provided by the directory server that are believed to be
  387. in the same transport domain (i.e. no explicit path). Thus, there should be no
  388. surprises to the client. All routers should be careful to define their exit
  389. policies carefully, with the knowledge that clients from potentially any
  390. transport domain could access that which is not explicitly restricted.
  391. SECTION 5B: Tor+Blossom desiderata
  392. The interests of Blossom would be best served by implementing the following
  393. modifications to Tor:
  394. I. CLIENTS
  395. Objectives: Ultimately, we want Blossom requests to be indistinguishable in
  396. format from non-Blossom .exit requests, i.e. hostname.forwarder.exit.
  397. Proposal: Blossom is a process that manipulates Tor, so it should be
  398. implemented as a Tor Control, extending control-spec.txt. For each request,
  399. Tor uses the control protocol to ask the Blossom process whether it (the
  400. Blossom process) wants to build or assign a particular circuit to service the
  401. request. Blossom chooses one of the following responses:
  402. a. (Blossom exit node, circuit cached) "use this circuit" -- provides a circuit
  403. ID
  404. b. (Blossom exit node, circuit not cached) "I will build one" -- provides a
  405. list of routers, gets a circuit ID.
  406. c. (Regular (non-Blossom) exit node) "No, do it yourself" -- provides nothing.
  407. II. ROUTERS
  408. Objectives: Blossom routers are like regular Tor routers, except that Blossom
  409. routers need these features as well:
  410. a. the ability to open peresistent connections,
  411. b. the ability to know whwther they should use a persistent connection to reach
  412. another router,
  413. c. the ability to define a set of routers to which to establish persistent
  414. connections, as readable from a configuration file, and
  415. d. the ability to tell a directory server that (1) it is Blossom-enabled, and
  416. (2) it can be reached by some set of routers to which it explicitly establishes
  417. persistent connections.
  418. Proposal: Address the aforementioned points as follows.
  419. a. need the ability to open a specified number of persistent connections. This
  420. can be accomplished by implementing a generic should_i_close_this_conn() and
  421. which_conns_should_i_try_to_open_even_when_i_dont_need_them().
  422. b. The Tor design already supports this, but we must be sure to establish the
  423. persistent connections explicitly, re-establish them when they are lost, and
  424. not close them unnecessarily.
  425. c. We must modify Tor to add a new configuration option, allowing either (a)
  426. explicit specification of the set of routers to which to establish persistent
  427. connections, or (b) a random choice of some nodes to which to establish
  428. persistent connections, chosen from the set of nodes local to the transport
  429. domain of the specified directory server (for example).
  430. III. DIRSERVERS
  431. Objective: Blossom directory servers may provide extra
  432. fields in their network-status pages. Blossom directory servers may
  433. communicate with Blossom clients/routers in nonstandard ways in addition to
  434. standard ways.
  435. Proposal: Geoff should be able to implement a directory server according to the
  436. Tor specification (dir-spec.txt).