hs_service.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819
  1. /* Copyright (c) 2016-2017, The Tor Project, Inc. */
  2. /* See LICENSE for licensing information */
  3. /**
  4. * \file hs_service.c
  5. * \brief Implement next generation hidden service functionality
  6. **/
  7. #define HS_SERVICE_PRIVATE
  8. #include "or.h"
  9. #include "circuitlist.h"
  10. #include "config.h"
  11. #include "relay.h"
  12. #include "rendservice.h"
  13. #include "router.h"
  14. #include "routerkeys.h"
  15. #include "hs_common.h"
  16. #include "hs_config.h"
  17. #include "hs_intropoint.h"
  18. #include "hs_service.h"
  19. #include "hs/cell_establish_intro.h"
  20. #include "hs/cell_common.h"
  21. /* Onion service directory file names. */
  22. static const char *fname_keyfile_prefix = "hs_ed25519";
  23. static const char *fname_hostname = "hostname";
  24. static const char *address_tld = "onion";
  25. /* Staging list of service object. When configuring service, we add them to
  26. * this list considered a staging area and they will get added to our global
  27. * map once the keys have been loaded. These two steps are seperated because
  28. * loading keys requires that we are an actual running tor process. */
  29. static smartlist_t *hs_service_staging_list;
  30. /* Helper: Function to compare two objects in the service map. Return 1 if the
  31. * two service have the same master public identity key. */
  32. static inline int
  33. hs_service_ht_eq(const hs_service_t *first, const hs_service_t *second)
  34. {
  35. tor_assert(first);
  36. tor_assert(second);
  37. /* Simple key compare. */
  38. return ed25519_pubkey_eq(&first->keys.identity_pk,
  39. &second->keys.identity_pk);
  40. }
  41. /* Helper: Function for the service hash table code below. The key used is the
  42. * master public identity key which is ultimately the onion address. */
  43. static inline unsigned int
  44. hs_service_ht_hash(const hs_service_t *service)
  45. {
  46. tor_assert(service);
  47. return (unsigned int) siphash24g(service->keys.identity_pk.pubkey,
  48. sizeof(service->keys.identity_pk.pubkey));
  49. }
  50. /* This is _the_ global hash map of hidden services which indexed the service
  51. * contained in it by master public identity key which is roughly the onion
  52. * address of the service. */
  53. static struct hs_service_ht *hs_service_map;
  54. /* Register the service hash table. */
  55. HT_PROTOTYPE(hs_service_ht, /* Name of hashtable. */
  56. hs_service_t, /* Object contained in the map. */
  57. hs_service_node, /* The name of the HT_ENTRY member. */
  58. hs_service_ht_hash, /* Hashing function. */
  59. hs_service_ht_eq) /* Compare function for objects. */
  60. HT_GENERATE2(hs_service_ht, hs_service_t, hs_service_node,
  61. hs_service_ht_hash, hs_service_ht_eq,
  62. 0.6, tor_reallocarray, tor_free_)
  63. /* Query the given service map with a public key and return a service object
  64. * if found else NULL. It is also possible to set a directory path in the
  65. * search query. If pk is NULL, then it will be set to zero indicating the
  66. * hash table to compare the directory path instead. */
  67. STATIC hs_service_t *
  68. find_service(hs_service_ht *map, const ed25519_public_key_t *pk)
  69. {
  70. hs_service_t dummy_service = {0};
  71. tor_assert(map);
  72. tor_assert(pk);
  73. ed25519_pubkey_copy(&dummy_service.keys.identity_pk, pk);
  74. return HT_FIND(hs_service_ht, map, &dummy_service);
  75. }
  76. /* Register the given service in the given map. If the service already exists
  77. * in the map, -1 is returned. On success, 0 is returned and the service
  78. * ownership has been transfered to the global map. */
  79. STATIC int
  80. register_service(hs_service_ht *map, hs_service_t *service)
  81. {
  82. tor_assert(map);
  83. tor_assert(service);
  84. tor_assert(!ed25519_public_key_is_zero(&service->keys.identity_pk));
  85. if (find_service(map, &service->keys.identity_pk)) {
  86. /* Existing service with the same key. Do not register it. */
  87. return -1;
  88. }
  89. /* Taking ownership of the object at this point. */
  90. HT_INSERT(hs_service_ht, map, service);
  91. return 0;
  92. }
  93. /* Remove a given service from the given map. If service is NULL or the
  94. * service key is unset, return gracefully. */
  95. STATIC void
  96. remove_service(hs_service_ht *map, hs_service_t *service)
  97. {
  98. hs_service_t *elm;
  99. tor_assert(map);
  100. /* Ignore if no service or key is zero. */
  101. if (BUG(service == NULL) ||
  102. BUG(ed25519_public_key_is_zero(&service->keys.identity_pk))) {
  103. return;
  104. }
  105. elm = HT_REMOVE(hs_service_ht, map, service);
  106. if (elm) {
  107. tor_assert(elm == service);
  108. } else {
  109. log_warn(LD_BUG, "Could not find service in the global map "
  110. "while removing service %s",
  111. escaped(service->config.directory_path));
  112. }
  113. }
  114. /* Set the default values for a service configuration object <b>c</b>. */
  115. static void
  116. set_service_default_config(hs_service_config_t *c,
  117. const or_options_t *options)
  118. {
  119. tor_assert(c);
  120. c->ports = smartlist_new();
  121. c->directory_path = NULL;
  122. c->descriptor_post_period = options->RendPostPeriod;
  123. c->max_streams_per_rdv_circuit = 0;
  124. c->max_streams_close_circuit = 0;
  125. c->num_intro_points = NUM_INTRO_POINTS_DEFAULT;
  126. c->allow_unknown_ports = 0;
  127. c->is_single_onion = 0;
  128. c->dir_group_readable = 0;
  129. c->is_ephemeral = 0;
  130. }
  131. /* Helper: Function that needs to return 1 for the HT for each loop which
  132. * frees every service in an hash map. */
  133. static int
  134. ht_free_service_(struct hs_service_t *service, void *data)
  135. {
  136. (void) data;
  137. hs_service_free(service);
  138. /* This function MUST return 1 so the given object is then removed from the
  139. * service map leading to this free of the object being safe. */
  140. return 1;
  141. }
  142. /* Free every service that can be found in the global map. Once done, clear
  143. * and free the global map. */
  144. static void
  145. service_free_all(void)
  146. {
  147. if (hs_service_map) {
  148. /* The free helper function returns 1 so this is safe. */
  149. hs_service_ht_HT_FOREACH_FN(hs_service_map, ht_free_service_, NULL);
  150. HT_CLEAR(hs_service_ht, hs_service_map);
  151. tor_free(hs_service_map);
  152. hs_service_map = NULL;
  153. }
  154. if (hs_service_staging_list) {
  155. /* Cleanup staging list. */
  156. SMARTLIST_FOREACH(hs_service_staging_list, hs_service_t *, s,
  157. hs_service_free(s));
  158. smartlist_free(hs_service_staging_list);
  159. hs_service_staging_list = NULL;
  160. }
  161. }
  162. /* Close all rendezvous circuits for the given service. */
  163. static void
  164. close_service_rp_circuits(hs_service_t *service)
  165. {
  166. tor_assert(service);
  167. /* XXX: To implement. */
  168. return;
  169. }
  170. /* Close the circuit(s) for the given map of introduction points. */
  171. static void
  172. close_intro_circuits(hs_service_intropoints_t *intro_points)
  173. {
  174. tor_assert(intro_points);
  175. DIGEST256MAP_FOREACH(intro_points->map, key,
  176. const hs_service_intro_point_t *, ip) {
  177. origin_circuit_t *ocirc =
  178. hs_circuitmap_get_intro_circ_v3_service_side(
  179. &ip->auth_key_kp.pubkey);
  180. if (ocirc) {
  181. hs_circuitmap_remove_circuit(TO_CIRCUIT(ocirc));
  182. /* Reason is FINISHED because service has been removed and thus the
  183. * circuit is considered old/uneeded. */
  184. circuit_mark_for_close(TO_CIRCUIT(ocirc), END_CIRC_REASON_FINISHED);
  185. }
  186. } DIGEST256MAP_FOREACH_END;
  187. }
  188. /* Close all introduction circuits for the given service. */
  189. static void
  190. close_service_intro_circuits(hs_service_t *service)
  191. {
  192. tor_assert(service);
  193. if (service->desc_current) {
  194. close_intro_circuits(&service->desc_current->intro_points);
  195. }
  196. if (service->desc_next) {
  197. close_intro_circuits(&service->desc_next->intro_points);
  198. }
  199. }
  200. /* Close any circuits related to the given service. */
  201. static void
  202. close_service_circuits(hs_service_t *service)
  203. {
  204. tor_assert(service);
  205. /* Only support for version >= 3. */
  206. if (BUG(service->version < HS_VERSION_THREE)) {
  207. return;
  208. }
  209. /* Close intro points. */
  210. close_service_intro_circuits(service);
  211. /* Close rendezvous points. */
  212. close_service_rp_circuits(service);
  213. }
  214. /* Move introduction points from the src descriptor to the dst descriptor. The
  215. * destination service intropoints are wiped out if any before moving. */
  216. static void
  217. move_descriptor_intro_points(hs_service_descriptor_t *src,
  218. hs_service_descriptor_t *dst)
  219. {
  220. tor_assert(src);
  221. tor_assert(dst);
  222. /* XXX: Free dst introduction points. */
  223. dst->intro_points.map = src->intro_points.map;
  224. /* Nullify the source. */
  225. src->intro_points.map = NULL;
  226. }
  227. /* Move introduction points from the src service to the dst service. The
  228. * destination service intropoints are wiped out if any before moving. */
  229. static void
  230. move_intro_points(hs_service_t *src, hs_service_t *dst)
  231. {
  232. tor_assert(src);
  233. tor_assert(dst);
  234. /* Cleanup destination. */
  235. if (src->desc_current && dst->desc_current) {
  236. move_descriptor_intro_points(src->desc_current, dst->desc_current);
  237. }
  238. if (src->desc_next && dst->desc_next) {
  239. move_descriptor_intro_points(src->desc_next, dst->desc_next);
  240. }
  241. }
  242. /* Move every ephemeral services from the src service map to the dst service
  243. * map. It is possible that a service can't be register to the dst map which
  244. * won't stop the process of moving them all but will trigger a log warn. */
  245. static void
  246. move_ephemeral_services(hs_service_ht *src, hs_service_ht *dst)
  247. {
  248. hs_service_t **iter, **next;
  249. tor_assert(src);
  250. tor_assert(dst);
  251. /* Iterate over the map to find ephemeral service and move them to the other
  252. * map. We loop using this method to have a safe removal process. */
  253. for (iter = HT_START(hs_service_ht, src); iter != NULL; iter = next) {
  254. hs_service_t *s = *iter;
  255. if (!s->config.is_ephemeral) {
  256. /* Yeah, we are in a very manual loop :). */
  257. next = HT_NEXT(hs_service_ht, src, iter);
  258. continue;
  259. }
  260. /* Remove service from map and then register to it to the other map.
  261. * Reminder that "*iter" and "s" are the same thing. */
  262. next = HT_NEXT_RMV(hs_service_ht, src, iter);
  263. if (register_service(dst, s) < 0) {
  264. log_warn(LD_BUG, "Ephemeral service key is already being used. "
  265. "Skipping.");
  266. }
  267. }
  268. }
  269. /* Return a const string of the directory path escaped. If this is an
  270. * ephemeral service, it returns "[EPHEMERAL]". This can only be called from
  271. * the main thread because escaped() uses a static variable. */
  272. static const char *
  273. service_escaped_dir(const hs_service_t *s)
  274. {
  275. return (s->config.is_ephemeral) ? "[EPHEMERAL]" :
  276. escaped(s->config.directory_path);
  277. }
  278. /* Register services that are in the staging list. Once this function returns,
  279. * the global service map will be set with the right content and all non
  280. * surviving services will be cleaned up. */
  281. static void
  282. register_all_services(void)
  283. {
  284. struct hs_service_ht *new_service_map;
  285. hs_service_t *s, **iter;
  286. tor_assert(hs_service_staging_list);
  287. /* We'll save us some allocation and computing time. */
  288. if (smartlist_len(hs_service_staging_list) == 0) {
  289. return;
  290. }
  291. /* Allocate a new map that will replace the current one. */
  292. new_service_map = tor_malloc_zero(sizeof(*new_service_map));
  293. HT_INIT(hs_service_ht, new_service_map);
  294. /* First step is to transfer all ephemeral services from the current global
  295. * map to the new one we are constructing. We do not prune ephemeral
  296. * services as the only way to kill them is by deleting it from the control
  297. * port or stopping the tor daemon. */
  298. move_ephemeral_services(hs_service_map, new_service_map);
  299. SMARTLIST_FOREACH_BEGIN(hs_service_staging_list, hs_service_t *, snew) {
  300. /* Check if that service is already in our global map and if so, we'll
  301. * transfer the intro points to it. */
  302. s = find_service(hs_service_map, &snew->keys.identity_pk);
  303. if (s) {
  304. /* Pass ownership of intro points from s (the current service) to snew
  305. * (the newly configured one). */
  306. move_intro_points(s, snew);
  307. /* Remove the service from the global map because after this, we need to
  308. * go over the remaining service in that map that aren't surviving the
  309. * reload to close their circuits. */
  310. remove_service(hs_service_map, s);
  311. }
  312. /* Great, this service is now ready to be added to our new map. */
  313. if (BUG(register_service(new_service_map, snew) < 0)) {
  314. /* This should never happen because prior to registration, we validate
  315. * every service against the entire set. Not being able to register a
  316. * service means we failed to validate correctly. In that case, don't
  317. * break tor and ignore the service but tell user. */
  318. log_warn(LD_BUG, "Unable to register service with directory %s",
  319. service_escaped_dir(snew));
  320. SMARTLIST_DEL_CURRENT(hs_service_staging_list, snew);
  321. hs_service_free(snew);
  322. }
  323. } SMARTLIST_FOREACH_END(snew);
  324. /* Close any circuits associated with the non surviving services. Every
  325. * service in the current global map are roaming. */
  326. HT_FOREACH(iter, hs_service_ht, hs_service_map) {
  327. close_service_circuits(*iter);
  328. }
  329. /* Time to make the switch. We'll clear the staging list because its content
  330. * has now changed ownership to the map. */
  331. smartlist_clear(hs_service_staging_list);
  332. service_free_all();
  333. hs_service_map = new_service_map;
  334. }
  335. /* Write the onion address of a given service to the given filename fname_ in
  336. * the service directory. Return 0 on success else -1 on error. */
  337. static int
  338. write_address_to_file(const hs_service_t *service, const char *fname_)
  339. {
  340. int ret = -1;
  341. char *fname = NULL;
  342. /* Length of an address plus the sizeof the address tld (onion) which counts
  343. * the NUL terminated byte so we keep it for the "." and the newline. */
  344. char buf[HS_SERVICE_ADDR_LEN_BASE32 + sizeof(address_tld) + 1];
  345. tor_assert(service);
  346. tor_assert(fname_);
  347. /* Construct the full address with the onion tld and write the hostname file
  348. * to disk. */
  349. tor_snprintf(buf, sizeof(buf), "%s.%s\n", service->onion_address,
  350. address_tld);
  351. /* Notice here that we use the given "fname_". */
  352. fname = hs_path_from_filename(service->config.directory_path, fname_);
  353. if (write_str_to_file(fname, buf, 0) < 0) {
  354. log_warn(LD_REND, "Could not write onion address to hostname file %s",
  355. escaped(fname));
  356. goto end;
  357. }
  358. #ifndef _WIN32
  359. if (service->config.dir_group_readable) {
  360. /* Mode to 0640. */
  361. if (chmod(fname, S_IRUSR | S_IWUSR | S_IRGRP) < 0) {
  362. log_warn(LD_FS, "Unable to make onion service hostname file %s "
  363. "group-readable.", escaped(fname));
  364. }
  365. }
  366. #endif /* _WIN32 */
  367. /* Success. */
  368. ret = 0;
  369. end:
  370. tor_free(fname);
  371. return ret;
  372. }
  373. /* Load and/or generate private keys for the given service. On success, the
  374. * hostname file will be written to disk along with the master private key iff
  375. * the service is not configured for offline keys. Return 0 on success else -1
  376. * on failure. */
  377. static int
  378. load_service_keys(hs_service_t *service)
  379. {
  380. int ret = -1;
  381. char *fname = NULL;
  382. ed25519_keypair_t *kp;
  383. const hs_service_config_t *config;
  384. tor_assert(service);
  385. config = &service->config;
  386. /* Create and fix permission on service directory. We are about to write
  387. * files to that directory so make sure it exists and has the right
  388. * permissions. We do this here because at this stage we know that Tor is
  389. * actually running and the service we have has been validated. */
  390. if (BUG(hs_check_service_private_dir(get_options()->User,
  391. config->directory_path,
  392. config->dir_group_readable, 1) < 0)) {
  393. goto end;
  394. }
  395. /* Try to load the keys from file or generate it if not found. */
  396. fname = hs_path_from_filename(config->directory_path, fname_keyfile_prefix);
  397. /* Don't ask for key creation, we want to know if we were able to load it or
  398. * we had to generate it. Better logging! */
  399. kp = ed_key_init_from_file(fname, 0, LOG_INFO, NULL, 0, 0, 0, NULL);
  400. if (!kp) {
  401. log_info(LD_REND, "Unable to load keys from %s. Generating it...", fname);
  402. /* We'll now try to generate the keys and for it we want the strongest
  403. * randomness for it. The keypair will be written in different files. */
  404. uint32_t key_flags = INIT_ED_KEY_CREATE | INIT_ED_KEY_EXTRA_STRONG |
  405. INIT_ED_KEY_SPLIT;
  406. kp = ed_key_init_from_file(fname, key_flags, LOG_WARN, NULL, 0, 0, 0,
  407. NULL);
  408. if (!kp) {
  409. log_warn(LD_REND, "Unable to generate keys and save in %s.", fname);
  410. goto end;
  411. }
  412. }
  413. /* Copy loaded or generated keys to service object. */
  414. ed25519_pubkey_copy(&service->keys.identity_pk, &kp->pubkey);
  415. memcpy(&service->keys.identity_sk, &kp->seckey,
  416. sizeof(service->keys.identity_sk));
  417. /* This does a proper memory wipe. */
  418. ed25519_keypair_free(kp);
  419. /* Build onion address from the newly loaded keys. */
  420. tor_assert(service->version <= UINT8_MAX);
  421. hs_build_address(&service->keys.identity_pk, (uint8_t) service->version,
  422. service->onion_address);
  423. /* Write onion address to hostname file. */
  424. if (write_address_to_file(service, fname_hostname) < 0) {
  425. goto end;
  426. }
  427. /* Succes. */
  428. ret = 0;
  429. end:
  430. tor_free(fname);
  431. return ret;
  432. }
  433. /* Load and/or generate keys for all onion services including the client
  434. * authorization if any. Return 0 on success, -1 on failure. */
  435. int
  436. hs_service_load_all_keys(void)
  437. {
  438. /* Load v2 service keys if we have v2. */
  439. if (num_rend_services() != 0) {
  440. if (rend_service_load_all_keys(NULL) < 0) {
  441. goto err;
  442. }
  443. }
  444. /* Load or/and generate them for v3+. */
  445. SMARTLIST_FOREACH_BEGIN(hs_service_staging_list, hs_service_t *, service) {
  446. /* Ignore ephemeral service, they already have their keys set. */
  447. if (service->config.is_ephemeral) {
  448. continue;
  449. }
  450. log_info(LD_REND, "Loading v3 onion service keys from %s",
  451. service_escaped_dir(service));
  452. if (load_service_keys(service) < 0) {
  453. goto err;
  454. }
  455. /* XXX: Load/Generate client authorization keys. (#20700) */
  456. } SMARTLIST_FOREACH_END(service);
  457. /* Final step, the staging list contains service in a quiescent state that
  458. * is ready to be used. Register them to the global map. Once this is over,
  459. * the staging list will be cleaned up. */
  460. register_all_services();
  461. /* All keys have been loaded successfully. */
  462. return 0;
  463. err:
  464. return -1;
  465. }
  466. /* Put all service object in the given service list. After this, the caller
  467. * looses ownership of every elements in the list and responsible to free the
  468. * list pointer. */
  469. void
  470. hs_service_stage_services(const smartlist_t *service_list)
  471. {
  472. tor_assert(service_list);
  473. /* This list is freed at registration time but this function can be called
  474. * multiple time. */
  475. if (hs_service_staging_list == NULL) {
  476. hs_service_staging_list = smartlist_new();
  477. }
  478. /* Add all service object to our staging list. Caller is responsible for
  479. * freeing the service_list. */
  480. smartlist_add_all(hs_service_staging_list, service_list);
  481. }
  482. /* Allocate and initilize a service object. The service configuration will
  483. * contain the default values. Return the newly allocated object pointer. This
  484. * function can't fail. */
  485. hs_service_t *
  486. hs_service_new(const or_options_t *options)
  487. {
  488. hs_service_t *service = tor_malloc_zero(sizeof(hs_service_t));
  489. /* Set default configuration value. */
  490. set_service_default_config(&service->config, options);
  491. /* Set the default service version. */
  492. service->version = HS_SERVICE_DEFAULT_VERSION;
  493. return service;
  494. }
  495. /* Free the given <b>service</b> object and all its content. This function
  496. * also takes care of wiping service keys from memory. It is safe to pass a
  497. * NULL pointer. */
  498. void
  499. hs_service_free(hs_service_t *service)
  500. {
  501. if (service == NULL) {
  502. return;
  503. }
  504. /* Free descriptors. */
  505. if (service->desc_current) {
  506. hs_descriptor_free(service->desc_current->desc);
  507. /* Wipe keys. */
  508. memwipe(&service->desc_current->signing_kp, 0,
  509. sizeof(service->desc_current->signing_kp));
  510. memwipe(&service->desc_current->blinded_kp, 0,
  511. sizeof(service->desc_current->blinded_kp));
  512. /* XXX: Free intro points. */
  513. tor_free(service->desc_current);
  514. }
  515. if (service->desc_next) {
  516. hs_descriptor_free(service->desc_next->desc);
  517. /* Wipe keys. */
  518. memwipe(&service->desc_next->signing_kp, 0,
  519. sizeof(service->desc_next->signing_kp));
  520. memwipe(&service->desc_next->blinded_kp, 0,
  521. sizeof(service->desc_next->blinded_kp));
  522. /* XXX: Free intro points. */
  523. tor_free(service->desc_next);
  524. }
  525. /* Free service configuration. */
  526. tor_free(service->config.directory_path);
  527. if (service->config.ports) {
  528. SMARTLIST_FOREACH(service->config.ports, rend_service_port_config_t *, p,
  529. rend_service_port_config_free(p););
  530. smartlist_free(service->config.ports);
  531. }
  532. /* Wipe service keys. */
  533. memwipe(&service->keys.identity_sk, 0, sizeof(service->keys.identity_sk));
  534. tor_free(service);
  535. }
  536. /* Initialize the service HS subsystem. */
  537. void
  538. hs_service_init(void)
  539. {
  540. /* Should never be called twice. */
  541. tor_assert(!hs_service_map);
  542. tor_assert(!hs_service_staging_list);
  543. /* v2 specific. */
  544. rend_service_init();
  545. hs_service_map = tor_malloc_zero(sizeof(struct hs_service_ht));
  546. HT_INIT(hs_service_ht, hs_service_map);
  547. hs_service_staging_list = smartlist_new();
  548. }
  549. /* Release all global storage of the hidden service subsystem. */
  550. void
  551. hs_service_free_all(void)
  552. {
  553. rend_service_free_all();
  554. service_free_all();
  555. }
  556. /* XXX We don't currently use these functions, apart from generating unittest
  557. data. When we start implementing the service-side support for prop224 we
  558. should revisit these functions and use them. */
  559. /** Given an ESTABLISH_INTRO <b>cell</b>, encode it and place its payload in
  560. * <b>buf_out</b> which has size <b>buf_out_len</b>. Return the number of
  561. * bytes written, or a negative integer if there was an error. */
  562. ssize_t
  563. get_establish_intro_payload(uint8_t *buf_out, size_t buf_out_len,
  564. const trn_cell_establish_intro_t *cell)
  565. {
  566. ssize_t bytes_used = 0;
  567. if (buf_out_len < RELAY_PAYLOAD_SIZE) {
  568. return -1;
  569. }
  570. bytes_used = trn_cell_establish_intro_encode(buf_out, buf_out_len,
  571. cell);
  572. return bytes_used;
  573. }
  574. /* Set the cell extensions of <b>cell</b>. */
  575. static void
  576. set_trn_cell_extensions(trn_cell_establish_intro_t *cell)
  577. {
  578. trn_cell_extension_t *trn_cell_extensions = trn_cell_extension_new();
  579. /* For now, we don't use extensions at all. */
  580. trn_cell_extensions->num = 0; /* It's already zeroed, but be explicit. */
  581. trn_cell_establish_intro_set_extensions(cell, trn_cell_extensions);
  582. }
  583. /** Given the circuit handshake info in <b>circuit_key_material</b>, create and
  584. * return an ESTABLISH_INTRO cell. Return NULL if something went wrong. The
  585. * returned cell is allocated on the heap and it's the responsibility of the
  586. * caller to free it. */
  587. trn_cell_establish_intro_t *
  588. generate_establish_intro_cell(const uint8_t *circuit_key_material,
  589. size_t circuit_key_material_len)
  590. {
  591. trn_cell_establish_intro_t *cell = NULL;
  592. ssize_t encoded_len;
  593. log_warn(LD_GENERAL,
  594. "Generating ESTABLISH_INTRO cell (key_material_len: %u)",
  595. (unsigned) circuit_key_material_len);
  596. /* Generate short-term keypair for use in ESTABLISH_INTRO */
  597. ed25519_keypair_t key_struct;
  598. if (ed25519_keypair_generate(&key_struct, 0) < 0) {
  599. goto err;
  600. }
  601. cell = trn_cell_establish_intro_new();
  602. /* Set AUTH_KEY_TYPE: 2 means ed25519 */
  603. trn_cell_establish_intro_set_auth_key_type(cell,
  604. HS_INTRO_AUTH_KEY_TYPE_ED25519);
  605. /* Set AUTH_KEY_LEN field */
  606. /* Must also set byte-length of AUTH_KEY to match */
  607. int auth_key_len = ED25519_PUBKEY_LEN;
  608. trn_cell_establish_intro_set_auth_key_len(cell, auth_key_len);
  609. trn_cell_establish_intro_setlen_auth_key(cell, auth_key_len);
  610. /* Set AUTH_KEY field */
  611. uint8_t *auth_key_ptr = trn_cell_establish_intro_getarray_auth_key(cell);
  612. memcpy(auth_key_ptr, key_struct.pubkey.pubkey, auth_key_len);
  613. /* No cell extensions needed */
  614. set_trn_cell_extensions(cell);
  615. /* Set signature size.
  616. We need to do this up here, because _encode() needs it and we need to call
  617. _encode() to calculate the MAC and signature.
  618. */
  619. int sig_len = ED25519_SIG_LEN;
  620. trn_cell_establish_intro_set_sig_len(cell, sig_len);
  621. trn_cell_establish_intro_setlen_sig(cell, sig_len);
  622. /* XXX How to make this process easier and nicer? */
  623. /* Calculate the cell MAC (aka HANDSHAKE_AUTH). */
  624. {
  625. /* To calculate HANDSHAKE_AUTH, we dump the cell in bytes, and then derive
  626. the MAC from it. */
  627. uint8_t cell_bytes_tmp[RELAY_PAYLOAD_SIZE] = {0};
  628. uint8_t mac[TRUNNEL_SHA3_256_LEN];
  629. encoded_len = trn_cell_establish_intro_encode(cell_bytes_tmp,
  630. sizeof(cell_bytes_tmp),
  631. cell);
  632. if (encoded_len < 0) {
  633. log_warn(LD_OR, "Unable to pre-encode ESTABLISH_INTRO cell.");
  634. goto err;
  635. }
  636. /* sanity check */
  637. tor_assert(encoded_len > ED25519_SIG_LEN + 2 + TRUNNEL_SHA3_256_LEN);
  638. /* Calculate MAC of all fields before HANDSHAKE_AUTH */
  639. crypto_mac_sha3_256(mac, sizeof(mac),
  640. circuit_key_material, circuit_key_material_len,
  641. cell_bytes_tmp,
  642. encoded_len -
  643. (ED25519_SIG_LEN + 2 + TRUNNEL_SHA3_256_LEN));
  644. /* Write the MAC to the cell */
  645. uint8_t *handshake_ptr =
  646. trn_cell_establish_intro_getarray_handshake_mac(cell);
  647. memcpy(handshake_ptr, mac, sizeof(mac));
  648. }
  649. /* Calculate the cell signature */
  650. {
  651. /* To calculate the sig we follow the same procedure as above. We first
  652. dump the cell up to the sig, and then calculate the sig */
  653. uint8_t cell_bytes_tmp[RELAY_PAYLOAD_SIZE] = {0};
  654. ed25519_signature_t sig;
  655. encoded_len = trn_cell_establish_intro_encode(cell_bytes_tmp,
  656. sizeof(cell_bytes_tmp),
  657. cell);
  658. if (encoded_len < 0) {
  659. log_warn(LD_OR, "Unable to pre-encode ESTABLISH_INTRO cell (2).");
  660. goto err;
  661. }
  662. tor_assert(encoded_len > ED25519_SIG_LEN);
  663. if (ed25519_sign_prefixed(&sig,
  664. cell_bytes_tmp,
  665. encoded_len -
  666. (ED25519_SIG_LEN + sizeof(cell->sig_len)),
  667. ESTABLISH_INTRO_SIG_PREFIX,
  668. &key_struct)) {
  669. log_warn(LD_BUG, "Unable to gen signature for ESTABLISH_INTRO cell.");
  670. goto err;
  671. }
  672. /* And write the signature to the cell */
  673. uint8_t *sig_ptr = trn_cell_establish_intro_getarray_sig(cell);
  674. memcpy(sig_ptr, sig.sig, sig_len);
  675. }
  676. /* We are done! Return the cell! */
  677. return cell;
  678. err:
  679. trn_cell_establish_intro_free(cell);
  680. return NULL;
  681. }
  682. #ifdef TOR_UNIT_TESTS
  683. /* Return the global service map size. Only used by unit test. */
  684. STATIC unsigned int
  685. get_hs_service_map_size(void)
  686. {
  687. return HT_SIZE(hs_service_map);
  688. }
  689. /* Return the staging list size. Only used by unit test. */
  690. STATIC int
  691. get_hs_service_staging_list_size(void)
  692. {
  693. return smartlist_len(hs_service_staging_list);
  694. }
  695. STATIC hs_service_ht *
  696. get_hs_service_map(void)
  697. {
  698. return hs_service_map;
  699. }
  700. STATIC hs_service_t *
  701. get_first_service(void)
  702. {
  703. hs_service_t **obj = HT_START(hs_service_ht, hs_service_map);
  704. if (obj == NULL) {
  705. return NULL;
  706. }
  707. return *obj;
  708. }
  709. #endif /* TOR_UNIT_TESTS */