rendcommon.c 6.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247
  1. /* Copyright 2004 Roger Dingledine */
  2. /* See LICENSE for licensing information */
  3. /* $Id$ */
  4. #include "or.h"
  5. void rend_service_descriptor_free(rend_service_descriptor_t *desc)
  6. {
  7. int i;
  8. if (desc->pk)
  9. crypto_free_pk_env(desc->pk);
  10. if (desc->intro_points) {
  11. for (i=0; i < desc->n_intro_points; ++i) {
  12. tor_free(desc->intro_points[i]);
  13. }
  14. tor_free(desc->intro_points);
  15. }
  16. tor_free(desc);
  17. }
  18. int
  19. rend_encode_service_descriptor(rend_service_descriptor_t *desc,
  20. crypto_pk_env_t *key,
  21. char **str_out, int *len_out)
  22. {
  23. char *buf, *cp, *ipoint;
  24. int i, keylen, asn1len;
  25. char digest[CRYPTO_SHA1_DIGEST_LEN];
  26. keylen = crypto_pk_keysize(desc->pk);
  27. buf = tor_malloc(keylen*2); /* XXXX */
  28. asn1len = crypto_pk_asn1_encode(desc->pk, buf, keylen*2);
  29. if (asn1len<0) {
  30. tor_free(buf);
  31. return -1;
  32. }
  33. *len_out = 2 + asn1len + 4 + 2 + keylen;
  34. for (i = 0; i < desc->n_intro_points; ++i) {
  35. *len_out += strlen(desc->intro_points[i]) + 1;
  36. }
  37. cp = *str_out = tor_malloc(*len_out);
  38. set_uint16(cp, (uint16_t)asn1len);
  39. cp += 2;
  40. memcpy(cp, buf, asn1len);
  41. tor_free(buf);
  42. cp += asn1len;
  43. set_uint32(cp, (uint32_t)desc->timestamp);
  44. cp += 4;
  45. set_uint16(cp, (uint16_t)desc->n_intro_points);
  46. cp += 2;
  47. for (i=0; i < desc->n_intro_points; ++i) {
  48. ipoint = (char*)desc->intro_points[i];
  49. strcpy(cp, ipoint);
  50. cp += strlen(ipoint)+1;
  51. }
  52. i = crypto_SHA_digest(*str_out, cp-*str_out, digest);
  53. if (i<0) {
  54. tor_free(*str_out);
  55. return -1;
  56. }
  57. i = crypto_pk_private_sign(key, digest, CRYPTO_SHA1_DIGEST_LEN, cp);
  58. if (i<0) {
  59. tor_free(*str_out);
  60. return -1;
  61. }
  62. cp += i;
  63. assert(*len_out == (cp-*str_out));
  64. return 0;
  65. }
  66. rend_service_descriptor_t *rend_parse_service_descriptor(
  67. const char *str, int len)
  68. {
  69. rend_service_descriptor_t *result = NULL;
  70. int keylen, asn1len, i;
  71. const char *end, *cp, *eos;
  72. char *signed_data=NULL;
  73. char digest_expected[CRYPTO_SHA1_DIGEST_LEN];
  74. result = tor_malloc_zero(sizeof(rend_service_descriptor_t));
  75. cp = str;
  76. end = str+len;
  77. if (end-cp < 2) goto truncated;
  78. asn1len = get_uint16(cp);
  79. cp += 2;
  80. if (end-cp < asn1len) goto truncated;
  81. result->pk = crypto_pk_asn1_decode(cp, asn1len);
  82. if (!result->pk) goto truncated;
  83. cp += asn1len;
  84. if (end-cp < 4) goto truncated;
  85. result->timestamp = (time_t) get_uint32(cp);
  86. cp += 4;
  87. if (end-cp < 2) goto truncated;
  88. result->n_intro_points = get_uint16(cp);
  89. result->intro_points = tor_malloc_zero(sizeof(char*)*result->n_intro_points);
  90. cp += 2;
  91. for (i=0;i<result->n_intro_points;++i) {
  92. if (end-cp < 2) goto truncated;
  93. eos = (const char *)memchr(cp,'\0',end-cp);
  94. if (!eos) goto truncated;
  95. result->intro_points[i] = tor_strdup(cp);
  96. cp = eos+1;
  97. }
  98. keylen = crypto_pk_keysize(result->pk);
  99. if (end-cp != keylen) goto truncated;
  100. if (crypto_SHA_digest(str, cp-str, digest_expected)<0) {
  101. log_fn(LOG_WARN, "Error computing SHA1 digest.");
  102. goto error;
  103. }
  104. signed_data = tor_malloc(keylen+1);
  105. i = crypto_pk_public_checksig(result->pk, (char*)cp, end-cp, signed_data);
  106. if (i<0) {
  107. log_fn(LOG_WARN, "Invalid signature on service descriptor");
  108. goto error;
  109. }
  110. if (i != CRYPTO_SHA1_DIGEST_LEN ||
  111. memcmp(signed_data, digest_expected, CRYPTO_SHA1_DIGEST_LEN)) {
  112. log_fn(LOG_WARN, "Mismatched signature on service descriptor");
  113. goto error;
  114. }
  115. tor_free(signed_data);
  116. return result;
  117. truncated:
  118. log_fn(LOG_WARN, "Truncated service descriptor");
  119. error:
  120. tor_free(signed_data);
  121. rend_service_descriptor_free(result);
  122. return NULL;
  123. }
  124. int rend_get_service_id(crypto_pk_env_t *pk, char *out)
  125. {
  126. char buf[CRYPTO_SHA1_DIGEST_LEN];
  127. assert(pk);
  128. if (crypto_pk_get_digest(pk, buf) < 0)
  129. return -1;
  130. if (base32_encode(out, REND_SERVICE_ID_LEN+1, buf, 10) < 0)
  131. return -1;
  132. return 0;
  133. }
  134. /* ==== Hidden service descriptor cache. */
  135. #define HIDSERV_MAX_AGE 24*60*60
  136. #define HIDSERV_MAX_SKEW 60*60
  137. typedef struct hidserv_cache_entry_t {
  138. int len;
  139. char *desc;
  140. rend_service_descriptor_t *parsed;
  141. } hidserv_cache_entry_t;
  142. static strmap_t *hidserv_cache = NULL;
  143. void hidserv_cache_init(void)
  144. {
  145. hidserv_cache = strmap_new();
  146. }
  147. void hidserv_cache_clean(void)
  148. {
  149. strmap_iter_t *iter;
  150. const char *key;
  151. void *val;
  152. hidserv_cache_entry_t *ent;
  153. time_t cutoff;
  154. cutoff = time(NULL) - HIDSERV_MAX_AGE;
  155. for (iter = strmap_iter_init(hidserv_cache); !strmap_iter_done(iter); ) {
  156. strmap_iter_get(iter, &key, &val);
  157. ent = (hidserv_cache_entry_t*)val;
  158. if (ent->parsed->timestamp < cutoff) {
  159. iter = strmap_iter_next_rmv(hidserv_cache, iter);
  160. rend_service_descriptor_free(ent->parsed);
  161. tor_free(ent->desc);
  162. tor_free(ent);
  163. } else {
  164. iter = strmap_iter_next(hidserv_cache, iter);
  165. }
  166. }
  167. }
  168. int hidserv_lookup(char *query, const char **desc, int *desc_len)
  169. {
  170. hidserv_cache_entry_t *e;
  171. assert(hidserv_cache);
  172. if (strlen(query) != REND_SERVICE_ID_LEN)
  173. return -1; /* XXXX also check for bad chars. */
  174. e = (hidserv_cache_entry_t*) strmap_get_lc(hidserv_cache, query);
  175. if (!e)
  176. return 0;
  177. *desc = e->desc;
  178. *desc_len = e->len;
  179. return 1;
  180. }
  181. int hidserv_store(char *desc, int desc_len)
  182. {
  183. hidserv_cache_entry_t *e;
  184. rend_service_descriptor_t *parsed;
  185. char query[REND_SERVICE_ID_LEN+1];
  186. time_t now;
  187. assert(hidserv_cache);
  188. parsed = rend_parse_service_descriptor(desc,desc_len);
  189. if (!parsed) {
  190. log_fn(LOG_WARN,"Couldn't parse service descriptor");
  191. return -1;
  192. }
  193. if (rend_get_service_id(parsed->pk, query)<0) {
  194. log_fn(LOG_WARN,"Couldn't compute service ID");
  195. rend_service_descriptor_free(parsed);
  196. return -1;
  197. }
  198. now = time(NULL);
  199. if (parsed->timestamp < now-HIDSERV_MAX_AGE) {
  200. log_fn(LOG_WARN,"Service descriptor is too old");
  201. rend_service_descriptor_free(parsed);
  202. return -1;
  203. }
  204. if (parsed->timestamp > now+HIDSERV_MAX_SKEW) {
  205. log_fn(LOG_WARN,"Service descriptor is too far in the future");
  206. rend_service_descriptor_free(parsed);
  207. return -1;
  208. }
  209. e = (hidserv_cache_entry_t*) strmap_get_lc(hidserv_cache, query);
  210. if (e && e->parsed->timestamp > parsed->timestamp) {
  211. log_fn(LOG_WARN,"We already have a newer service descriptor with the same ID");
  212. rend_service_descriptor_free(parsed);
  213. return -1;
  214. }
  215. if (e && e->len == desc_len && !memcmp(desc,e->desc,desc_len)) {
  216. log_fn(LOG_WARN,"We already have this service descriptor");
  217. rend_service_descriptor_free(parsed);
  218. return -1;
  219. }
  220. if (!e) {
  221. e = tor_malloc_zero(sizeof(hidserv_cache_entry_t));
  222. strmap_set_lc(hidserv_cache, query, e);
  223. } else {
  224. rend_service_descriptor_free(e->parsed);
  225. tor_free(e->desc);
  226. }
  227. e->parsed = parsed;
  228. e->len = desc_len;
  229. e->desc = tor_strdup(desc);
  230. return 0;
  231. }