rendcommon.c 8.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317
  1. /* Copyright 2004 Roger Dingledine */
  2. /* See LICENSE for licensing information */
  3. /* $Id$ */
  4. #include "or.h"
  5. /* Free the storage held by 'desc'.
  6. */
  7. void rend_service_descriptor_free(rend_service_descriptor_t *desc)
  8. {
  9. int i;
  10. if (desc->pk)
  11. crypto_free_pk_env(desc->pk);
  12. if (desc->intro_points) {
  13. for (i=0; i < desc->n_intro_points; ++i) {
  14. tor_free(desc->intro_points[i]);
  15. }
  16. tor_free(desc->intro_points);
  17. }
  18. tor_free(desc);
  19. }
  20. /* Encode a service descriptor for 'desc', and sign it with 'key'. Store
  21. * the descriptor in *str_out, and set *len_out to its length.
  22. */
  23. int
  24. rend_encode_service_descriptor(rend_service_descriptor_t *desc,
  25. crypto_pk_env_t *key,
  26. char **str_out, int *len_out)
  27. {
  28. char *buf, *cp, *ipoint;
  29. int i, keylen, asn1len;
  30. keylen = crypto_pk_keysize(desc->pk);
  31. buf = tor_malloc(keylen*2); /* XXXX */
  32. asn1len = crypto_pk_asn1_encode(desc->pk, buf, keylen*2);
  33. if (asn1len<0) {
  34. tor_free(buf);
  35. return -1;
  36. }
  37. *len_out = 2 + asn1len + 4 + 2 + keylen;
  38. for (i = 0; i < desc->n_intro_points; ++i) {
  39. *len_out += strlen(desc->intro_points[i]) + 1;
  40. }
  41. cp = *str_out = tor_malloc(*len_out);
  42. set_uint16(cp, htons((uint16_t)asn1len));
  43. cp += 2;
  44. memcpy(cp, buf, asn1len);
  45. tor_free(buf);
  46. cp += asn1len;
  47. set_uint32(cp, htonl((uint32_t)desc->timestamp));
  48. cp += 4;
  49. set_uint16(cp, htons((uint16_t)desc->n_intro_points));
  50. cp += 2;
  51. for (i=0; i < desc->n_intro_points; ++i) {
  52. ipoint = (char*)desc->intro_points[i];
  53. strcpy(cp, ipoint);
  54. cp += strlen(ipoint)+1;
  55. }
  56. i = crypto_pk_private_sign_digest(key, *str_out, cp-*str_out, cp);
  57. if (i<0) {
  58. tor_free(*str_out);
  59. return -1;
  60. }
  61. cp += i;
  62. assert(*len_out == (cp-*str_out));
  63. return 0;
  64. }
  65. /* malloc a service_descriptor_t and return it.
  66. * return NULL if invalid descriptor or error */
  67. rend_service_descriptor_t *rend_parse_service_descriptor(
  68. const char *str, int len)
  69. {
  70. rend_service_descriptor_t *result = NULL;
  71. int keylen, asn1len, i;
  72. const char *end, *cp, *eos;
  73. result = tor_malloc_zero(sizeof(rend_service_descriptor_t));
  74. cp = str;
  75. end = str+len;
  76. if (end-cp < 2) goto truncated;
  77. asn1len = ntohs(get_uint16(cp));
  78. cp += 2;
  79. if (end-cp < asn1len) goto truncated;
  80. result->pk = crypto_pk_asn1_decode(cp, asn1len);
  81. if (!result->pk) goto truncated;
  82. cp += asn1len;
  83. if (end-cp < 4) goto truncated;
  84. result->timestamp = (time_t) ntohl(get_uint32(cp));
  85. cp += 4;
  86. if (end-cp < 2) goto truncated;
  87. result->n_intro_points = ntohs(get_uint16(cp));
  88. result->intro_points = tor_malloc_zero(sizeof(char*)*result->n_intro_points);
  89. cp += 2;
  90. for (i=0;i<result->n_intro_points;++i) {
  91. if (end-cp < 2) goto truncated;
  92. eos = (const char *)memchr(cp,'\0',end-cp);
  93. if (!eos) goto truncated;
  94. result->intro_points[i] = tor_strdup(cp);
  95. cp = eos+1;
  96. }
  97. keylen = crypto_pk_keysize(result->pk);
  98. if (end-cp < keylen) goto truncated;
  99. if (end-cp > keylen) {
  100. log_fn(LOG_WARN, "Signature too long on service descriptor");
  101. goto error;
  102. }
  103. if (crypto_pk_public_checksig_digest(result->pk,
  104. (char*)str,cp-str, /* data */
  105. (char*)cp,end-cp /* signature*/
  106. )<0) {
  107. log_fn(LOG_WARN, "Bad signature on service descriptor");
  108. goto error;
  109. }
  110. return result;
  111. truncated:
  112. log_fn(LOG_WARN, "Truncated service descriptor");
  113. error:
  114. rend_service_descriptor_free(result);
  115. return NULL;
  116. }
  117. /* Sets out to the first 10 bytes of the digest of 'pk', base32 encoded.
  118. * NUL-terminates out.
  119. */
  120. int rend_get_service_id(crypto_pk_env_t *pk, char *out)
  121. {
  122. char buf[DIGEST_LEN];
  123. assert(pk);
  124. if (crypto_pk_get_digest(pk, buf) < 0)
  125. return -1;
  126. if (base32_encode(out, REND_SERVICE_ID_LEN+1, buf, 10) < 0)
  127. return -1;
  128. return 0;
  129. }
  130. /* ==== Rendezvous service descriptor cache. */
  131. #define REND_CACHE_MAX_AGE 24*60*60
  132. #define REND_CACHE_MAX_SKEW 60*60
  133. static strmap_t *rend_cache = NULL;
  134. /* Initializes the service descriptor cache.
  135. */
  136. void rend_cache_init(void)
  137. {
  138. rend_cache = strmap_new();
  139. }
  140. /* Removes all old entries from the service descriptor cache.
  141. */
  142. void rend_cache_clean(void)
  143. {
  144. strmap_iter_t *iter;
  145. const char *key;
  146. void *val;
  147. rend_cache_entry_t *ent;
  148. time_t cutoff;
  149. cutoff = time(NULL) - REND_CACHE_MAX_AGE;
  150. for (iter = strmap_iter_init(rend_cache); !strmap_iter_done(iter); ) {
  151. strmap_iter_get(iter, &key, &val);
  152. ent = (rend_cache_entry_t*)val;
  153. if (ent->parsed->timestamp < cutoff) {
  154. iter = strmap_iter_next_rmv(rend_cache, iter);
  155. rend_service_descriptor_free(ent->parsed);
  156. tor_free(ent->desc);
  157. tor_free(ent);
  158. } else {
  159. iter = strmap_iter_next(rend_cache, iter);
  160. }
  161. }
  162. }
  163. /* return 1 if query is a valid service id, else return 0. */
  164. int rend_valid_service_id(char *query) {
  165. if(strlen(query) != REND_SERVICE_ID_LEN)
  166. return 0;
  167. if (strspn(query, BASE32_CHARS) != REND_SERVICE_ID_LEN)
  168. return 0;
  169. return 1;
  170. }
  171. int rend_cache_lookup_entry(char *query, rend_cache_entry_t **e)
  172. {
  173. assert(rend_cache);
  174. if (!rend_valid_service_id(query))
  175. return -1;
  176. *e = strmap_get_lc(rend_cache, query);
  177. if (!*e)
  178. return 0;
  179. return 1;
  180. }
  181. /* 'query' is a base-32'ed service id. If it's malformed, return -1.
  182. * Else look it up.
  183. * If it is found, point *desc to it, and write its length into
  184. * *desc_len, and return 1.
  185. * If it is not found, return 0.
  186. */
  187. int rend_cache_lookup_desc(char *query, const char **desc, int *desc_len)
  188. {
  189. rend_cache_entry_t *e;
  190. int r;
  191. r = rend_cache_lookup_entry(query,&e);
  192. if (r <= 0) return r;
  193. *desc = e->desc;
  194. *desc_len = e->len;
  195. return 1;
  196. }
  197. /* Calculate desc's service id, and store it.
  198. * Return -1 if it's malformed or otherwise rejected and you
  199. * want the caller to fail, else return 0.
  200. */
  201. int rend_cache_store(char *desc, int desc_len)
  202. {
  203. rend_cache_entry_t *e;
  204. rend_service_descriptor_t *parsed;
  205. char query[REND_SERVICE_ID_LEN+1];
  206. time_t now;
  207. assert(rend_cache);
  208. parsed = rend_parse_service_descriptor(desc,desc_len);
  209. if (!parsed) {
  210. log_fn(LOG_WARN,"Couldn't parse service descriptor");
  211. return -1;
  212. }
  213. if (rend_get_service_id(parsed->pk, query)<0) {
  214. log_fn(LOG_WARN,"Couldn't compute service ID");
  215. rend_service_descriptor_free(parsed);
  216. return -1;
  217. }
  218. now = time(NULL);
  219. if (parsed->timestamp < now-REND_CACHE_MAX_AGE) {
  220. log_fn(LOG_WARN,"Service descriptor is too old");
  221. rend_service_descriptor_free(parsed);
  222. return -1;
  223. }
  224. if (parsed->timestamp > now+REND_CACHE_MAX_SKEW) {
  225. log_fn(LOG_WARN,"Service descriptor is too far in the future");
  226. rend_service_descriptor_free(parsed);
  227. return -1;
  228. }
  229. e = (rend_cache_entry_t*) strmap_get_lc(rend_cache, query);
  230. if (e && e->parsed->timestamp > parsed->timestamp) {
  231. log_fn(LOG_INFO,"We already have a newer service descriptor with the same ID");
  232. rend_service_descriptor_free(parsed);
  233. return 0;
  234. }
  235. if (e && e->len == desc_len && !memcmp(desc,e->desc,desc_len)) {
  236. log_fn(LOG_INFO,"We already have this service descriptor");
  237. e->received = time(NULL);
  238. rend_service_descriptor_free(parsed);
  239. return 0;
  240. }
  241. if (!e) {
  242. e = tor_malloc_zero(sizeof(rend_cache_entry_t));
  243. strmap_set_lc(rend_cache, query, e);
  244. } else {
  245. rend_service_descriptor_free(e->parsed);
  246. tor_free(e->desc);
  247. }
  248. e->received = time(NULL);
  249. e->parsed = parsed;
  250. e->len = desc_len;
  251. e->desc = tor_malloc(desc_len);
  252. memcpy(e->desc, desc, desc_len);
  253. log_fn(LOG_INFO,"Successfully stored rend desc '%s', len %d", query, desc_len);
  254. return 0;
  255. }
  256. /* Dispatch on rendezvous relay command. */
  257. void rend_process_relay_cell(circuit_t *circ, int command, int length,
  258. const char *payload)
  259. {
  260. int r;
  261. switch(command) {
  262. case RELAY_COMMAND_ESTABLISH_INTRO:
  263. r = rend_mid_establish_intro(circ,payload,length);
  264. break;
  265. case RELAY_COMMAND_ESTABLISH_RENDEZVOUS:
  266. r = rend_mid_establish_rendezvous(circ,payload,length);
  267. break;
  268. case RELAY_COMMAND_INTRODUCE1:
  269. r = rend_mid_introduce(circ,payload,length);
  270. break;
  271. case RELAY_COMMAND_INTRODUCE2:
  272. r = rend_service_introduce(circ,payload,length);
  273. break;
  274. case RELAY_COMMAND_RENDEZVOUS1:
  275. r = rend_mid_rendezvous(circ,payload,length);
  276. break;
  277. case RELAY_COMMAND_RENDEZVOUS2:
  278. r = rend_client_receive_rendezvous(circ,payload,length);
  279. break;
  280. case RELAY_COMMAND_INTRO_ESTABLISHED:
  281. r = rend_service_intro_established(circ,payload,length);
  282. break;
  283. case RELAY_COMMAND_RENDEZVOUS_ESTABLISHED:
  284. r = rend_client_rendezvous_acked(circ,payload,length);
  285. break;
  286. default:
  287. assert(0);
  288. }
  289. }
  290. /*
  291. Local Variables:
  292. mode:c
  293. indent-tabs-mode:nil
  294. c-basic-offset:2
  295. End:
  296. */