hs_client.c 45 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266
  1. /* Copyright (c) 2016-2017, The Tor Project, Inc. */
  2. /* See LICENSE for licensing information */
  3. /**
  4. * \file hs_client.c
  5. * \brief Implement next generation hidden service client functionality
  6. **/
  7. #include "or.h"
  8. #include "hs_circuit.h"
  9. #include "hs_ident.h"
  10. #include "connection_edge.h"
  11. #include "container.h"
  12. #include "rendclient.h"
  13. #include "hs_descriptor.h"
  14. #include "hs_cache.h"
  15. #include "hs_cell.h"
  16. #include "hs_ident.h"
  17. #include "config.h"
  18. #include "directory.h"
  19. #include "hs_client.h"
  20. #include "router.h"
  21. #include "routerset.h"
  22. #include "circuitlist.h"
  23. #include "circuituse.h"
  24. #include "connection.h"
  25. #include "nodelist.h"
  26. #include "circpathbias.h"
  27. #include "connection.h"
  28. #include "hs_ntor.h"
  29. #include "circuitbuild.h"
  30. /* Get all connections that are waiting on a circuit and flag them back to
  31. * waiting for a hidden service descriptor for the given service key
  32. * service_identity_pk. */
  33. static void
  34. flag_all_conn_wait_desc(const ed25519_public_key_t *service_identity_pk)
  35. {
  36. tor_assert(service_identity_pk);
  37. smartlist_t *conns =
  38. connection_list_by_type_state(CONN_TYPE_AP, AP_CONN_STATE_CIRCUIT_WAIT);
  39. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, conn) {
  40. edge_connection_t *edge_conn;
  41. if (BUG(!CONN_IS_EDGE(conn))) {
  42. continue;
  43. }
  44. edge_conn = TO_EDGE_CONN(conn);
  45. if (edge_conn->hs_ident &&
  46. ed25519_pubkey_eq(&edge_conn->hs_ident->identity_pk,
  47. service_identity_pk)) {
  48. connection_ap_mark_as_non_pending_circuit(TO_ENTRY_CONN(conn));
  49. conn->state = AP_CONN_STATE_RENDDESC_WAIT;
  50. }
  51. } SMARTLIST_FOREACH_END(conn);
  52. smartlist_free(conns);
  53. }
  54. /* Remove tracked HSDir requests from our history for this hidden service
  55. * identity public key. */
  56. static void
  57. purge_hid_serv_request(const ed25519_public_key_t *identity_pk)
  58. {
  59. char base64_blinded_pk[ED25519_BASE64_LEN + 1];
  60. ed25519_public_key_t blinded_pk;
  61. tor_assert(identity_pk);
  62. /* Get blinded pubkey of hidden service. It is possible that we just moved
  63. * to a new time period meaning that we won't be able to purge the request
  64. * from the previous time period. That is fine because they will expire at
  65. * some point and we don't care about those anymore. */
  66. hs_build_blinded_pubkey(identity_pk, NULL, 0,
  67. hs_get_time_period_num(approx_time()), &blinded_pk);
  68. if (BUG(ed25519_public_to_base64(base64_blinded_pk, &blinded_pk) < 0)) {
  69. return;
  70. }
  71. /* Purge last hidden service request from cache for this blinded key. */
  72. hs_purge_hid_serv_from_last_hid_serv_requests(base64_blinded_pk);
  73. }
  74. /* A v3 HS circuit successfully connected to the hidden service. Update the
  75. * stream state at <b>hs_conn_ident</b> appropriately. */
  76. static void
  77. note_connection_attempt_succeeded(const hs_ident_edge_conn_t *hs_conn_ident)
  78. {
  79. tor_assert(hs_conn_ident);
  80. /* Remove from the hid serv cache all requests for that service so we can
  81. * query the HSDir again later on for various reasons. */
  82. purge_hid_serv_request(&hs_conn_ident->identity_pk);
  83. /* The v2 subsystem cleans up the intro point time out flag at this stage.
  84. * We don't try to do it here because we still need to keep intact the intro
  85. * point state for future connections. Even though we are able to connect to
  86. * the service, doesn't mean we should reset the timed out intro points.
  87. *
  88. * It is not possible to have successfully connected to an intro point
  89. * present in our cache that was on error or timed out. Every entry in that
  90. * cache have a 2 minutes lifetime so ultimately the intro point(s) state
  91. * will be reset and thus possible to be retried. */
  92. }
  93. /* Given the pubkey of a hidden service in <b>onion_identity_pk</b>, fetch its
  94. * descriptor by launching a dir connection to <b>hsdir</b>. Return 1 on
  95. * success or -1 on error. */
  96. static int
  97. directory_launch_v3_desc_fetch(const ed25519_public_key_t *onion_identity_pk,
  98. const routerstatus_t *hsdir)
  99. {
  100. uint64_t current_time_period = hs_get_time_period_num(approx_time());
  101. ed25519_public_key_t blinded_pubkey;
  102. char base64_blinded_pubkey[ED25519_BASE64_LEN + 1];
  103. hs_ident_dir_conn_t hs_conn_dir_ident;
  104. int retval;
  105. tor_assert(hsdir);
  106. tor_assert(onion_identity_pk);
  107. /* Get blinded pubkey */
  108. hs_build_blinded_pubkey(onion_identity_pk, NULL, 0,
  109. current_time_period, &blinded_pubkey);
  110. /* ...and base64 it. */
  111. retval = ed25519_public_to_base64(base64_blinded_pubkey, &blinded_pubkey);
  112. if (BUG(retval < 0)) {
  113. return -1;
  114. }
  115. /* Copy onion pk to a dir_ident so that we attach it to the dir conn */
  116. ed25519_pubkey_copy(&hs_conn_dir_ident.identity_pk, onion_identity_pk);
  117. /* Setup directory request */
  118. directory_request_t *req =
  119. directory_request_new(DIR_PURPOSE_FETCH_HSDESC);
  120. directory_request_set_routerstatus(req, hsdir);
  121. directory_request_set_indirection(req, DIRIND_ANONYMOUS);
  122. directory_request_set_resource(req, base64_blinded_pubkey);
  123. directory_request_fetch_set_hs_ident(req, &hs_conn_dir_ident);
  124. directory_initiate_request(req);
  125. directory_request_free(req);
  126. log_info(LD_REND, "Descriptor fetch request for service %s with blinded "
  127. "key %s to directory %s",
  128. safe_str_client(ed25519_fmt(onion_identity_pk)),
  129. safe_str_client(base64_blinded_pubkey),
  130. safe_str_client(routerstatus_describe(hsdir)));
  131. /* Cleanup memory. */
  132. memwipe(&blinded_pubkey, 0, sizeof(blinded_pubkey));
  133. memwipe(base64_blinded_pubkey, 0, sizeof(base64_blinded_pubkey));
  134. memwipe(&hs_conn_dir_ident, 0, sizeof(hs_conn_dir_ident));
  135. return 1;
  136. }
  137. /** Return the HSDir we should use to fetch the descriptor of the hidden
  138. * service with identity key <b>onion_identity_pk</b>. */
  139. static routerstatus_t *
  140. pick_hsdir_v3(const ed25519_public_key_t *onion_identity_pk)
  141. {
  142. int retval;
  143. char base64_blinded_pubkey[ED25519_BASE64_LEN + 1];
  144. uint64_t current_time_period = hs_get_time_period_num(approx_time());
  145. smartlist_t *responsible_hsdirs;
  146. ed25519_public_key_t blinded_pubkey;
  147. routerstatus_t *hsdir_rs = NULL;
  148. tor_assert(onion_identity_pk);
  149. responsible_hsdirs = smartlist_new();
  150. /* Get blinded pubkey of hidden service */
  151. hs_build_blinded_pubkey(onion_identity_pk, NULL, 0,
  152. current_time_period, &blinded_pubkey);
  153. /* ...and base64 it. */
  154. retval = ed25519_public_to_base64(base64_blinded_pubkey, &blinded_pubkey);
  155. if (BUG(retval < 0)) {
  156. return NULL;
  157. }
  158. /* Get responsible hsdirs of service for this time period */
  159. hs_get_responsible_hsdirs(&blinded_pubkey, current_time_period, 0, 1,
  160. responsible_hsdirs);
  161. log_debug(LD_REND, "Found %d responsible HSDirs and about to pick one.",
  162. smartlist_len(responsible_hsdirs));
  163. /* Pick an HSDir from the responsible ones. The ownership of
  164. * responsible_hsdirs is given to this function so no need to free it. */
  165. hsdir_rs = hs_pick_hsdir(responsible_hsdirs, base64_blinded_pubkey);
  166. return hsdir_rs;
  167. }
  168. /** Fetch a v3 descriptor using the given <b>onion_identity_pk</b>.
  169. *
  170. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  171. * On error, -1 is returned. */
  172. static int
  173. fetch_v3_desc(const ed25519_public_key_t *onion_identity_pk)
  174. {
  175. routerstatus_t *hsdir_rs =NULL;
  176. tor_assert(onion_identity_pk);
  177. hsdir_rs = pick_hsdir_v3(onion_identity_pk);
  178. if (!hsdir_rs) {
  179. log_info(LD_REND, "Couldn't pick a v3 hsdir.");
  180. return 0;
  181. }
  182. return directory_launch_v3_desc_fetch(onion_identity_pk, hsdir_rs);
  183. }
  184. /* Make sure that the given v3 origin circuit circ is a valid correct
  185. * introduction circuit. This will BUG() on any problems and hard assert if
  186. * the anonymity of the circuit is not ok. Return 0 on success else -1 where
  187. * the circuit should be mark for closed immediately. */
  188. static int
  189. intro_circ_is_ok(const origin_circuit_t *circ)
  190. {
  191. int ret = 0;
  192. tor_assert(circ);
  193. if (BUG(TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_INTRODUCING &&
  194. TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT &&
  195. TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_INTRODUCE_ACKED)) {
  196. ret = -1;
  197. }
  198. if (BUG(circ->hs_ident == NULL)) {
  199. ret = -1;
  200. }
  201. if (BUG(!hs_ident_intro_circ_is_valid(circ->hs_ident))) {
  202. ret = -1;
  203. }
  204. /* This can stop the tor daemon but we want that since if we don't have
  205. * anonymity on this circuit, something went really wrong. */
  206. assert_circ_anonymity_ok(circ, get_options());
  207. return ret;
  208. }
  209. /* Find a descriptor intro point object that matches the given ident in the
  210. * given descriptor desc. Return NULL if not found. */
  211. static const hs_desc_intro_point_t *
  212. find_desc_intro_point_by_ident(const hs_ident_circuit_t *ident,
  213. const hs_descriptor_t *desc)
  214. {
  215. const hs_desc_intro_point_t *intro_point = NULL;
  216. tor_assert(ident);
  217. tor_assert(desc);
  218. SMARTLIST_FOREACH_BEGIN(desc->encrypted_data.intro_points,
  219. const hs_desc_intro_point_t *, ip) {
  220. if (ed25519_pubkey_eq(&ident->intro_auth_pk,
  221. &ip->auth_key_cert->signed_key)) {
  222. intro_point = ip;
  223. break;
  224. }
  225. } SMARTLIST_FOREACH_END(ip);
  226. return intro_point;
  227. }
  228. /* Find a descriptor intro point object from the descriptor object desc that
  229. * matches the given legacy identity digest in legacy_id. Return NULL if not
  230. * found. */
  231. static hs_desc_intro_point_t *
  232. find_desc_intro_point_by_legacy_id(const char *legacy_id,
  233. const hs_descriptor_t *desc)
  234. {
  235. hs_desc_intro_point_t *ret_ip = NULL;
  236. tor_assert(legacy_id);
  237. tor_assert(desc);
  238. /* We will go over every intro point and try to find which one is linked to
  239. * that circuit. Those lists are small so it's not that expensive. */
  240. SMARTLIST_FOREACH_BEGIN(desc->encrypted_data.intro_points,
  241. hs_desc_intro_point_t *, ip) {
  242. SMARTLIST_FOREACH_BEGIN(ip->link_specifiers,
  243. const hs_desc_link_specifier_t *, lspec) {
  244. /* Not all tor node have an ed25519 identity key so we still rely on the
  245. * legacy identity digest. */
  246. if (lspec->type != LS_LEGACY_ID) {
  247. continue;
  248. }
  249. if (fast_memneq(legacy_id, lspec->u.legacy_id, DIGEST_LEN)) {
  250. break;
  251. }
  252. /* Found it. */
  253. ret_ip = ip;
  254. goto end;
  255. } SMARTLIST_FOREACH_END(lspec);
  256. } SMARTLIST_FOREACH_END(ip);
  257. end:
  258. return ret_ip;
  259. }
  260. /* Send an INTRODUCE1 cell along the intro circuit and populate the rend
  261. * circuit identifier with the needed key material for the e2e encryption.
  262. * Return 0 on success, -1 if there is a transient error such that an action
  263. * has been taken to recover and -2 if there is a permanent error indicating
  264. * that both circuits were closed. */
  265. static int
  266. send_introduce1(origin_circuit_t *intro_circ,
  267. origin_circuit_t *rend_circ)
  268. {
  269. int status;
  270. char onion_address[HS_SERVICE_ADDR_LEN_BASE32 + 1];
  271. const ed25519_public_key_t *service_identity_pk = NULL;
  272. const hs_desc_intro_point_t *ip;
  273. tor_assert(rend_circ);
  274. if (intro_circ_is_ok(intro_circ) < 0) {
  275. goto perm_err;
  276. }
  277. service_identity_pk = &intro_circ->hs_ident->identity_pk;
  278. /* For logging purposes. There will be a time where the hs_ident will have a
  279. * version number but for now there is none because it's all v3. */
  280. hs_build_address(service_identity_pk, HS_VERSION_THREE, onion_address);
  281. log_info(LD_REND, "Sending INTRODUCE1 cell to service %s on circuit %u",
  282. safe_str_client(onion_address), TO_CIRCUIT(intro_circ)->n_circ_id);
  283. /* 1) Get descriptor from our cache. */
  284. const hs_descriptor_t *desc =
  285. hs_cache_lookup_as_client(service_identity_pk);
  286. if (desc == NULL || !hs_client_any_intro_points_usable(service_identity_pk,
  287. desc)) {
  288. log_info(LD_REND, "Request to %s %s. Trying to fetch a new descriptor.",
  289. safe_str_client(onion_address),
  290. (desc) ? "didn't have usable intro points" :
  291. "didn't have a descriptor");
  292. hs_client_refetch_hsdesc(service_identity_pk);
  293. /* We just triggered a refetch, make sure every connections are back
  294. * waiting for that descriptor. */
  295. flag_all_conn_wait_desc(service_identity_pk);
  296. /* We just asked for a refetch so this is a transient error. */
  297. goto tran_err;
  298. }
  299. /* We need to find which intro point in the descriptor we are connected to
  300. * on intro_circ. */
  301. ip = find_desc_intro_point_by_ident(intro_circ->hs_ident, desc);
  302. if (BUG(ip == NULL)) {
  303. /* If we can find a descriptor from this introduction circuit ident, we
  304. * must have a valid intro point object. Permanent error. */
  305. goto perm_err;
  306. }
  307. /* Send the INTRODUCE1 cell. */
  308. if (hs_circ_send_introduce1(intro_circ, rend_circ, ip,
  309. desc->subcredential) < 0) {
  310. /* Unable to send the cell, the intro circuit has been marked for close so
  311. * this is a permanent error. */
  312. tor_assert_nonfatal(TO_CIRCUIT(intro_circ)->marked_for_close);
  313. goto perm_err;
  314. }
  315. /* Cell has been sent successfully. Copy the introduction point
  316. * authentication and encryption key in the rendezvous circuit identifier so
  317. * we can compute the ntor keys when we receive the RENDEZVOUS2 cell. */
  318. memcpy(&rend_circ->hs_ident->intro_enc_pk, &ip->enc_key,
  319. sizeof(rend_circ->hs_ident->intro_enc_pk));
  320. ed25519_pubkey_copy(&rend_circ->hs_ident->intro_auth_pk,
  321. &intro_circ->hs_ident->intro_auth_pk);
  322. /* Now, we wait for an ACK or NAK on this circuit. */
  323. circuit_change_purpose(TO_CIRCUIT(intro_circ),
  324. CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT);
  325. /* Set timestamp_dirty, because circuit_expire_building expects it to
  326. * specify when a circuit entered the _C_INTRODUCE_ACK_WAIT state. */
  327. TO_CIRCUIT(intro_circ)->timestamp_dirty = time(NULL);
  328. pathbias_count_use_attempt(intro_circ);
  329. /* Success. */
  330. status = 0;
  331. goto end;
  332. perm_err:
  333. /* Permanent error: it is possible that the intro circuit was closed prior
  334. * because we weren't able to send the cell. Make sure we don't double close
  335. * it which would result in a warning. */
  336. if (!TO_CIRCUIT(intro_circ)->marked_for_close) {
  337. circuit_mark_for_close(TO_CIRCUIT(intro_circ), END_CIRC_REASON_INTERNAL);
  338. }
  339. circuit_mark_for_close(TO_CIRCUIT(rend_circ), END_CIRC_REASON_INTERNAL);
  340. status = -2;
  341. goto end;
  342. tran_err:
  343. status = -1;
  344. end:
  345. memwipe(onion_address, 0, sizeof(onion_address));
  346. return status;
  347. }
  348. /* Using the introduction circuit circ, setup the authentication key of the
  349. * intro point this circuit has extended to. */
  350. static void
  351. setup_intro_circ_auth_key(origin_circuit_t *circ)
  352. {
  353. const hs_descriptor_t *desc;
  354. const hs_desc_intro_point_t *ip;
  355. tor_assert(circ);
  356. desc = hs_cache_lookup_as_client(&circ->hs_ident->identity_pk);
  357. if (BUG(desc == NULL)) {
  358. /* Opening intro circuit without the descriptor is no good... */
  359. goto end;
  360. }
  361. /* We will go over every intro point and try to find which one is linked to
  362. * that circuit. Those lists are small so it's not that expensive. */
  363. ip = find_desc_intro_point_by_legacy_id(
  364. circ->build_state->chosen_exit->identity_digest, desc);
  365. if (ip) {
  366. /* We got it, copy its authentication key to the identifier. */
  367. ed25519_pubkey_copy(&circ->hs_ident->intro_auth_pk,
  368. &ip->auth_key_cert->signed_key);
  369. goto end;
  370. }
  371. /* Reaching this point means we didn't find any intro point for this circuit
  372. * which is not suppose to happen. */
  373. tor_assert_nonfatal_unreached();
  374. end:
  375. return;
  376. }
  377. /* Called when an introduction circuit has opened. */
  378. static void
  379. client_intro_circ_has_opened(origin_circuit_t *circ)
  380. {
  381. tor_assert(circ);
  382. tor_assert(TO_CIRCUIT(circ)->purpose == CIRCUIT_PURPOSE_C_INTRODUCING);
  383. log_info(LD_REND, "Introduction circuit %u has opened. Attaching streams.",
  384. (unsigned int) TO_CIRCUIT(circ)->n_circ_id);
  385. /* This is an introduction circuit so we'll attach the correct
  386. * authentication key to the circuit identifier so it can be identified
  387. * properly later on. */
  388. setup_intro_circ_auth_key(circ);
  389. connection_ap_attach_pending(1);
  390. }
  391. /* Called when a rendezvous circuit has opened. */
  392. static void
  393. client_rendezvous_circ_has_opened(origin_circuit_t *circ)
  394. {
  395. tor_assert(circ);
  396. tor_assert(TO_CIRCUIT(circ)->purpose == CIRCUIT_PURPOSE_C_ESTABLISH_REND);
  397. const extend_info_t *rp_ei = circ->build_state->chosen_exit;
  398. /* Check that we didn't accidentally choose a node that does not understand
  399. * the v3 rendezvous protocol */
  400. if (rp_ei) {
  401. const node_t *rp_node = node_get_by_id(rp_ei->identity_digest);
  402. if (rp_node) {
  403. if (BUG(!node_supports_v3_rendezvous_point(rp_node))) {
  404. return;
  405. }
  406. }
  407. }
  408. log_info(LD_REND, "Rendezvous circuit has opened to %s.",
  409. safe_str_client(extend_info_describe(rp_ei)));
  410. /* Ignore returned value, nothing we can really do. On failure, the circuit
  411. * will be marked for close. */
  412. hs_circ_send_establish_rendezvous(circ);
  413. /* Register rend circuit in circuitmap if it's still alive. */
  414. if (!TO_CIRCUIT(circ)->marked_for_close) {
  415. hs_circuitmap_register_rend_circ_client_side(circ,
  416. circ->hs_ident->rendezvous_cookie);
  417. }
  418. }
  419. /* This is an helper function that convert a descriptor intro point object ip
  420. * to a newly allocated extend_info_t object fully initialized. Return NULL if
  421. * we can't convert it for which chances are that we are missing or malformed
  422. * link specifiers. */
  423. static extend_info_t *
  424. desc_intro_point_to_extend_info(const hs_desc_intro_point_t *ip)
  425. {
  426. extend_info_t *ei;
  427. smartlist_t *lspecs = smartlist_new();
  428. tor_assert(ip);
  429. /* We first encode the descriptor link specifiers into the binary
  430. * representation which is a trunnel object. */
  431. SMARTLIST_FOREACH_BEGIN(ip->link_specifiers,
  432. const hs_desc_link_specifier_t *, desc_lspec) {
  433. link_specifier_t *lspec = hs_desc_lspec_to_trunnel(desc_lspec);
  434. smartlist_add(lspecs, lspec);
  435. } SMARTLIST_FOREACH_END(desc_lspec);
  436. /* Explicitely put the direct connection option to 0 because this is client
  437. * side and there is no such thing as a non anonymous client. */
  438. ei = hs_get_extend_info_from_lspecs(lspecs, &ip->onion_key, 0);
  439. SMARTLIST_FOREACH(lspecs, link_specifier_t *, ls, link_specifier_free(ls));
  440. smartlist_free(lspecs);
  441. return ei;
  442. }
  443. /* Return true iff the intro point ip for the service service_pk is usable.
  444. * This function checks if the intro point is in the client intro state cache
  445. * and checks at the failures. It is considered usable if:
  446. * - No error happened (INTRO_POINT_FAILURE_GENERIC)
  447. * - It is not flagged as timed out (INTRO_POINT_FAILURE_TIMEOUT)
  448. * - The unreachable count is lower than
  449. * MAX_INTRO_POINT_REACHABILITY_FAILURES (INTRO_POINT_FAILURE_UNREACHABLE)
  450. */
  451. static int
  452. intro_point_is_usable(const ed25519_public_key_t *service_pk,
  453. const hs_desc_intro_point_t *ip)
  454. {
  455. const hs_cache_intro_state_t *state;
  456. tor_assert(service_pk);
  457. tor_assert(ip);
  458. state = hs_cache_client_intro_state_find(service_pk,
  459. &ip->auth_key_cert->signed_key);
  460. if (state == NULL) {
  461. /* This means we've never encountered any problem thus usable. */
  462. goto usable;
  463. }
  464. if (state->error) {
  465. log_info(LD_REND, "Intro point with auth key %s had an error. Not usable",
  466. safe_str_client(ed25519_fmt(&ip->auth_key_cert->signed_key)));
  467. goto not_usable;
  468. }
  469. if (state->timed_out) {
  470. log_info(LD_REND, "Intro point with auth key %s timed out. Not usable",
  471. safe_str_client(ed25519_fmt(&ip->auth_key_cert->signed_key)));
  472. goto not_usable;
  473. }
  474. if (state->unreachable_count >= MAX_INTRO_POINT_REACHABILITY_FAILURES) {
  475. log_info(LD_REND, "Intro point with auth key %s unreachable. Not usable",
  476. safe_str_client(ed25519_fmt(&ip->auth_key_cert->signed_key)));
  477. goto not_usable;
  478. }
  479. usable:
  480. return 1;
  481. not_usable:
  482. return 0;
  483. }
  484. /* Using a descriptor desc, return a newly allocated extend_info_t object of a
  485. * randomly picked introduction point from its list. Return NULL if none are
  486. * usable. */
  487. static extend_info_t *
  488. client_get_random_intro(const ed25519_public_key_t *service_pk)
  489. {
  490. extend_info_t *ei = NULL, *ei_excluded = NULL;
  491. smartlist_t *usable_ips = NULL;
  492. const hs_descriptor_t *desc;
  493. const hs_desc_encrypted_data_t *enc_data;
  494. const or_options_t *options = get_options();
  495. tor_assert(service_pk);
  496. desc = hs_cache_lookup_as_client(service_pk);
  497. if (desc == NULL || !hs_client_any_intro_points_usable(service_pk,
  498. desc)) {
  499. log_info(LD_REND, "Unable to randomly select an introduction point "
  500. "because descriptor %s.",
  501. (desc) ? "doesn't have usable intro point" : "is missing");
  502. goto end;
  503. }
  504. enc_data = &desc->encrypted_data;
  505. usable_ips = smartlist_new();
  506. smartlist_add_all(usable_ips, enc_data->intro_points);
  507. while (smartlist_len(usable_ips) != 0) {
  508. int idx;
  509. const hs_desc_intro_point_t *ip;
  510. /* Pick a random intro point and immediately remove it from the usable
  511. * list so we don't pick it again if we have to iterate more. */
  512. idx = crypto_rand_int(smartlist_len(usable_ips));
  513. ip = smartlist_get(usable_ips, idx);
  514. smartlist_del(usable_ips, idx);
  515. /* We need to make sure we have a usable intro points which is in a good
  516. * state in our cache. */
  517. if (!intro_point_is_usable(service_pk, ip)) {
  518. continue;
  519. }
  520. /* Generate an extend info object from the intro point object. */
  521. ei = desc_intro_point_to_extend_info(ip);
  522. if (ei == NULL) {
  523. /* We can get here for instance if the intro point is a private address
  524. * and we aren't allowed to extend to those. */
  525. continue;
  526. }
  527. /* Test the pick against ExcludeNodes. */
  528. if (routerset_contains_extendinfo(options->ExcludeNodes, ei)) {
  529. /* If this pick is in the ExcludeNodes list, we keep its reference so if
  530. * we ever end up not being able to pick anything else and StrictNodes is
  531. * unset, we'll use it. */
  532. ei_excluded = ei;
  533. continue;
  534. }
  535. /* Good pick! Let's go with this. */
  536. goto end;
  537. }
  538. /* Reaching this point means a couple of things. Either we can't use any of
  539. * the intro point listed because the IP address can't be extended to or it
  540. * is listed in the ExcludeNodes list. In the later case, if StrictNodes is
  541. * set, we are forced to not use anything. */
  542. ei = ei_excluded;
  543. if (options->StrictNodes) {
  544. log_warn(LD_REND, "Every introduction points are in the ExcludeNodes set "
  545. "and StrictNodes is set. We can't connect.");
  546. ei = NULL;
  547. }
  548. end:
  549. smartlist_free(usable_ips);
  550. return ei;
  551. }
  552. /* For this introduction circuit, we'll look at if we have any usable
  553. * introduction point left for this service. If so, we'll use the circuit to
  554. * re-extend to a new intro point. Else, we'll close the circuit and its
  555. * corresponding rendezvous circuit. Return 0 if we are re-extending else -1
  556. * if we are closing the circuits.
  557. *
  558. * This is called when getting an INTRODUCE_ACK cell with a NACK. */
  559. static int
  560. close_or_reextend_intro_circ(origin_circuit_t *intro_circ)
  561. {
  562. int ret = -1;
  563. const hs_descriptor_t *desc;
  564. origin_circuit_t *rend_circ;
  565. tor_assert(intro_circ);
  566. desc = hs_cache_lookup_as_client(&intro_circ->hs_ident->identity_pk);
  567. if (BUG(desc == NULL)) {
  568. /* We can't continue without a descriptor. */
  569. goto close;
  570. }
  571. /* We still have the descriptor, great! Let's try to see if we can
  572. * re-extend by looking up if there are any usable intro points. */
  573. if (!hs_client_any_intro_points_usable(&intro_circ->hs_ident->identity_pk,
  574. desc)) {
  575. goto close;
  576. }
  577. /* Try to re-extend now. */
  578. if (hs_client_reextend_intro_circuit(intro_circ) < 0) {
  579. goto close;
  580. }
  581. /* Success on re-extending. Don't return an error. */
  582. ret = 0;
  583. goto end;
  584. close:
  585. /* Change the intro circuit purpose before so we don't report an intro point
  586. * failure again triggering an extra descriptor fetch. The circuit can
  587. * already be closed on failure to re-extend. */
  588. if (!TO_CIRCUIT(intro_circ)->marked_for_close) {
  589. circuit_change_purpose(TO_CIRCUIT(intro_circ),
  590. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  591. circuit_mark_for_close(TO_CIRCUIT(intro_circ), END_CIRC_REASON_FINISHED);
  592. }
  593. /* Close the related rendezvous circuit. */
  594. rend_circ = hs_circuitmap_get_rend_circ_client_side(
  595. intro_circ->hs_ident->rendezvous_cookie);
  596. /* The rendezvous circuit might have collapsed while the INTRODUCE_ACK was
  597. * inflight so we can't expect one every time. */
  598. if (rend_circ) {
  599. circuit_mark_for_close(TO_CIRCUIT(rend_circ), END_CIRC_REASON_FINISHED);
  600. }
  601. end:
  602. return ret;
  603. }
  604. /* Called when we get an INTRODUCE_ACK success status code. Do the appropriate
  605. * actions for the rendezvous point and finally close intro_circ. */
  606. static void
  607. handle_introduce_ack_success(origin_circuit_t *intro_circ)
  608. {
  609. origin_circuit_t *rend_circ = NULL;
  610. tor_assert(intro_circ);
  611. log_info(LD_REND, "Received INTRODUCE_ACK ack! Informing rendezvous");
  612. /* Get the rendezvous circuit for this rendezvous cookie. */
  613. uint8_t *rendezvous_cookie = intro_circ->hs_ident->rendezvous_cookie;
  614. rend_circ = hs_circuitmap_get_rend_circ_client_side(rendezvous_cookie);
  615. if (rend_circ == NULL) {
  616. log_warn(LD_REND, "Can't find any rendezvous circuit. Stopping");
  617. goto end;
  618. }
  619. assert_circ_anonymity_ok(rend_circ, get_options());
  620. circuit_change_purpose(TO_CIRCUIT(rend_circ),
  621. CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED);
  622. /* Set timestamp_dirty, because circuit_expire_building expects it to
  623. * specify when a circuit entered the
  624. * CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED state. */
  625. TO_CIRCUIT(rend_circ)->timestamp_dirty = time(NULL);
  626. end:
  627. /* We don't need the intro circuit anymore. It did what it had to do! */
  628. circuit_change_purpose(TO_CIRCUIT(intro_circ),
  629. CIRCUIT_PURPOSE_C_INTRODUCE_ACKED);
  630. circuit_mark_for_close(TO_CIRCUIT(intro_circ), END_CIRC_REASON_FINISHED);
  631. /* XXX: Close pending intro circuits we might have in parallel. */
  632. return;
  633. }
  634. /* Called when we get an INTRODUCE_ACK failure status code. Depending on our
  635. * failure cache status, either close the circuit or re-extend to a new
  636. * introduction point. */
  637. static void
  638. handle_introduce_ack_bad(origin_circuit_t *circ, int status)
  639. {
  640. tor_assert(circ);
  641. log_info(LD_REND, "Received INTRODUCE_ACK nack by %s. Reason: %u",
  642. safe_str_client(extend_info_describe(circ->build_state->chosen_exit)),
  643. status);
  644. /* It's a NAK. The introduction point didn't relay our request. */
  645. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_INTRODUCING);
  646. /* Note down this failure in the intro point failure cache. Depending on how
  647. * many times we've tried this intro point, close it or reextend. */
  648. hs_cache_client_intro_state_note(&circ->hs_ident->identity_pk,
  649. &circ->hs_ident->intro_auth_pk,
  650. INTRO_POINT_FAILURE_GENERIC);
  651. }
  652. /* Called when we get an INTRODUCE_ACK on the intro circuit circ. The encoded
  653. * cell is in payload of length payload_len. Return 0 on success else a
  654. * negative value. The circuit is either close or reuse to re-extend to a new
  655. * introduction point. */
  656. static int
  657. handle_introduce_ack(origin_circuit_t *circ, const uint8_t *payload,
  658. size_t payload_len)
  659. {
  660. int status, ret = -1;
  661. tor_assert(circ);
  662. tor_assert(circ->build_state);
  663. tor_assert(circ->build_state->chosen_exit);
  664. assert_circ_anonymity_ok(circ, get_options());
  665. tor_assert(payload);
  666. status = hs_cell_parse_introduce_ack(payload, payload_len);
  667. switch (status) {
  668. case HS_CELL_INTRO_ACK_SUCCESS:
  669. ret = 0;
  670. handle_introduce_ack_success(circ);
  671. goto end;
  672. case HS_CELL_INTRO_ACK_FAILURE:
  673. case HS_CELL_INTRO_ACK_BADFMT:
  674. case HS_CELL_INTRO_ACK_NORELAY:
  675. handle_introduce_ack_bad(circ, status);
  676. /* We are going to see if we have to close the circuits (IP and RP) or we
  677. * can re-extend to a new intro point. */
  678. ret = close_or_reextend_intro_circ(circ);
  679. break;
  680. default:
  681. log_info(LD_PROTOCOL, "Unknown INTRODUCE_ACK status code %u from %s",
  682. status,
  683. safe_str_client(extend_info_describe(circ->build_state->chosen_exit)));
  684. break;
  685. }
  686. end:
  687. return ret;
  688. }
  689. /* Called when we get a RENDEZVOUS2 cell on the rendezvous circuit circ. The
  690. * encoded cell is in payload of length payload_len. Return 0 on success or a
  691. * negative value on error. On error, the circuit is marked for close. */
  692. static int
  693. handle_rendezvous2(origin_circuit_t *circ, const uint8_t *payload,
  694. size_t payload_len)
  695. {
  696. int ret = -1;
  697. curve25519_public_key_t server_pk;
  698. uint8_t auth_mac[DIGEST256_LEN] = {0};
  699. uint8_t handshake_info[CURVE25519_PUBKEY_LEN + sizeof(auth_mac)] = {0};
  700. hs_ntor_rend_cell_keys_t keys;
  701. const hs_ident_circuit_t *ident;
  702. tor_assert(circ);
  703. tor_assert(payload);
  704. /* Make things easier. */
  705. ident = circ->hs_ident;
  706. tor_assert(ident);
  707. if (hs_cell_parse_rendezvous2(payload, payload_len, handshake_info,
  708. sizeof(handshake_info)) < 0) {
  709. goto err;
  710. }
  711. /* Get from the handshake info the SERVER_PK and AUTH_MAC. */
  712. memcpy(&server_pk, handshake_info, CURVE25519_PUBKEY_LEN);
  713. memcpy(auth_mac, handshake_info + CURVE25519_PUBKEY_LEN, sizeof(auth_mac));
  714. /* Generate the handshake info. */
  715. if (hs_ntor_client_get_rendezvous1_keys(&ident->intro_auth_pk,
  716. &ident->rendezvous_client_kp,
  717. &ident->intro_enc_pk, &server_pk,
  718. &keys) < 0) {
  719. log_info(LD_REND, "Unable to compute the rendezvous keys.");
  720. goto err;
  721. }
  722. /* Critical check, make sure that the MAC matches what we got with what we
  723. * computed just above. */
  724. if (!hs_ntor_client_rendezvous2_mac_is_good(&keys, auth_mac)) {
  725. log_info(LD_REND, "Invalid MAC in RENDEZVOUS2. Rejecting cell.");
  726. goto err;
  727. }
  728. /* Setup the e2e encryption on the circuit and finalize its state. */
  729. if (hs_circuit_setup_e2e_rend_circ(circ, keys.ntor_key_seed,
  730. sizeof(keys.ntor_key_seed), 0) < 0) {
  731. log_info(LD_REND, "Unable to setup the e2e encryption.");
  732. goto err;
  733. }
  734. /* Success. Hidden service connection finalized! */
  735. ret = 0;
  736. goto end;
  737. err:
  738. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  739. end:
  740. memwipe(&keys, 0, sizeof(keys));
  741. return ret;
  742. }
  743. /* ========== */
  744. /* Public API */
  745. /* ========== */
  746. /** A circuit just finished connecting to a hidden service that the stream
  747. * <b>conn</b> has been waiting for. Let the HS subsystem know about this. */
  748. void
  749. hs_client_note_connection_attempt_succeeded(const edge_connection_t *conn)
  750. {
  751. tor_assert(connection_edge_is_rendezvous_stream(conn));
  752. if (BUG(conn->rend_data && conn->hs_ident)) {
  753. log_warn(LD_BUG, "Stream had both rend_data and hs_ident..."
  754. "Prioritizing hs_ident");
  755. }
  756. if (conn->hs_ident) { /* It's v3: pass it to the prop224 handler */
  757. note_connection_attempt_succeeded(conn->hs_ident);
  758. return;
  759. } else if (conn->rend_data) { /* It's v2: pass it to the legacy handler */
  760. rend_client_note_connection_attempt_ended(conn->rend_data);
  761. return;
  762. }
  763. }
  764. /* With the given encoded descriptor in desc_str and the service key in
  765. * service_identity_pk, decode the descriptor and set the desc pointer with a
  766. * newly allocated descriptor object.
  767. *
  768. * Return 0 on success else a negative value and desc is set to NULL. */
  769. int
  770. hs_client_decode_descriptor(const char *desc_str,
  771. const ed25519_public_key_t *service_identity_pk,
  772. hs_descriptor_t **desc)
  773. {
  774. int ret;
  775. uint8_t subcredential[DIGEST256_LEN];
  776. ed25519_public_key_t blinded_pubkey;
  777. tor_assert(desc_str);
  778. tor_assert(service_identity_pk);
  779. tor_assert(desc);
  780. /* Create subcredential for this HS so that we can decrypt */
  781. {
  782. uint64_t current_time_period = hs_get_time_period_num(approx_time());
  783. hs_build_blinded_pubkey(service_identity_pk, NULL, 0, current_time_period,
  784. &blinded_pubkey);
  785. hs_get_subcredential(service_identity_pk, &blinded_pubkey, subcredential);
  786. }
  787. /* Parse descriptor */
  788. ret = hs_desc_decode_descriptor(desc_str, subcredential, desc);
  789. memwipe(subcredential, 0, sizeof(subcredential));
  790. if (ret < 0) {
  791. log_warn(LD_GENERAL, "Could not parse received descriptor as client");
  792. goto err;
  793. }
  794. /* Make sure the descriptor signing key cross certifies with the computed
  795. * blinded key. Without this validation, anyone knowing the subcredential
  796. * and onion address can forge a descriptor. */
  797. if (tor_cert_checksig((*desc)->plaintext_data.signing_key_cert,
  798. &blinded_pubkey, approx_time()) < 0) {
  799. log_warn(LD_GENERAL, "Descriptor signing key certificate signature "
  800. "doesn't validate with computed blinded key.");
  801. goto err;
  802. }
  803. return 0;
  804. err:
  805. return -1;
  806. }
  807. /* Return true iff there are at least one usable intro point in the service
  808. * descriptor desc. */
  809. int
  810. hs_client_any_intro_points_usable(const ed25519_public_key_t *service_pk,
  811. const hs_descriptor_t *desc)
  812. {
  813. tor_assert(service_pk);
  814. tor_assert(desc);
  815. SMARTLIST_FOREACH_BEGIN(desc->encrypted_data.intro_points,
  816. const hs_desc_intro_point_t *, ip) {
  817. if (intro_point_is_usable(service_pk, ip)) {
  818. goto usable;
  819. }
  820. } SMARTLIST_FOREACH_END(ip);
  821. return 0;
  822. usable:
  823. return 1;
  824. }
  825. /** Launch a connection to a hidden service directory to fetch a hidden
  826. * service descriptor using <b>identity_pk</b> to get the necessary keys.
  827. *
  828. * On success, 1 is returned. If no hidden service is left to ask, return 0.
  829. * On error, -1 is returned. (retval is only used by unittests right now) */
  830. int
  831. hs_client_refetch_hsdesc(const ed25519_public_key_t *identity_pk)
  832. {
  833. tor_assert(identity_pk);
  834. /* Are we configured to fetch descriptors? */
  835. if (!get_options()->FetchHidServDescriptors) {
  836. log_warn(LD_REND, "We received an onion address for a hidden service "
  837. "descriptor but we are configured to not fetch.");
  838. return 0;
  839. }
  840. /* Check if fetching a desc for this HS is useful to us right now */
  841. {
  842. const hs_descriptor_t *cached_desc = NULL;
  843. cached_desc = hs_cache_lookup_as_client(identity_pk);
  844. if (cached_desc && hs_client_any_intro_points_usable(identity_pk,
  845. cached_desc)) {
  846. log_warn(LD_GENERAL, "We would fetch a v3 hidden service descriptor "
  847. "but we already have a useable descriprot.");
  848. return 0;
  849. }
  850. }
  851. return fetch_v3_desc(identity_pk);
  852. }
  853. /* This is called when we are trying to attach an AP connection to these
  854. * hidden service circuits from connection_ap_handshake_attach_circuit().
  855. * Return 0 on success, -1 for a transient error that is actions were
  856. * triggered to recover or -2 for a permenent error where both circuits will
  857. * marked for close.
  858. *
  859. * The following supports every hidden service version. */
  860. int
  861. hs_client_send_introduce1(origin_circuit_t *intro_circ,
  862. origin_circuit_t *rend_circ)
  863. {
  864. return (intro_circ->hs_ident) ? send_introduce1(intro_circ, rend_circ) :
  865. rend_client_send_introduction(intro_circ,
  866. rend_circ);
  867. }
  868. /* Called when the client circuit circ has been established. It can be either
  869. * an introduction or rendezvous circuit. This function handles all hidden
  870. * service versions. */
  871. void
  872. hs_client_circuit_has_opened(origin_circuit_t *circ)
  873. {
  874. tor_assert(circ);
  875. /* Handle both version. v2 uses rend_data and v3 uses the hs circuit
  876. * identifier hs_ident. Can't be both. */
  877. switch (TO_CIRCUIT(circ)->purpose) {
  878. case CIRCUIT_PURPOSE_C_INTRODUCING:
  879. if (circ->hs_ident) {
  880. client_intro_circ_has_opened(circ);
  881. } else {
  882. rend_client_introcirc_has_opened(circ);
  883. }
  884. break;
  885. case CIRCUIT_PURPOSE_C_ESTABLISH_REND:
  886. if (circ->hs_ident) {
  887. client_rendezvous_circ_has_opened(circ);
  888. } else {
  889. rend_client_rendcirc_has_opened(circ);
  890. }
  891. break;
  892. default:
  893. tor_assert_nonfatal_unreached();
  894. }
  895. }
  896. /* Called when we receive a RENDEZVOUS_ESTABLISHED cell. Change the state of
  897. * the circuit to CIRCUIT_PURPOSE_C_REND_READY. Return 0 on success else a
  898. * negative value and the circuit marked for close. */
  899. int
  900. hs_client_receive_rendezvous_acked(origin_circuit_t *circ,
  901. const uint8_t *payload, size_t payload_len)
  902. {
  903. tor_assert(circ);
  904. tor_assert(payload);
  905. (void) payload_len;
  906. if (TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_ESTABLISH_REND) {
  907. log_warn(LD_PROTOCOL, "Got a RENDEZVOUS_ESTABLISHED but we were not "
  908. "expecting one. Closing circuit.");
  909. goto err;
  910. }
  911. log_info(LD_REND, "Received an RENDEZVOUS_ESTABLISHED. This circuit is "
  912. "now ready for rendezvous.");
  913. circuit_change_purpose(TO_CIRCUIT(circ), CIRCUIT_PURPOSE_C_REND_READY);
  914. /* Set timestamp_dirty, because circuit_expire_building expects it to
  915. * specify when a circuit entered the _C_REND_READY state. */
  916. TO_CIRCUIT(circ)->timestamp_dirty = time(NULL);
  917. /* From a path bias point of view, this circuit is now successfully used.
  918. * Waiting any longer opens us up to attacks from malicious hidden services.
  919. * They could induce the client to attempt to connect to their hidden
  920. * service and never reply to the client's rend requests */
  921. pathbias_mark_use_success(circ);
  922. /* If we already have the introduction circuit built, make sure we send
  923. * the INTRODUCE cell _now_ */
  924. connection_ap_attach_pending(1);
  925. return 0;
  926. err:
  927. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  928. return -1;
  929. }
  930. /* This is called when a descriptor has arrived following a fetch request and
  931. * has been stored in the client cache. Every entry connection that matches
  932. * the service identity key in the ident will get attached to the hidden
  933. * service circuit. */
  934. void
  935. hs_client_desc_has_arrived(const hs_ident_dir_conn_t *ident)
  936. {
  937. time_t now = time(NULL);
  938. smartlist_t *conns = NULL;
  939. tor_assert(ident);
  940. conns = connection_list_by_type_state(CONN_TYPE_AP,
  941. AP_CONN_STATE_RENDDESC_WAIT);
  942. SMARTLIST_FOREACH_BEGIN(conns, connection_t *, base_conn) {
  943. const hs_descriptor_t *desc;
  944. entry_connection_t *entry_conn = TO_ENTRY_CONN(base_conn);
  945. const edge_connection_t *edge_conn = ENTRY_TO_EDGE_CONN(entry_conn);
  946. /* Only consider the entry connections that matches the service for which
  947. * we just fetched its descriptor. */
  948. if (!edge_conn->hs_ident ||
  949. !ed25519_pubkey_eq(&ident->identity_pk,
  950. &edge_conn->hs_ident->identity_pk)) {
  951. continue;
  952. }
  953. assert_connection_ok(base_conn, now);
  954. /* We were just called because we stored the descriptor for this service
  955. * so not finding a descriptor means we have a bigger problem. */
  956. desc = hs_cache_lookup_as_client(&ident->identity_pk);
  957. if (BUG(desc == NULL)) {
  958. goto end;
  959. }
  960. if (!hs_client_any_intro_points_usable(&ident->identity_pk, desc)) {
  961. log_info(LD_REND, "Hidden service descriptor is unusable. "
  962. "Closing streams.");
  963. connection_mark_unattached_ap(entry_conn,
  964. END_STREAM_REASON_RESOLVEFAILED);
  965. /* We are unable to use the descriptor so remove the directory request
  966. * from the cache so the next connection can try again. */
  967. note_connection_attempt_succeeded(edge_conn->hs_ident);
  968. goto end;
  969. }
  970. log_info(LD_REND, "Descriptor has arrived. Launching circuits.");
  971. /* Restart their timeout values, so they get a fair shake at connecting to
  972. * the hidden service. XXX: Improve comment on why this is needed. */
  973. base_conn->timestamp_created = now;
  974. base_conn->timestamp_lastread = now;
  975. base_conn->timestamp_lastwritten = now;
  976. /* Change connection's state into waiting for a circuit. */
  977. base_conn->state = AP_CONN_STATE_CIRCUIT_WAIT;
  978. connection_ap_mark_as_pending_circuit(entry_conn);
  979. } SMARTLIST_FOREACH_END(base_conn);
  980. end:
  981. /* We don't have ownership of the objects in this list. */
  982. smartlist_free(conns);
  983. }
  984. /* Return a newly allocated extend_info_t for a randomly chosen introduction
  985. * point for the given edge connection identifier ident. Return NULL if we
  986. * can't pick any usable introduction points. */
  987. extend_info_t *
  988. hs_client_get_random_intro_from_edge(const edge_connection_t *edge_conn)
  989. {
  990. tor_assert(edge_conn);
  991. return (edge_conn->hs_ident) ?
  992. client_get_random_intro(&edge_conn->hs_ident->identity_pk) :
  993. rend_client_get_random_intro(edge_conn->rend_data);
  994. }
  995. /* Called when get an INTRODUCE_ACK cell on the introduction circuit circ.
  996. * Return 0 on success else a negative value is returned. The circuit will be
  997. * closed or reuse to extend again to another intro point. */
  998. int
  999. hs_client_receive_introduce_ack(origin_circuit_t *circ,
  1000. const uint8_t *payload, size_t payload_len)
  1001. {
  1002. int ret = -1;
  1003. tor_assert(circ);
  1004. tor_assert(payload);
  1005. if (TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_INTRODUCE_ACK_WAIT) {
  1006. log_warn(LD_PROTOCOL, "Unexpected INTRODUCE_ACK on circuit %u.",
  1007. (unsigned int) TO_CIRCUIT(circ)->n_circ_id);
  1008. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  1009. goto end;
  1010. }
  1011. ret = (circ->hs_ident) ? handle_introduce_ack(circ, payload, payload_len) :
  1012. rend_client_introduction_acked(circ, payload,
  1013. payload_len);
  1014. /* For path bias: This circuit was used successfully. NACK or ACK counts. */
  1015. pathbias_mark_use_success(circ);
  1016. end:
  1017. return ret;
  1018. }
  1019. /* Called when get a RENDEZVOUS2 cell on the rendezvous circuit circ. Return
  1020. * 0 on success else a negative value is returned. The circuit will be closed
  1021. * on error. */
  1022. int
  1023. hs_client_receive_rendezvous2(origin_circuit_t *circ,
  1024. const uint8_t *payload, size_t payload_len)
  1025. {
  1026. int ret = -1;
  1027. tor_assert(circ);
  1028. tor_assert(payload);
  1029. /* Circuit can possibly be in both state because we could receive a
  1030. * RENDEZVOUS2 cell before the INTRODUCE_ACK has been received. */
  1031. if (TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_REND_READY &&
  1032. TO_CIRCUIT(circ)->purpose != CIRCUIT_PURPOSE_C_REND_READY_INTRO_ACKED) {
  1033. log_warn(LD_PROTOCOL, "Unexpected RENDEZVOUS2 cell on circuit %u. "
  1034. "Closing circuit.",
  1035. (unsigned int) TO_CIRCUIT(circ)->n_circ_id);
  1036. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_TORPROTOCOL);
  1037. goto end;
  1038. }
  1039. log_info(LD_REND, "Got RENDEZVOUS2 cell from hidden service on circuit %u.",
  1040. TO_CIRCUIT(circ)->n_circ_id);
  1041. ret = (circ->hs_ident) ? handle_rendezvous2(circ, payload, payload_len) :
  1042. rend_client_receive_rendezvous(circ, payload,
  1043. payload_len);
  1044. end:
  1045. return ret;
  1046. }
  1047. /* Extend the introduction circuit circ to another valid introduction point
  1048. * for the hidden service it is trying to connect to, or mark it and launch a
  1049. * new circuit if we can't extend it. Return 0 on success or possible
  1050. * success. Return -1 and mark the introduction circuit for close on permanent
  1051. * failure.
  1052. *
  1053. * On failure, the caller is responsible for marking the associated rendezvous
  1054. * circuit for close. */
  1055. int
  1056. hs_client_reextend_intro_circuit(origin_circuit_t *circ)
  1057. {
  1058. int ret = -1;
  1059. extend_info_t *ei;
  1060. tor_assert(circ);
  1061. ei = (circ->hs_ident) ?
  1062. client_get_random_intro(&circ->hs_ident->identity_pk) :
  1063. rend_client_get_random_intro(circ->rend_data);
  1064. if (ei == NULL) {
  1065. log_warn(LD_REND, "No usable introduction points left. Closing.");
  1066. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_INTERNAL);
  1067. goto end;
  1068. }
  1069. if (circ->remaining_relay_early_cells) {
  1070. log_info(LD_REND, "Re-extending circ %u, this time to %s.",
  1071. (unsigned int) TO_CIRCUIT(circ)->n_circ_id,
  1072. safe_str_client(extend_info_describe(ei)));
  1073. ret = circuit_extend_to_new_exit(circ, ei);
  1074. if (ret == 0) {
  1075. /* We were able to extend so update the timestamp so we avoid expiring
  1076. * this circuit too early. The intro circuit is short live so the
  1077. * linkability issue is minimized, we just need the circuit to hold a
  1078. * bit longer so we can introduce. */
  1079. TO_CIRCUIT(circ)->timestamp_dirty = time(NULL);
  1080. }
  1081. } else {
  1082. log_info(LD_REND, "Closing intro circ %u (out of RELAY_EARLY cells).",
  1083. (unsigned int) TO_CIRCUIT(circ)->n_circ_id);
  1084. circuit_mark_for_close(TO_CIRCUIT(circ), END_CIRC_REASON_FINISHED);
  1085. /* connection_ap_handshake_attach_circuit will launch a new intro circ. */
  1086. ret = 0;
  1087. }
  1088. end:
  1089. extend_info_free(ei);
  1090. return ret;
  1091. }