hs_client.c 54 KB

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