hs_client.c 68 KB

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