tor-spec.txt 21 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508
  1. $Id$
  2. Tor Spec
  3. Note: This is an attempt to specify Tor as it exists as implemented in
  4. early June, 2003. It is not recommended that others implement this
  5. design as it stands; future versions of Tor will implement improved
  6. protocols.
  7. TODO: (very soon)
  8. - Specify truncate/truncated
  9. - Sendme w/stream0 is circuit sendme
  10. - Integrate -NM and -RD comments
  11. 0. Notation:
  12. PK -- a public key.
  13. SK -- a private key
  14. K -- a key for a symmetric cypher
  15. a|b -- concatenation of 'a' with 'b'.
  16. All numeric values are encoded in network (big-endian) order.
  17. Unless otherwise specified, all symmetric ciphers are AES in counter
  18. mode, with an IV of all 0 bytes. Asymmetric ciphers are either RSA
  19. with 1024-bit keys and exponents of 65537, or DH with the safe prime
  20. from rfc2409, section 6.2, whose hex representation is:
  21. "FFFFFFFFFFFFFFFFC90FDAA22168C234C4C6628B80DC1CD129024E08"
  22. "8A67CC74020BBEA63B139B22514A08798E3404DDEF9519B3CD3A431B"
  23. "302B0A6DF25F14374FE1356D6D51C245E485B576625E7EC6F44C42E9"
  24. "A637ED6B0BFF5CB6F406B7EDEE386BFB5A899FA5AE9F24117C4B1FE6"
  25. "49286651ECE65381FFFFFFFFFFFFFFFF"
  26. 1. System overview
  27. Tor is a connection-oriented anonymizing communication service. Users
  28. build a path known as a "virtual circuit" through the network, in which
  29. each node knows its predecessor and successor, but no others. Traffic
  30. flowing down the circuit is unwrapped by a symmetric key at each node,
  31. which reveals the downstream node.
  32. 2. Connections
  33. There are two ways to connect to an onion router (OR). The first is
  34. as an onion proxy (OP), which allows the OP to authenticate the OR
  35. without authenticating itself. The second is as another OR, which
  36. allows mutual authentication.
  37. Tor uses TLS for link encryption, using the cipher suite
  38. "TLS_DHE_RSA_WITH_AES_128_CBC_SHA". An OR always sends a
  39. self-signed X.509 certificate whose commonName is the server's
  40. nickname, and whose public key is in the server directory.
  41. All parties receiving certificates must confirm that the public
  42. key is as it appears in the server directory, and close the
  43. connection if it is not.
  44. Once a TLS connection is established, the two sides send cells
  45. (specified below) to one another. Cells are sent serially. All
  46. cells are 256 bytes long. Cells may be sent embedded in TLS
  47. records of any size or divided across TLS records, but the framing
  48. of TLS records should not leak information about the type or
  49. contents of the cells.
  50. OR-to-OR connections are never deliberately closed. An OP should
  51. close a connection to an OR if there are no circuits running over
  52. the connection, and an amount of time (KeepalivePeriod, defaults to
  53. 5 minutes) has passed.
  54. 3. Cell Packet format
  55. The basic unit of communication for onion routers and onion
  56. proxies is a fixed-width "cell". Each cell contains the following
  57. fields:
  58. ACI (anonymous circuit identifier) [2 bytes]
  59. Command [1 byte]
  60. Length [1 byte]
  61. Sequence number (unused, set to 0) [4 bytes]
  62. Payload (padded with 0 bytes) [248 bytes]
  63. [Total size: 256 bytes]
  64. The 'Command' field holds one of the following values:
  65. 0 -- PADDING (Padding) (See Sec 6.2)
  66. 1 -- CREATE (Create a circuit) (See Sec 4)
  67. 2 -- CREATED (Acknowledge create) (See Sec 4)
  68. 3 -- RELAY (End-to-end data) (See Sec 5)
  69. 4 -- DESTROY (Stop using a circuit) (See Sec 4)
  70. The interpretation of 'Length' and 'Payload' depend on the type of
  71. the cell.
  72. PADDING: Neither field is used.
  73. CREATE: Length is 144; the payload contains the first phase of the
  74. DH handshake.
  75. CREATED: Length is 128; the payload contains the second phase of
  76. the DH handshake.
  77. RELAY: Length is a value between 8 and 248; the first 'length'
  78. bytes of payload contain useful data.
  79. DESTROY: Neither field is used.
  80. Unused fields are filled with 0 bytes. The payload is padded with
  81. 0 bytes.
  82. PADDING cells are currently used to implement connection
  83. keepalive. ORs and OPs send one another a PADDING cell every few
  84. minutes.
  85. CREATE and DESTROY cells are used to manage circuits; see section
  86. 4 below.
  87. RELAY cells are used to send commands and data along a circuit; see
  88. section 5 below.
  89. 4. Circuit management
  90. 4.1. CREATE and CREATED cells
  91. Users set up circuits incrementally, one hop at a time. To create
  92. a new circuit, users send a CREATE cell to the first node, with the
  93. first half of the DH handshake; that node responds with a CREATED cell
  94. with the second half of the DH handshake. To extend a circuit past
  95. the first hop, the user sends an EXTEND relay cell (see section 5)
  96. which instructs the last node in the circuit to send a CREATE cell
  97. to extend the circuit.
  98. The payload for a CREATE cell is an 'onion skin', consisting of:
  99. RSA-encrypted data [128 bytes]
  100. Symmetrically-encrypted data [16 bytes]
  101. The RSA-encrypted portion contains:
  102. Symmetric key [16 bytes]
  103. First part of DH data (g^x) [112 bytes]
  104. The symmetrically encrypted portion contains:
  105. Second part of DH data (g^x) [16 bytes]
  106. The two parts of the DH data, once decrypted and concatenated, form
  107. g^x as calculated by the client.
  108. The relay payload for an EXTEND relay cell consists of:
  109. Address [4 bytes]
  110. Port [2 bytes]
  111. Onion skin [144 bytes]
  112. The port and address field denote the IPV4 address and port of the
  113. next onion router in the circuit.
  114. 4.2. Setting circuit keys
  115. Once the handshake between the OP and an OR is completed, both
  116. servers can now calculate g^xy with ordinary DH. From the base key
  117. material g^xy, they compute two 16 byte keys, called Kf and Kb as
  118. follows. First, the server represents g^xy as a big-endian
  119. unsigned integer. Next, the server computes 40 bytes of key data
  120. as K = SHA1(g^xy | [00]) | SHA1(g^xy | [01]) where "00" is a single
  121. octet whose value is zero, and "01" is a single octet whose value
  122. is one. The first 16 bytes of K form Kf, and the next 16 bytes of
  123. K form Kb.
  124. Kf is used to encrypt the stream of data going from the OP to the
  125. OR, whereas Kb is used to encrypt the stream of data going from the
  126. OR to the OP.
  127. 4.3. Creating circuits
  128. When creating a circuit through the network, the circuit creator
  129. performs the following steps:
  130. 1. Choose a chain of N onion routers (R_1...R_N) to constitute
  131. the path, such that no router appears in the path twice.
  132. 2. If not already connected to the first router in the chain,
  133. open a new connection to that router.
  134. 3. Choose an ACI not already in use on the connection with the
  135. first router in the chain. If we are an onion router and our
  136. nickname is lexicographically greater than the nickname of the
  137. other side, then let the high bit of the ACI be 1, else 0.
  138. 4. Send a CREATE cell along the connection, to be received by
  139. the first onion router.
  140. 5. Wait until a CREATED cell is received; finish the handshake
  141. and extract the forward key Kf_1 and the back key Kb_1.
  142. 6. For each subsequent onion router R (R_2 through R_N), extend
  143. the circuit to R.
  144. To extend the circuit by a single onion router R_M, the circuit
  145. creator performs these steps:
  146. 1. Create an onion skin, encrypting the RSA-encrypted part with
  147. R's public key.
  148. 2. Encrypt and send the onion skin in a relay EXTEND cell along
  149. the circuit (see section 5).
  150. 3. When a relay EXTENDED cell is received, calculate the shared
  151. keys. The circuit is now extended.
  152. When an onion router receives an EXTEND relay cell, it sends a
  153. CREATE cell to the next onion router, with the enclosed onion skin
  154. as its payload. The initiating onion router chooses some ACI not
  155. yet used on the connection between the two onion routers. (But see
  156. section 4.3. above, concerning choosing ACIs.)
  157. As an extension (called router twins), if the desired next onion
  158. router R in the circuit is down, and some other onion router R'
  159. has the same key as R, then it's ok to extend to R' rather than R.
  160. When an onion router receives a CREATE cell, if it already has a
  161. circuit on the given connection with the given ACI, it drops the
  162. cell. Otherwise, sometime after receiving the CREATE cell, it completes
  163. the DH handshake, and replies with a CREATED cell, containing g^y
  164. as its [128 byte] payload. Upon receiving a CREATED cell, an onion
  165. router packs it payload into an EXTENDED relay cell (see section 5),
  166. and sends that cell up the circuit. Upon receiving the EXTENDED
  167. relay cell, the OP can retrieve g^y.
  168. (As an optimization, OR implementations may delay processing onions
  169. until a break in traffic allows time to do so without harming
  170. network latency too greatly.)
  171. 4.4. Tearing down circuits
  172. Circuits are torn down when an unrecoverable error occurs along
  173. the circuit, or when all streams on a circuit are closed and the
  174. circuit's intended lifetime is over. Circuits may be torn down
  175. either completely or hop-by-hop.
  176. To tear down a circuit completely, an OR or OP sends a DESTROY
  177. cell to the adjacent nodes on that circuit, using the appropriate
  178. direction's ACI.
  179. Upon receiving an outgoing DESTROY cell, an OR frees resources
  180. associated with the corresponding circuit. If it's not the end of
  181. the circuit, it sends a DESTROY cell for that circuit to the next OR
  182. in the circuit. If the node is the end of the circuit, then it tears
  183. down any associated edge connections (see section 5.1).
  184. After a DESTROY cell has been processed, an OR ignores all data or
  185. destroy cells for the corresponding circuit.
  186. To tear down part of a circuit, the OP sends a RELAY_TRUNCATE cell
  187. signaling a given OR (Stream ID zero). That OR sends a DESTROY
  188. cell to the next node in the circuit, and replies to the OP with a
  189. RELAY_TRUNCATED cell.
  190. When an unrecoverable error occurs along one connection in a
  191. circuit, the nodes on either side of the connection should, if they
  192. are able, act as follows: the node closer to the OP should send a
  193. RELAY_TRUNCATED cell towards the OP; the node farther from the OP
  194. should send a DESTROY cell down the circuit.
  195. [We'll have to reevaluate this section once we figure out cleaner
  196. circuit/connection killing conventions. -RD]
  197. 4.5. Routing data cells
  198. When an OR receives a RELAY cell, it checks the cell's ACI and
  199. determines whether it has a corresponding circuit along that
  200. connection. If not, the OR drops the RELAY cell.
  201. Otherwise, if the OR is not at the OP edge of the circuit (that is,
  202. either an 'exit node' or a non-edge node), it de/encrypts the length
  203. field and the payload with AES/CTR, as follows:
  204. 'Forward' relay cell (same direction as CREATE):
  205. Use Kf as key; encrypt.
  206. 'Back' relay cell (opposite direction from CREATE):
  207. Use Kb as key; decrypt.
  208. If the OR recognizes the stream ID on the cell (it is either the ID
  209. of an open stream or the signaling (zero) ID), the OR processes the
  210. contents of the relay cell. Otherwise, it passes the decrypted
  211. relay cell along the circuit if the circuit continues, or drops the
  212. cell if it's the end of the circuit. [Getting an unrecognized
  213. relay cell at the end of the circuit must be allowed for now;
  214. we can reexamine this once we've designed full tcp-style close
  215. handshakes. -RD]
  216. Otherwise, if the data cell is coming from the OP edge of the
  217. circuit, the OP decrypts the length and payload fields with AES/CTR as
  218. follows:
  219. OP sends data cell to node R_M:
  220. For I=1...M, decrypt with Kf_I.
  221. Otherwise, if the data cell is arriving at the OP edge if the
  222. circuit, the OP encrypts the length and payload fields with AES/CTR as
  223. follows:
  224. OP receives data cell:
  225. For I=N...1,
  226. Encrypt with Kb_I. If the stream ID is a recognized
  227. stream for R_I, or if the stream ID is the signaling
  228. ID (zero), then stop and process the payload.
  229. For more information, see section 5 below.
  230. 5. Application connections and stream management
  231. 5.1. Streams
  232. Within a circuit, the OP and the exit node use the contents of
  233. RELAY packets to tunnel end-to-end commands and TCP connections
  234. ("Streams") across circuits. End-to-end commands can be initiated
  235. by either edge; streams are initiated by the OP.
  236. The first 8 bytes of each relay cell are reserved as follows:
  237. Relay command [1 byte]
  238. Stream ID [7 bytes]
  239. The recognized relay commands are:
  240. 1 -- RELAY_BEGIN
  241. 2 -- RELAY_DATA
  242. 3 -- RELAY_END
  243. 4 -- RELAY_CONNECTED
  244. 5 -- RELAY_SENDME
  245. 6 -- RELAY_EXTEND
  246. 7 -- RELAY_EXTENDED
  247. 8 -- RELAY_TRUNCATE
  248. 9 -- RELAY_TRUNCATED
  249. All RELAY cells pertaining to the same tunneled stream have the
  250. same stream ID. Stream ID's are chosen randomly by the OP. A
  251. stream ID is considered "recognized" on a circuit C by an OP or an
  252. OR if it already has an existing stream established on that
  253. circuit, or if the stream ID is equal to the signaling stream ID,
  254. which is all zero: [00 00 00 00 00 00 00]
  255. To create a new anonymized TCP connection, the OP sends a
  256. RELAY_BEGIN data cell with a payload encoding the address and port
  257. of the destination host. The stream ID is zero. The payload format is:
  258. NEWSTREAMID | ADDRESS | ':' | PORT | '\000'
  259. where NEWSTREAMID is the newly generated Stream ID to use for
  260. this stream, ADDRESS may be a DNS hostname, or an IPv4 address in
  261. dotted-quad format; and where PORT is encoded in decimal.
  262. Upon receiving this packet, the exit node resolves the address as
  263. necessary, and opens a new TCP connection to the target port. If
  264. the address cannot be resolved, or a connection can't be
  265. established, the exit node replies with a RELAY_END cell.
  266. Otherwise, the exit node replies with a RELAY_CONNECTED cell.
  267. The OP waits for a RELAY_CONNECTED cell before sending any data.
  268. Once a connection has been established, the OP and exit node
  269. package stream data in RELAY_DATA cells, and upon receiving such
  270. cells, echo their contents to the corresponding TCP stream.
  271. 5.2. Closing streams
  272. [Note -- TCP streams can only be half-closed for reading. Our
  273. Bickford's conversation was incorrect. -NM]
  274. Because TCP connections can be half-open, we follow an equivalent
  275. to TCP's FIN/FIN-ACK/ACK protocol to close streams.
  276. A exit conneection can have a TCP stream in one of three states:
  277. 'OPEN', 'DONE_PACKAGING', and 'DONE_DELIVERING'. For the purposes
  278. of modeling transitions, we treat 'CLOSED' as a fourth state,
  279. although connections in this state are not, in fact, tracked by the
  280. onion router.
  281. A stream begins in the 'OPEN' state. Upon receiving a 'FIN' from
  282. the corresponding TCP connection, the edge node sends a 'RELAY_END'
  283. cell along the circuit and changes its state to 'DONE_PACKAGING'.
  284. Upon receiving a 'RELAY_END' cell, an edge node sends a 'FIN' to
  285. the corresponding TCP connection (e.g., by calling
  286. shutdown(SHUT_WR)) and changing its state to 'DONE_DELIVERING'.
  287. When a stream in already in 'DONE_DELIVERING' receives a 'FIN', it
  288. also sends a 'RELAY_END' along the circuit, and changes its state
  289. to 'CLOSED'. When a stream already in 'DONE_PACKAGING' receives a
  290. 'RELAY_END' cell, it sends a 'FIN' and changes its state to
  291. 'CLOSED'.
  292. [Note: Please rename 'RELAY_END2'. :) -NM ]
  293. If an edge node encounters an error on any stram, it sends a
  294. 'RELAY_END2' cell along the circuit (if possible) and closes the
  295. TCP connection immediately. If an edge node receives a
  296. 'RELAY_END2' cell for any stream, it closes the TCP connection
  297. completely, and sends nothing along the circuit.
  298. 6. Flow control
  299. 6.1. Link throttling
  300. Each node should do appropriate bandwidth throttling to keep its
  301. user happy.
  302. Communicants rely on TCP's default flow control to push back when they
  303. stop reading.
  304. 6.2. Link padding
  305. Currently nodes are not required to do any sort of link padding or
  306. dummy traffic. Because strong attacks exist even with link padding,
  307. and because link padding greatly increases the bandwidth requirements
  308. for running a node, we plan to leave out link padding until this
  309. tradeoff is better understood.
  310. 6.3. Circuit-level flow control
  311. To control a circuit's bandwidth usage, each OR keeps track of
  312. two 'windows', consisting of how many RELAY_DATA cells it is
  313. allowed to package for transmission, and how many RELAY_DATA cells
  314. it is willing to deliver to streams outside the network.
  315. Each 'window' value is initially set to 1000 data cells
  316. in each direction (cells that are not data cells do not affect
  317. the window). When an OR is willing to deliver more cells, it sends a
  318. RELAY_SENDME cell towards the OP, with Stream ID zero. When an OR
  319. receives a RELAY_SENDME cell with stream ID zero, it increments its
  320. packaging window.
  321. Either of these cells increment the corresponding window by 100.
  322. The OP behaves identically, except that it must track a packaging
  323. window and a delivery window for every OR in the circuit.
  324. An OR or OP sends cells to increment its delivery window when the
  325. corresponding window value falls under some threshold (900).
  326. If a packaging window reaches 0, the OR or OP stops reading from
  327. TCP connections for all streams on the corresponding circuit, and
  328. sends no more RELAY_DATA cells until receiving a RELAY_SENDME cell.
  329. 6.4. Stream-level flow control
  330. Edge nodes use RELAY_SENDME cells to implement end-to-end flow
  331. control for individual connections across circuits. Similarly to
  332. circuit-level flow control, edge nodes begin with a window of cells
  333. (500) per stream, and increment the window by a fixed value (50)
  334. upon receiving a RELAY_SENDME cell. Edge nodes initiate RELAY_SENDME
  335. cells when both a) the window is <= 450, and b) there are less than
  336. ten cell payloads remaining to be flushed at that edge.
  337. 7. Directories and routers
  338. 7.1. Router descriptor format.
  339. (Unless otherwise noted, tokens on the same line are space-separated.)
  340. Router ::= Router-Line Date-Line Onion-Key Link-Key Signing-Key Exit-Policy Router-Signature NL
  341. Router-Line ::= "router" nickname address ORPort SocksPort DirPort bandwidth NL
  342. Date-Line ::= "published" YYYY-MM-DD HH:MM:SS NL
  343. Onion-key ::= "onion-key" NL a public key in PEM format NL
  344. Link-key ::= "link-key" NL a public key in PEM format NL
  345. Signing-Key ::= "signing-key" NL a public key in PEM format NL
  346. Exit-Policy ::= Exit-Line*
  347. Exit-Line ::= ("accept"|"reject") string NL
  348. Router-Signature ::= "router-signature" NL Signature
  349. Signature ::= "-----BEGIN SIGNATURE-----" NL
  350. Base-64-encoded-signature NL "-----END SIGNATURE-----" NL
  351. ORport ::= port where the router listens for routers/proxies (speaking cells)
  352. SocksPort ::= where the router listens for applications (speaking socks)
  353. DirPort ::= where the router listens for directory download requests
  354. bandwidth ::= maximum bandwidth, in bytes/s
  355. nickname ::= between 1 and 32 alphanumeric characters. case-insensitive.
  356. Example:
  357. router moria1 moria.mit.edu 9001 9021 9031 100000
  358. published 2003-09-24 19:36:05
  359. -----BEGIN RSA PUBLIC KEY-----
  360. MIGJAoGBAMBBuk1sYxEg5jLAJy86U3GGJ7EGMSV7yoA6mmcsEVU3pwTUrpbpCmwS
  361. 7BvovoY3z4zk63NZVBErgKQUDkn3pp8n83xZgEf4GI27gdWIIwaBjEimuJlEY+7K
  362. nZ7kVMRoiXCbjL6VAtNa4Zy1Af/GOm0iCIDpholeujQ95xew7rQnAgMA//8=
  363. -----END RSA PUBLIC KEY-----
  364. signing-key
  365. -----BEGIN RSA PUBLIC KEY-----
  366. 7BvovoY3z4zk63NZVBErgKQUDkn3pp8n83xZgEf4GI27gdWIIwaBjEimuJlEY+7K
  367. MIGJAoGBAMBBuk1sYxEg5jLAJy86U3GGJ7EGMSV7yoA6mmcsEVU3pwTUrpbpCmwS
  368. f/GOm0iCIDpholeujQ95xew7rnZ7kVMRoiXCbjL6VAtNa4Zy1AQnAgMA//8=
  369. -----END RSA PUBLIC KEY-----
  370. reject 18.0.0.0/24
  371. Note: The extra newline at the end of the router block is intentional.
  372. 7.2. Directory format
  373. Directory ::= Directory-Header Directory-Router Router* Signature
  374. Directory-Header ::= "signed-directory" NL Software-Line NL
  375. Software-Line: "recommended-software" comma-separated-version-list
  376. Directory-Router ::= Router
  377. Directory-Signature ::= "directory-signature" NL Signature
  378. Signature ::= "-----BEGIN SIGNATURE-----" NL
  379. Base-64-encoded-signature NL "-----END SIGNATURE-----" NL
  380. Note: The router block for the directory server must appear first.
  381. The signature is computed by computing the SHA-1 hash of the
  382. directory, from the characters "signed-directory", through the newline
  383. after "directory-signature". This digest is then padded with PKCS.1,
  384. and signed with the directory server's signing key.
  385. 7.3. Behavior of a directory server
  386. lists nodes that are connected currently
  387. speaks http on a socket, spits out directory on request
  388. -----------
  389. (for emacs)
  390. Local Variables:
  391. mode:text
  392. indent-tabs-mode:nil
  393. fill-column:77
  394. End: