hs_service.c 27 KB

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