hs_common.h 5.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133
  1. /* Copyright (c) 2016-2017, The Tor Project, Inc. */
  2. /* See LICENSE for licensing information */
  3. /**
  4. * \file hs_common.h
  5. * \brief Header file containing common data for the whole HS subsytem.
  6. **/
  7. #ifndef TOR_HS_COMMON_H
  8. #define TOR_HS_COMMON_H
  9. #include "or.h"
  10. /* Trunnel */
  11. #include "ed25519_cert.h"
  12. /* Protocol version 2. Use this instead of hardcoding "2" in the code base,
  13. * this adds a clearer semantic to the value when used. */
  14. #define HS_VERSION_TWO 2
  15. /* Version 3 of the protocol (prop224). */
  16. #define HS_VERSION_THREE 3
  17. /* Earliest and latest version we support. */
  18. #define HS_VERSION_MIN HS_VERSION_TWO
  19. #define HS_VERSION_MAX HS_VERSION_THREE
  20. /** Try to maintain this many intro points per service by default. */
  21. #define NUM_INTRO_POINTS_DEFAULT 3
  22. /** Maximum number of intro points per generic and version 2 service. */
  23. #define NUM_INTRO_POINTS_MAX 10
  24. /** Number of extra intro points we launch if our set of intro nodes is empty.
  25. * See proposal 155, section 4. */
  26. #define NUM_INTRO_POINTS_EXTRA 2
  27. /** If we can't build our intro circuits, don't retry for this long. */
  28. #define INTRO_CIRC_RETRY_PERIOD (60*5)
  29. /** Don't try to build more than this many circuits before giving up for a
  30. * while.*/
  31. #define MAX_INTRO_CIRCS_PER_PERIOD 10
  32. /** How many times will a hidden service operator attempt to connect to a
  33. * requested rendezvous point before giving up? */
  34. #define MAX_REND_FAILURES 1
  35. /** How many seconds should we spend trying to connect to a requested
  36. * rendezvous point before giving up? */
  37. #define MAX_REND_TIMEOUT 30
  38. /* String prefix for the signature of ESTABLISH_INTRO */
  39. #define ESTABLISH_INTRO_SIG_PREFIX "Tor establish-intro cell v1"
  40. /* The default HS time period length */
  41. #define HS_TIME_PERIOD_LENGTH_DEFAULT 1440 /* 1440 minutes == one day */
  42. /* The minimum time period length as seen in prop224 section [TIME-PERIODS] */
  43. #define HS_TIME_PERIOD_LENGTH_MIN 30 /* minutes */
  44. /* The minimum time period length as seen in prop224 section [TIME-PERIODS] */
  45. #define HS_TIME_PERIOD_LENGTH_MAX (60 * 24 * 10) /* 10 days or 14400 minutes */
  46. /* The time period rotation offset as seen in prop224 section [TIME-PERIODS] */
  47. #define HS_TIME_PERIOD_ROTATION_OFFSET (12 * 60) /* minutes */
  48. /* Prefix of the onion address checksum. */
  49. #define HS_SERVICE_ADDR_CHECKSUM_PREFIX ".onion checksum"
  50. /* Length of the checksum prefix minus the NUL terminated byte. */
  51. #define HS_SERVICE_ADDR_CHECKSUM_PREFIX_LEN \
  52. (sizeof(HS_SERVICE_ADDR_CHECKSUM_PREFIX) - 1)
  53. /* Length of the resulting checksum of the address. The construction of this
  54. * checksum looks like:
  55. * CHECKSUM = ".onion checksum" || PUBKEY || VERSION
  56. * where VERSION is 1 byte. This is pre-hashing. */
  57. #define HS_SERVICE_ADDR_CHECKSUM_INPUT_LEN \
  58. (HS_SERVICE_ADDR_CHECKSUM_PREFIX_LEN + ED25519_PUBKEY_LEN + sizeof(uint8_t))
  59. /* The amount of bytes we use from the address checksum. */
  60. #define HS_SERVICE_ADDR_CHECKSUM_LEN_USED 2
  61. /* Length of the binary encoded service address which is of course before the
  62. * base32 encoding. Construction is:
  63. * PUBKEY || CHECKSUM || VERSION
  64. * with 1 byte VERSION and 2 bytes CHECKSUM. The following is 35 bytes. */
  65. #define HS_SERVICE_ADDR_LEN \
  66. (ED25519_PUBKEY_LEN + HS_SERVICE_ADDR_CHECKSUM_LEN_USED + sizeof(uint8_t))
  67. /* Length of 'y' portion of 'y.onion' URL. This is base32 encoded and the
  68. * length ends up to 56 bytes (not counting the terminated NUL byte.) */
  69. #define HS_SERVICE_ADDR_LEN_BASE32 \
  70. (CEIL_DIV(HS_SERVICE_ADDR_LEN * 8, 5))
  71. /* Type of authentication key used by an introduction point. */
  72. typedef enum {
  73. HS_AUTH_KEY_TYPE_LEGACY = 1,
  74. HS_AUTH_KEY_TYPE_ED25519 = 2,
  75. } hs_auth_key_type_t;
  76. void hs_init(void);
  77. void hs_free_all(void);
  78. int hs_check_service_private_dir(const char *username, const char *path,
  79. unsigned int dir_group_readable,
  80. unsigned int create);
  81. char *hs_path_from_filename(const char *directory, const char *filename);
  82. void hs_build_address(const ed25519_public_key_t *key, uint8_t version,
  83. char *addr_out);
  84. int hs_address_is_valid(const char *address);
  85. int hs_parse_address(const char *address, ed25519_public_key_t *key_out,
  86. uint8_t *checksum_out, uint8_t *version_out);
  87. void rend_data_free(rend_data_t *data);
  88. rend_data_t *rend_data_dup(const rend_data_t *data);
  89. rend_data_t *rend_data_client_create(const char *onion_address,
  90. const char *desc_id,
  91. const char *cookie,
  92. rend_auth_type_t auth_type);
  93. rend_data_t *rend_data_service_create(const char *onion_address,
  94. const char *pk_digest,
  95. const uint8_t *cookie,
  96. rend_auth_type_t auth_type);
  97. const char *rend_data_get_address(const rend_data_t *rend_data);
  98. const char *rend_data_get_desc_id(const rend_data_t *rend_data,
  99. uint8_t replica, size_t *len_out);
  100. const uint8_t *rend_data_get_pk_digest(const rend_data_t *rend_data,
  101. size_t *len_out);
  102. uint64_t hs_get_next_time_period_num(time_t now);
  103. link_specifier_t *hs_link_specifier_dup(const link_specifier_t *lspec);
  104. #ifdef HS_COMMON_PRIVATE
  105. #ifdef TOR_UNIT_TESTS
  106. STATIC uint64_t get_time_period_length(void);
  107. STATIC uint64_t get_time_period_num(time_t now);
  108. #endif /* TOR_UNIT_TESTS */
  109. #endif /* HS_COMMON_PRIVATE */
  110. #endif /* TOR_HS_COMMON_H */