2017-03-15 21:13:17 +01:00
|
|
|
/* Copyright (c) 2016-2017, The Tor Project, Inc. */
|
2016-05-31 20:51:30 +02:00
|
|
|
/* See LICENSE for licensing information */
|
|
|
|
|
|
|
|
/**
|
|
|
|
* \file hs_common.h
|
2016-03-29 21:08:04 +02:00
|
|
|
* \brief Header file containing common data for the whole HS subsytem.
|
2016-05-31 20:51:30 +02:00
|
|
|
**/
|
|
|
|
|
|
|
|
#ifndef TOR_HS_COMMON_H
|
|
|
|
#define TOR_HS_COMMON_H
|
|
|
|
|
|
|
|
#include "or.h"
|
|
|
|
|
2017-07-23 16:43:16 +02:00
|
|
|
/* Trunnel */
|
|
|
|
#include "ed25519_cert.h"
|
|
|
|
|
2016-05-31 20:51:30 +02:00
|
|
|
/* Protocol version 2. Use this instead of hardcoding "2" in the code base,
|
|
|
|
* this adds a clearer semantic to the value when used. */
|
|
|
|
#define HS_VERSION_TWO 2
|
2016-08-11 21:21:54 +02:00
|
|
|
/* Version 3 of the protocol (prop224). */
|
|
|
|
#define HS_VERSION_THREE 3
|
2017-01-16 19:19:44 +01:00
|
|
|
/* Earliest and latest version we support. */
|
|
|
|
#define HS_VERSION_MIN HS_VERSION_TWO
|
|
|
|
#define HS_VERSION_MAX HS_VERSION_THREE
|
2016-05-31 20:51:30 +02:00
|
|
|
|
2016-12-22 23:01:07 +01:00
|
|
|
/** Try to maintain this many intro points per service by default. */
|
|
|
|
#define NUM_INTRO_POINTS_DEFAULT 3
|
2017-01-13 22:00:07 +01:00
|
|
|
/** Maximum number of intro points per generic and version 2 service. */
|
2016-12-22 23:01:07 +01:00
|
|
|
#define NUM_INTRO_POINTS_MAX 10
|
|
|
|
/** Number of extra intro points we launch if our set of intro nodes is empty.
|
|
|
|
* See proposal 155, section 4. */
|
|
|
|
#define NUM_INTRO_POINTS_EXTRA 2
|
|
|
|
|
|
|
|
/** If we can't build our intro circuits, don't retry for this long. */
|
|
|
|
#define INTRO_CIRC_RETRY_PERIOD (60*5)
|
|
|
|
/** Don't try to build more than this many circuits before giving up for a
|
|
|
|
* while.*/
|
|
|
|
#define MAX_INTRO_CIRCS_PER_PERIOD 10
|
|
|
|
/** How many times will a hidden service operator attempt to connect to a
|
|
|
|
* requested rendezvous point before giving up? */
|
|
|
|
#define MAX_REND_FAILURES 1
|
|
|
|
/** How many seconds should we spend trying to connect to a requested
|
|
|
|
* rendezvous point before giving up? */
|
|
|
|
#define MAX_REND_TIMEOUT 30
|
|
|
|
|
2016-09-05 17:58:19 +02:00
|
|
|
/* String prefix for the signature of ESTABLISH_INTRO */
|
|
|
|
#define ESTABLISH_INTRO_SIG_PREFIX "Tor establish-intro cell v1"
|
|
|
|
|
2017-02-13 14:31:34 +01:00
|
|
|
/* The default HS time period length */
|
|
|
|
#define HS_TIME_PERIOD_LENGTH_DEFAULT 1440 /* 1440 minutes == one day */
|
|
|
|
/* The minimum time period length as seen in prop224 section [TIME-PERIODS] */
|
|
|
|
#define HS_TIME_PERIOD_LENGTH_MIN 30 /* minutes */
|
|
|
|
/* The minimum time period length as seen in prop224 section [TIME-PERIODS] */
|
|
|
|
#define HS_TIME_PERIOD_LENGTH_MAX (60 * 24 * 10) /* 10 days or 14400 minutes */
|
|
|
|
|
2017-01-30 23:33:18 +01:00
|
|
|
/* Prefix of the onion address checksum. */
|
|
|
|
#define HS_SERVICE_ADDR_CHECKSUM_PREFIX ".onion checksum"
|
|
|
|
/* Length of the checksum prefix minus the NUL terminated byte. */
|
|
|
|
#define HS_SERVICE_ADDR_CHECKSUM_PREFIX_LEN \
|
|
|
|
(sizeof(HS_SERVICE_ADDR_CHECKSUM_PREFIX) - 1)
|
|
|
|
/* Length of the resulting checksum of the address. The construction of this
|
|
|
|
* checksum looks like:
|
|
|
|
* CHECKSUM = ".onion checksum" || PUBKEY || VERSION
|
|
|
|
* where VERSION is 1 byte. This is pre-hashing. */
|
|
|
|
#define HS_SERVICE_ADDR_CHECKSUM_INPUT_LEN \
|
|
|
|
(HS_SERVICE_ADDR_CHECKSUM_PREFIX_LEN + ED25519_PUBKEY_LEN + sizeof(uint8_t))
|
|
|
|
/* The amount of bytes we use from the address checksum. */
|
|
|
|
#define HS_SERVICE_ADDR_CHECKSUM_LEN_USED 2
|
|
|
|
/* Length of the binary encoded service address which is of course before the
|
|
|
|
* base32 encoding. Construction is:
|
|
|
|
* PUBKEY || CHECKSUM || VERSION
|
|
|
|
* with 1 byte VERSION and 2 bytes CHECKSUM. The following is 35 bytes. */
|
|
|
|
#define HS_SERVICE_ADDR_LEN \
|
|
|
|
(ED25519_PUBKEY_LEN + HS_SERVICE_ADDR_CHECKSUM_LEN_USED + sizeof(uint8_t))
|
|
|
|
/* Length of 'y' portion of 'y.onion' URL. This is base32 encoded and the
|
|
|
|
* length ends up to 56 bytes (not counting the terminated NUL byte.) */
|
|
|
|
#define HS_SERVICE_ADDR_LEN_BASE32 \
|
|
|
|
(CEIL_DIV(HS_SERVICE_ADDR_LEN * 8, 5))
|
|
|
|
|
2017-02-06 18:26:36 +01:00
|
|
|
/* The default HS time period length */
|
|
|
|
#define HS_TIME_PERIOD_LENGTH_DEFAULT 1440 /* 1440 minutes == one day */
|
|
|
|
/* The minimum time period length as seen in prop224 section [TIME-PERIODS] */
|
|
|
|
#define HS_TIME_PERIOD_LENGTH_MIN 30 /* minutes */
|
|
|
|
/* The minimum time period length as seen in prop224 section [TIME-PERIODS] */
|
|
|
|
#define HS_TIME_PERIOD_LENGTH_MAX (60 * 24 * 10) /* 10 days or 14400 minutes */
|
|
|
|
/* The time period rotation offset as seen in prop224 section [TIME-PERIODS] */
|
|
|
|
#define HS_TIME_PERIOD_ROTATION_OFFSET (12 * 60) /* minutes */
|
|
|
|
|
|
|
|
/* Keyblinding parameter construction is as follow:
|
|
|
|
* "key-blind" || INT_8(period_num) || INT_8(start_period_sec) */
|
|
|
|
#define HS_KEYBLIND_NONCE_PREFIX "key-blind"
|
|
|
|
#define HS_KEYBLIND_NONCE_PREFIX_LEN (sizeof(HS_KEYBLIND_NONCE_PREFIX) - 1)
|
|
|
|
#define HS_KEYBLIND_NONCE_LEN \
|
|
|
|
(HS_KEYBLIND_NONCE_PREFIX_LEN + sizeof(uint64_t) + sizeof(uint64_t))
|
|
|
|
|
2017-05-11 16:16:28 +02:00
|
|
|
/* Credential and subcredential prefix value. */
|
|
|
|
#define HS_CREDENTIAL_PREFIX "credential"
|
|
|
|
#define HS_CREDENTIAL_PREFIX_LEN (sizeof(HS_CREDENTIAL_PREFIX) - 1)
|
|
|
|
#define HS_SUBCREDENTIAL_PREFIX "subcredential"
|
|
|
|
#define HS_SUBCREDENTIAL_PREFIX_LEN (sizeof(HS_SUBCREDENTIAL_PREFIX) - 1)
|
|
|
|
|
2017-04-18 21:06:44 +02:00
|
|
|
/* Node hidden service stored at index prefix value. */
|
|
|
|
#define HS_INDEX_PREFIX "store-at-idx"
|
|
|
|
#define HS_INDEX_PREFIX_LEN (sizeof(HS_INDEX_PREFIX) - 1)
|
|
|
|
|
|
|
|
/* Node hidden service directory index prefix value. */
|
|
|
|
#define HSDIR_INDEX_PREFIX "node-idx"
|
|
|
|
#define HSDIR_INDEX_PREFIX_LEN (sizeof(HSDIR_INDEX_PREFIX) - 1)
|
|
|
|
|
|
|
|
/* Prefix of the shared random value disaster mode. */
|
|
|
|
#define HS_SRV_DISASTER_PREFIX "shared-random-disaster"
|
|
|
|
#define HS_SRV_DISASTER_PREFIX_LEN (sizeof(HS_SRV_DISASTER_PREFIX) - 1)
|
|
|
|
|
2017-04-19 17:06:19 +02:00
|
|
|
/* Default value of number of hsdir replicas (hsdir_n_replicas). */
|
|
|
|
#define HS_DEFAULT_HSDIR_N_REPLICAS 2
|
|
|
|
/* Default value of hsdir spread store (hsdir_spread_store). */
|
|
|
|
#define HS_DEFAULT_HSDIR_SPREAD_STORE 3
|
|
|
|
/* Default value of hsdir spread fetch (hsdir_spread_fetch). */
|
|
|
|
#define HS_DEFAULT_HSDIR_SPREAD_FETCH 3
|
|
|
|
|
2017-05-12 17:39:46 +02:00
|
|
|
/* Type of authentication key used by an introduction point. */
|
|
|
|
typedef enum {
|
|
|
|
HS_AUTH_KEY_TYPE_LEGACY = 1,
|
|
|
|
HS_AUTH_KEY_TYPE_ED25519 = 2,
|
|
|
|
} hs_auth_key_type_t;
|
|
|
|
|
2017-03-08 23:31:36 +01:00
|
|
|
/* Represents the mapping from a virtual port of a rendezvous service to a
|
|
|
|
* real port on some IP. */
|
|
|
|
typedef struct rend_service_port_config_t {
|
|
|
|
/* The incoming HS virtual port we're mapping */
|
|
|
|
uint16_t virtual_port;
|
|
|
|
/* Is this an AF_UNIX port? */
|
|
|
|
unsigned int is_unix_addr:1;
|
|
|
|
/* The outgoing TCP port to use, if !is_unix_addr */
|
|
|
|
uint16_t real_port;
|
|
|
|
/* The outgoing IPv4 or IPv6 address to use, if !is_unix_addr */
|
|
|
|
tor_addr_t real_addr;
|
|
|
|
/* The socket path to connect to, if is_unix_addr */
|
|
|
|
char unix_addr[FLEXIBLE_ARRAY_MEMBER];
|
|
|
|
} rend_service_port_config_t;
|
|
|
|
|
2017-04-18 21:06:44 +02:00
|
|
|
/* Hidden service directory index used in a node_t which is set once we set
|
|
|
|
* the consensus. */
|
|
|
|
typedef struct hsdir_index_t {
|
2017-09-06 17:12:28 +02:00
|
|
|
/* HSDir index to use when fetching a descriptor. */
|
2017-09-06 16:25:21 +02:00
|
|
|
uint8_t fetch[DIGEST256_LEN];
|
|
|
|
|
2017-09-06 17:12:28 +02:00
|
|
|
/* HSDir index used by services to store their first and second
|
2017-09-08 12:05:22 +02:00
|
|
|
* descriptor. The first descriptor is chronologically older than the second
|
|
|
|
* one and uses older TP and SRV values. */
|
2017-09-06 16:25:21 +02:00
|
|
|
uint8_t store_first[DIGEST256_LEN];
|
|
|
|
uint8_t store_second[DIGEST256_LEN];
|
2017-04-18 21:06:44 +02:00
|
|
|
} hsdir_index_t;
|
|
|
|
|
2017-01-16 19:29:03 +01:00
|
|
|
void hs_init(void);
|
|
|
|
void hs_free_all(void);
|
|
|
|
|
2016-12-22 22:40:21 +01:00
|
|
|
int hs_check_service_private_dir(const char *username, const char *path,
|
|
|
|
unsigned int dir_group_readable,
|
|
|
|
unsigned int create);
|
2017-02-01 15:18:58 +01:00
|
|
|
char *hs_path_from_filename(const char *directory, const char *filename);
|
2017-01-30 23:33:18 +01:00
|
|
|
void hs_build_address(const ed25519_public_key_t *key, uint8_t version,
|
|
|
|
char *addr_out);
|
|
|
|
int hs_address_is_valid(const char *address);
|
|
|
|
int hs_parse_address(const char *address, ed25519_public_key_t *key_out,
|
2017-07-12 19:41:33 +02:00
|
|
|
uint8_t *checksum_out, uint8_t *version_out);
|
2016-12-22 22:40:21 +01:00
|
|
|
|
2017-02-06 18:26:36 +01:00
|
|
|
void hs_build_blinded_pubkey(const ed25519_public_key_t *pubkey,
|
|
|
|
const uint8_t *secret, size_t secret_len,
|
|
|
|
uint64_t time_period_num,
|
|
|
|
ed25519_public_key_t *pubkey_out);
|
|
|
|
void hs_build_blinded_keypair(const ed25519_keypair_t *kp,
|
|
|
|
const uint8_t *secret, size_t secret_len,
|
|
|
|
uint64_t time_period_num,
|
|
|
|
ed25519_keypair_t *kp_out);
|
2017-03-08 23:31:36 +01:00
|
|
|
int hs_service_requires_uptime_circ(const smartlist_t *ports);
|
2017-02-06 18:26:36 +01:00
|
|
|
|
2016-05-31 20:51:30 +02:00
|
|
|
void rend_data_free(rend_data_t *data);
|
|
|
|
rend_data_t *rend_data_dup(const rend_data_t *data);
|
|
|
|
rend_data_t *rend_data_client_create(const char *onion_address,
|
|
|
|
const char *desc_id,
|
|
|
|
const char *cookie,
|
|
|
|
rend_auth_type_t auth_type);
|
|
|
|
rend_data_t *rend_data_service_create(const char *onion_address,
|
|
|
|
const char *pk_digest,
|
|
|
|
const uint8_t *cookie,
|
|
|
|
rend_auth_type_t auth_type);
|
|
|
|
const char *rend_data_get_address(const rend_data_t *rend_data);
|
|
|
|
const char *rend_data_get_desc_id(const rend_data_t *rend_data,
|
|
|
|
uint8_t replica, size_t *len_out);
|
|
|
|
const uint8_t *rend_data_get_pk_digest(const rend_data_t *rend_data,
|
|
|
|
size_t *len_out);
|
|
|
|
|
2017-06-01 12:48:03 +02:00
|
|
|
routerstatus_t *pick_hsdir(const char *desc_id, const char *desc_id_base32);
|
|
|
|
|
2017-05-11 16:16:28 +02:00
|
|
|
void hs_get_subcredential(const ed25519_public_key_t *identity_pk,
|
|
|
|
const ed25519_public_key_t *blinded_pk,
|
|
|
|
uint8_t *subcred_out);
|
|
|
|
|
2017-09-05 21:52:05 +02:00
|
|
|
uint64_t hs_get_previous_time_period_num(time_t now);
|
2017-02-06 18:26:36 +01:00
|
|
|
uint64_t hs_get_time_period_num(time_t now);
|
2017-02-13 14:31:34 +01:00
|
|
|
uint64_t hs_get_next_time_period_num(time_t now);
|
2017-07-18 15:44:03 +02:00
|
|
|
time_t hs_get_start_time_of_next_time_period(time_t now);
|
2017-02-13 14:31:34 +01:00
|
|
|
|
2017-07-23 16:43:16 +02:00
|
|
|
link_specifier_t *hs_link_specifier_dup(const link_specifier_t *lspec);
|
|
|
|
|
2017-09-08 18:06:20 +02:00
|
|
|
MOCK_DECL(int, hs_in_period_between_tp_and_srv,
|
2017-05-05 20:55:26 +02:00
|
|
|
(const networkstatus_t *consensus, time_t now));
|
2017-02-13 14:32:13 +01:00
|
|
|
|
2017-08-04 11:21:14 +02:00
|
|
|
uint8_t *hs_get_current_srv(uint64_t time_period_num,
|
|
|
|
const networkstatus_t *ns);
|
|
|
|
uint8_t *hs_get_previous_srv(uint64_t time_period_num,
|
|
|
|
const networkstatus_t *ns);
|
2017-04-18 21:06:44 +02:00
|
|
|
|
|
|
|
void hs_build_hsdir_index(const ed25519_public_key_t *identity_pk,
|
|
|
|
const uint8_t *srv, uint64_t period_num,
|
|
|
|
uint8_t *hsdir_index_out);
|
|
|
|
void hs_build_hs_index(uint64_t replica,
|
|
|
|
const ed25519_public_key_t *blinded_pk,
|
|
|
|
uint64_t period_num, uint8_t *hs_index_out);
|
|
|
|
|
2017-04-19 17:06:19 +02:00
|
|
|
int32_t hs_get_hsdir_n_replicas(void);
|
|
|
|
int32_t hs_get_hsdir_spread_fetch(void);
|
|
|
|
int32_t hs_get_hsdir_spread_store(void);
|
|
|
|
|
2017-04-19 18:23:43 +02:00
|
|
|
void hs_get_responsible_hsdirs(const ed25519_public_key_t *blinded_pk,
|
2017-09-08 11:51:30 +02:00
|
|
|
uint64_t time_period_num,
|
|
|
|
int use_second_hsdir_index,
|
2017-09-06 17:12:28 +02:00
|
|
|
int for_fetching, smartlist_t *responsible_dirs);
|
2017-06-01 13:07:53 +02:00
|
|
|
routerstatus_t *hs_pick_hsdir(smartlist_t *responsible_dirs,
|
|
|
|
const char *req_key_str);
|
2017-04-19 18:23:43 +02:00
|
|
|
|
2017-06-01 12:56:43 +02:00
|
|
|
time_t hs_hsdir_requery_period(const or_options_t *options);
|
|
|
|
time_t hs_lookup_last_hid_serv_request(routerstatus_t *hs_dir,
|
|
|
|
const char *desc_id_base32,
|
|
|
|
time_t now, int set);
|
|
|
|
void hs_clean_last_hid_serv_requests(time_t now);
|
|
|
|
void hs_purge_hid_serv_from_last_hid_serv_requests(const char *desc_id);
|
|
|
|
void hs_purge_last_hid_serv_requests(void);
|
|
|
|
|
2017-05-10 21:04:40 +02:00
|
|
|
int hs_set_conn_addr_port(const smartlist_t *ports, edge_connection_t *conn);
|
|
|
|
|
2017-07-31 16:59:12 +02:00
|
|
|
void hs_inc_rdv_stream_counter(origin_circuit_t *circ);
|
|
|
|
void hs_dec_rdv_stream_counter(origin_circuit_t *circ);
|
|
|
|
|
2017-07-18 21:17:37 +02:00
|
|
|
extend_info_t *hs_get_extend_info_from_lspecs(const smartlist_t *lspecs,
|
|
|
|
const curve25519_public_key_t *onion_key,
|
|
|
|
int direct_conn);
|
|
|
|
|
2017-02-13 14:31:34 +01:00
|
|
|
#ifdef HS_COMMON_PRIVATE
|
|
|
|
|
2017-08-08 10:45:45 +02:00
|
|
|
STATIC void get_disaster_srv(uint64_t time_period_num, uint8_t *srv_out);
|
|
|
|
|
2017-06-01 12:48:03 +02:00
|
|
|
/** The period for which a hidden service directory cannot be queried for
|
|
|
|
* the same descriptor ID again. */
|
|
|
|
#define REND_HID_SERV_DIR_REQUERY_PERIOD (15 * 60)
|
|
|
|
/** Test networks generate a new consensus every 5 or 10 seconds.
|
|
|
|
* So allow them to requery HSDirs much faster. */
|
|
|
|
#define REND_HID_SERV_DIR_REQUERY_PERIOD_TESTING (5)
|
|
|
|
|
2017-02-13 14:31:34 +01:00
|
|
|
#ifdef TOR_UNIT_TESTS
|
|
|
|
|
2017-06-01 12:56:43 +02:00
|
|
|
STATIC strmap_t *get_last_hid_serv_requests(void);
|
2017-02-13 14:31:34 +01:00
|
|
|
STATIC uint64_t get_time_period_length(void);
|
|
|
|
|
2017-08-08 10:45:45 +02:00
|
|
|
STATIC uint8_t *get_first_cached_disaster_srv(void);
|
|
|
|
STATIC uint8_t *get_second_cached_disaster_srv(void);
|
|
|
|
|
2017-09-15 22:24:44 +02:00
|
|
|
#endif /* defined(TOR_UNIT_TESTS) */
|
2017-02-13 14:31:34 +01:00
|
|
|
|
2017-09-15 22:24:44 +02:00
|
|
|
#endif /* defined(HS_COMMON_PRIVATE) */
|
2017-02-13 14:31:34 +01:00
|
|
|
|
2017-09-15 22:24:44 +02:00
|
|
|
#endif /* !defined(TOR_HS_COMMON_H) */
|
2016-12-14 21:41:08 +01:00
|
|
|
|