shared_random.c 46 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409
  1. /* Copyright (c) 2016, The Tor Project, Inc. */
  2. /* See LICENSE for licensing information */
  3. /**
  4. * \file shared_random.c
  5. *
  6. * \brief Functions and data structure needed to accomplish the shared
  7. * random protocol as defined in proposal #250.
  8. *
  9. * \details
  10. *
  11. * This file implements the dirauth-only commit-and-reveal protocol specified
  12. * by proposal #250. The protocol has two phases (sr_phase_t): the commitment
  13. * phase and the reveal phase (see get_sr_protocol_phase()).
  14. *
  15. * During the protocol, directory authorities keep state in memory (using
  16. * sr_state_t) and in disk (using sr_disk_state_t). The synchronization between
  17. * these two data structures happens in disk_state_update() and
  18. * disk_state_parse().
  19. *
  20. * Here is a rough protocol outline:
  21. *
  22. * 1) In the beginning of the commitment phase, dirauths generate a
  23. * commitment/reveal value for the current protocol run (see
  24. * new_protocol_run() and sr_generate_our_commit()).
  25. *
  26. * 2) During voting, dirauths publish their commits in their votes
  27. * depending on the current phase. Dirauths also include the two
  28. * latest shared random values (SRV) in their votes.
  29. * (see sr_get_string_for_vote())
  30. *
  31. * 3) Upon receiving a commit from a vote, authorities parse it, verify
  32. * it, and attempt to save any new commitment or reveal information in
  33. * their state file (see extract_shared_random_commits() and
  34. * sr_handle_received_commits()). They also parse SRVs from votes to
  35. * decide which SRV should be included in the final consensus (see
  36. * extract_shared_random_srvs()).
  37. *
  38. * 3) After voting is done, we count the SRVs we extracted from the votes,
  39. * to find the one voted by the majority of dirauths which should be
  40. * included in the final consensus (see get_majority_srv_from_votes()).
  41. * If an appropriate SRV is found, it is embedded in the consensus (see
  42. * sr_get_string_for_consensus()).
  43. *
  44. * 4) At the end of the reveal phase, dirauths compute a fresh SRV for the
  45. * day using the active commits (see sr_compute_srv()). This new SRV
  46. * is embedded in the votes as described above.
  47. *
  48. * Some more notes:
  49. *
  50. * - To support rebooting authorities and to avoid double voting, each dirauth
  51. * saves the current state of the protocol on disk so that it can resume
  52. * normally in case of reboot. The disk state (sr_disk_state_t) is managed by
  53. * shared_random_state.c:state_query() and we go to extra lengths to ensure
  54. * that the state is flushed on disk everytime we receive any useful
  55. * information like commits or SRVs.
  56. *
  57. * - When we receive a commit from a vote, we examine it to see if it's useful
  58. * to us and whether it's appropriate to receive it according to the current
  59. * phase of the protocol (see should_keep_commit()). If the commit is useful
  60. * to us, we save it in our disk state using save_commit_to_state(). When we
  61. * receive the reveal information corresponding to a commitment, we verify
  62. * that they indeed match using verify_commit_and_reveal().
  63. *
  64. * - We treat consensuses as the ground truth, so everytime we generate a new
  65. * consensus we update our SR state accordingly even if our local view was
  66. * different (see sr_act_post_consensus()).
  67. *
  68. * - After a consensus has been composed, the SR protocol state gets prepared
  69. * for the next voting session using sr_state_update(). That function takes
  70. * care of housekeeping and also rotates the SRVs and commits in case a new
  71. * protocol run is coming up. We also call sr_state_update() on bootup (in
  72. * sr_state_init()), to prepare the state for the very first voting session.
  73. *
  74. * Terminology:
  75. *
  76. * - "Commitment" is the commitment value of the commit-and-reveal protocol.
  77. *
  78. * - "Reveal" is the reveal value of the commit-and-reveal protocol.
  79. *
  80. * - "Commit" is a struct (sr_commit_t) that contains a commitment value and
  81. * optionally also a corresponding reveal value.
  82. *
  83. * - "SRV" is the Shared Random Value that gets generated as the result of the
  84. * commit-and-reveal protocol.
  85. **/
  86. #define SHARED_RANDOM_PRIVATE
  87. #include "or.h"
  88. #include "shared_random.h"
  89. #include "config.h"
  90. #include "confparse.h"
  91. #include "dirvote.h"
  92. #include "networkstatus.h"
  93. #include "routerkeys.h"
  94. #include "router.h"
  95. #include "routerlist.h"
  96. #include "shared_random_state.h"
  97. #include "util.h"
  98. /* String prefix of shared random values in votes/consensuses. */
  99. static const char previous_srv_str[] = "shared-rand-previous-value";
  100. static const char current_srv_str[] = "shared-rand-current-value";
  101. static const char commit_ns_str[] = "shared-rand-commit";
  102. static const char sr_flag_ns_str[] = "shared-rand-participate";
  103. /* The value of the consensus param AuthDirNumSRVAgreements found in the
  104. * vote. This is set once the consensus creation subsystem requests the
  105. * SRV(s) that should be put in the consensus. We use this value to decide
  106. * if we keep or not an SRV. */
  107. static int32_t num_srv_agreements_from_vote;
  108. /* Return a heap allocated copy of the SRV <b>orig</b>. */
  109. STATIC sr_srv_t *
  110. srv_dup(const sr_srv_t *orig)
  111. {
  112. sr_srv_t *duplicate = NULL;
  113. if (!orig) {
  114. return NULL;
  115. }
  116. duplicate = tor_malloc_zero(sizeof(sr_srv_t));
  117. duplicate->num_reveals = orig->num_reveals;
  118. memcpy(duplicate->value, orig->value, sizeof(duplicate->value));
  119. return duplicate;
  120. }
  121. /* Allocate a new commit object and initializing it with <b>rsa_identity</b>
  122. * that MUST be provided. The digest algorithm is set to the default one
  123. * that is supported. The rest is uninitialized. This never returns NULL. */
  124. static sr_commit_t *
  125. commit_new(const char *rsa_identity)
  126. {
  127. sr_commit_t *commit;
  128. tor_assert(rsa_identity);
  129. commit = tor_malloc_zero(sizeof(*commit));
  130. commit->alg = SR_DIGEST_ALG;
  131. memcpy(commit->rsa_identity, rsa_identity, sizeof(commit->rsa_identity));
  132. base16_encode(commit->rsa_identity_hex, sizeof(commit->rsa_identity_hex),
  133. commit->rsa_identity, sizeof(commit->rsa_identity));
  134. return commit;
  135. }
  136. /* Issue a log message describing <b>commit</b>. */
  137. static void
  138. commit_log(const sr_commit_t *commit)
  139. {
  140. tor_assert(commit);
  141. log_debug(LD_DIR, "SR: Commit from %s", sr_commit_get_rsa_fpr(commit));
  142. log_debug(LD_DIR, "SR: Commit: [TS: %" PRIu64 "] [Encoded: %s]",
  143. commit->commit_ts, commit->encoded_commit);
  144. log_debug(LD_DIR, "SR: Reveal: [TS: %" PRIu64 "] [Encoded: %s]",
  145. commit->reveal_ts, safe_str(commit->encoded_reveal));
  146. }
  147. /* Make sure that the commitment and reveal information in <b>commit</b>
  148. * match. If they match return 0, return -1 otherwise. This function MUST be
  149. * used everytime we receive a new reveal value. Furthermore, the commit
  150. * object MUST have a reveal value and the hash of the reveal value. */
  151. STATIC int
  152. verify_commit_and_reveal(const sr_commit_t *commit)
  153. {
  154. tor_assert(commit);
  155. log_debug(LD_DIR, "SR: Validating commit from authority %s",
  156. sr_commit_get_rsa_fpr(commit));
  157. /* Check that the timestamps match. */
  158. if (commit->commit_ts != commit->reveal_ts) {
  159. log_warn(LD_BUG, "SR: Commit timestamp %" PRIu64 " doesn't match reveal "
  160. "timestamp %" PRIu64, commit->commit_ts,
  161. commit->reveal_ts);
  162. goto invalid;
  163. }
  164. /* Verify that the hashed_reveal received in the COMMIT message, matches
  165. * the reveal we just received. */
  166. {
  167. /* We first hash the reveal we just received. */
  168. char received_hashed_reveal[sizeof(commit->hashed_reveal)];
  169. /* Only sha3-256 is supported. */
  170. if (commit->alg != SR_DIGEST_ALG) {
  171. goto invalid;
  172. }
  173. /* Use the invariant length since the encoded reveal variable has an
  174. * extra byte for the NUL terminated byte. */
  175. if (crypto_digest256(received_hashed_reveal, commit->encoded_reveal,
  176. SR_REVEAL_BASE64_LEN, commit->alg) < 0) {
  177. /* Unable to digest the reveal blob, this is unlikely. */
  178. goto invalid;
  179. }
  180. /* Now compare that with the hashed_reveal we received in COMMIT. */
  181. if (fast_memneq(received_hashed_reveal, commit->hashed_reveal,
  182. sizeof(received_hashed_reveal))) {
  183. log_warn(LD_BUG, "SR: Received reveal value from authority %s "
  184. "doesn't match the commit value.",
  185. sr_commit_get_rsa_fpr(commit));
  186. goto invalid;
  187. }
  188. }
  189. return 0;
  190. invalid:
  191. return -1;
  192. }
  193. /* Return true iff the commit contains an encoded reveal value. */
  194. STATIC int
  195. commit_has_reveal_value(const sr_commit_t *commit)
  196. {
  197. return !tor_mem_is_zero(commit->encoded_reveal,
  198. sizeof(commit->encoded_reveal));
  199. }
  200. /* Parse the encoded commit. The format is:
  201. * base64-encode( TIMESTAMP || H(REVEAL) )
  202. *
  203. * If successfully decoded and parsed, commit is updated and 0 is returned.
  204. * On error, return -1. */
  205. STATIC int
  206. commit_decode(const char *encoded, sr_commit_t *commit)
  207. {
  208. int decoded_len = 0;
  209. size_t offset = 0;
  210. /* XXX: Needs two extra bytes for the base64 decode calculation matches
  211. * the binary length once decoded. #17868. */
  212. char b64_decoded[SR_COMMIT_LEN + 2];
  213. tor_assert(encoded);
  214. tor_assert(commit);
  215. if (strlen(encoded) > SR_COMMIT_BASE64_LEN) {
  216. /* This means that if we base64 decode successfully the reveiced commit,
  217. * we'll end up with a bigger decoded commit thus unusable. */
  218. goto error;
  219. }
  220. /* Decode our encoded commit. Let's be careful here since _encoded_ is
  221. * coming from the network in a dirauth vote so we expect nothing more
  222. * than the base64 encoded length of a commit. */
  223. decoded_len = base64_decode(b64_decoded, sizeof(b64_decoded),
  224. encoded, strlen(encoded));
  225. if (decoded_len < 0) {
  226. log_warn(LD_BUG, "SR: Commit from authority %s can't be decoded.",
  227. sr_commit_get_rsa_fpr(commit));
  228. goto error;
  229. }
  230. if (decoded_len != SR_COMMIT_LEN) {
  231. log_warn(LD_BUG, "SR: Commit from authority %s decoded length doesn't "
  232. "match the expected length (%d vs %u).",
  233. sr_commit_get_rsa_fpr(commit), decoded_len,
  234. (unsigned)SR_COMMIT_LEN);
  235. goto error;
  236. }
  237. /* First is the timestamp (8 bytes). */
  238. commit->commit_ts = tor_ntohll(get_uint64(b64_decoded));
  239. offset += sizeof(uint64_t);
  240. /* Next is hashed reveal. */
  241. memcpy(commit->hashed_reveal, b64_decoded + offset,
  242. sizeof(commit->hashed_reveal));
  243. /* Copy the base64 blob to the commit. Useful for voting. */
  244. strlcpy(commit->encoded_commit, encoded, sizeof(commit->encoded_commit));
  245. return 0;
  246. error:
  247. return -1;
  248. }
  249. /* Parse the b64 blob at <b>encoded</b> containing reveal information and
  250. * store the information in-place in <b>commit</b>. Return 0 on success else
  251. * a negative value. */
  252. STATIC int
  253. reveal_decode(const char *encoded, sr_commit_t *commit)
  254. {
  255. int decoded_len = 0;
  256. /* XXX: Needs two extra bytes for the base64 decode calculation matches
  257. * the binary length once decoded. #17868. */
  258. char b64_decoded[SR_REVEAL_LEN + 2];
  259. tor_assert(encoded);
  260. tor_assert(commit);
  261. if (strlen(encoded) > SR_REVEAL_BASE64_LEN) {
  262. /* This means that if we base64 decode successfully the received reveal
  263. * value, we'll end up with a bigger decoded value thus unusable. */
  264. goto error;
  265. }
  266. /* Decode our encoded reveal. Let's be careful here since _encoded_ is
  267. * coming from the network in a dirauth vote so we expect nothing more
  268. * than the base64 encoded length of our reveal. */
  269. decoded_len = base64_decode(b64_decoded, sizeof(b64_decoded),
  270. encoded, strlen(encoded));
  271. if (decoded_len < 0) {
  272. log_warn(LD_BUG, "SR: Reveal from authority %s can't be decoded.",
  273. sr_commit_get_rsa_fpr(commit));
  274. goto error;
  275. }
  276. if (decoded_len != SR_REVEAL_LEN) {
  277. log_warn(LD_BUG, "SR: Reveal from authority %s decoded length is "
  278. "doesn't match the expected length (%d vs %u)",
  279. sr_commit_get_rsa_fpr(commit), decoded_len,
  280. (unsigned)SR_REVEAL_LEN);
  281. goto error;
  282. }
  283. commit->reveal_ts = tor_ntohll(get_uint64(b64_decoded));
  284. /* Copy the last part, the random value. */
  285. memcpy(commit->random_number, b64_decoded + 8,
  286. sizeof(commit->random_number));
  287. /* Also copy the whole message to use during verification */
  288. strlcpy(commit->encoded_reveal, encoded, sizeof(commit->encoded_reveal));
  289. return 0;
  290. error:
  291. return -1;
  292. }
  293. /* Encode a reveal element using a given commit object to dst which is a
  294. * buffer large enough to put the base64-encoded reveal construction. The
  295. * format is as follow:
  296. * REVEAL = base64-encode( TIMESTAMP || H(RN) )
  297. * Return base64 encoded length on success else a negative value.
  298. */
  299. STATIC int
  300. reveal_encode(const sr_commit_t *commit, char *dst, size_t len)
  301. {
  302. int ret;
  303. size_t offset = 0;
  304. char buf[SR_REVEAL_LEN] = {0};
  305. tor_assert(commit);
  306. tor_assert(dst);
  307. set_uint64(buf, tor_htonll(commit->reveal_ts));
  308. offset += sizeof(uint64_t);
  309. memcpy(buf + offset, commit->random_number,
  310. sizeof(commit->random_number));
  311. /* Let's clean the buffer and then b64 encode it. */
  312. memset(dst, 0, len);
  313. ret = base64_encode(dst, len, buf, sizeof(buf), 0);
  314. /* Wipe this buffer because it contains our random value. */
  315. memwipe(buf, 0, sizeof(buf));
  316. return ret;
  317. }
  318. /* Encode the given commit object to dst which is a buffer large enough to
  319. * put the base64-encoded commit. The format is as follow:
  320. * COMMIT = base64-encode( TIMESTAMP || H(H(RN)) )
  321. * Return base64 encoded length on success else a negative value.
  322. */
  323. STATIC int
  324. commit_encode(const sr_commit_t *commit, char *dst, size_t len)
  325. {
  326. size_t offset = 0;
  327. char buf[SR_COMMIT_LEN] = {0};
  328. tor_assert(commit);
  329. tor_assert(dst);
  330. /* First is the timestamp (8 bytes). */
  331. set_uint64(buf, tor_htonll(commit->commit_ts));
  332. offset += sizeof(uint64_t);
  333. /* and then the hashed reveal. */
  334. memcpy(buf + offset, commit->hashed_reveal,
  335. sizeof(commit->hashed_reveal));
  336. /* Clean the buffer and then b64 encode it. */
  337. memset(dst, 0, len);
  338. return base64_encode(dst, len, buf, sizeof(buf), 0);
  339. }
  340. /* Cleanup both our global state and disk state. */
  341. static void
  342. sr_cleanup(void)
  343. {
  344. sr_state_free();
  345. }
  346. /* Using <b>commit</b>, return a newly allocated string containing the commit
  347. * information that should be used during SRV calculation. It's the caller
  348. * responsibility to free the memory. Return NULL if this is not a commit to be
  349. * used for SRV calculation. */
  350. static char *
  351. get_srv_element_from_commit(const sr_commit_t *commit)
  352. {
  353. char *element;
  354. tor_assert(commit);
  355. if (!commit_has_reveal_value(commit)) {
  356. return NULL;
  357. }
  358. tor_asprintf(&element, "%s%s", sr_commit_get_rsa_fpr(commit),
  359. commit->encoded_reveal);
  360. return element;
  361. }
  362. /* Return a srv object that is built with the construction:
  363. * SRV = SHA3-256("shared-random" | INT_8(reveal_num) |
  364. * INT_4(version) | HASHED_REVEALS | previous_SRV)
  365. * This function cannot fail. */
  366. static sr_srv_t *
  367. generate_srv(const char *hashed_reveals, uint64_t reveal_num,
  368. const sr_srv_t *previous_srv)
  369. {
  370. char msg[DIGEST256_LEN + SR_SRV_MSG_LEN] = {0};
  371. size_t offset = 0;
  372. sr_srv_t *srv;
  373. tor_assert(hashed_reveals);
  374. /* Add the invariant token. */
  375. memcpy(msg, SR_SRV_TOKEN, SR_SRV_TOKEN_LEN);
  376. offset += SR_SRV_TOKEN_LEN;
  377. set_uint64(msg + offset, tor_htonll(reveal_num));
  378. offset += sizeof(uint64_t);
  379. set_uint32(msg + offset, htonl(SR_PROTO_VERSION));
  380. offset += sizeof(uint32_t);
  381. memcpy(msg + offset, hashed_reveals, DIGEST256_LEN);
  382. offset += DIGEST256_LEN;
  383. if (previous_srv != NULL) {
  384. memcpy(msg + offset, previous_srv->value, sizeof(previous_srv->value));
  385. }
  386. /* Ok we have our message and key for the HMAC computation, allocate our
  387. * srv object and do the last step. */
  388. srv = tor_malloc_zero(sizeof(*srv));
  389. crypto_digest256((char *) srv->value, msg, sizeof(msg), SR_DIGEST_ALG);
  390. srv->num_reveals = reveal_num;
  391. {
  392. /* Debugging. */
  393. char srv_hash_encoded[SR_SRV_VALUE_BASE64_LEN + 1];
  394. sr_srv_encode(srv_hash_encoded, sizeof(srv_hash_encoded), srv);
  395. log_info(LD_DIR, "SR: Generated SRV: %s", srv_hash_encoded);
  396. }
  397. return srv;
  398. }
  399. /* Compare reveal values and return the result. This should exclusively be
  400. * used by smartlist_sort(). */
  401. static int
  402. compare_reveal_(const void **_a, const void **_b)
  403. {
  404. const sr_commit_t *a = *_a, *b = *_b;
  405. return fast_memcmp(a->hashed_reveal, b->hashed_reveal,
  406. sizeof(a->hashed_reveal));
  407. }
  408. /* Given <b>commit</b> give the line that we should place in our votes.
  409. * It's the responsibility of the caller to free the string. */
  410. static char *
  411. get_vote_line_from_commit(const sr_commit_t *commit, sr_phase_t phase)
  412. {
  413. char *vote_line = NULL;
  414. switch (phase) {
  415. case SR_PHASE_COMMIT:
  416. tor_asprintf(&vote_line, "%s %u %s %s %s\n",
  417. commit_ns_str,
  418. SR_PROTO_VERSION,
  419. crypto_digest_algorithm_get_name(commit->alg),
  420. sr_commit_get_rsa_fpr(commit),
  421. commit->encoded_commit);
  422. break;
  423. case SR_PHASE_REVEAL:
  424. {
  425. /* Send a reveal value for this commit if we have one. */
  426. const char *reveal_str = commit->encoded_reveal;
  427. if (tor_mem_is_zero(commit->encoded_reveal,
  428. sizeof(commit->encoded_reveal))) {
  429. reveal_str = "";
  430. }
  431. tor_asprintf(&vote_line, "%s %u %s %s %s %s\n",
  432. commit_ns_str,
  433. SR_PROTO_VERSION,
  434. crypto_digest_algorithm_get_name(commit->alg),
  435. sr_commit_get_rsa_fpr(commit),
  436. commit->encoded_commit, reveal_str);
  437. break;
  438. }
  439. default:
  440. tor_assert(0);
  441. }
  442. log_debug(LD_DIR, "SR: Commit vote line: %s", vote_line);
  443. return vote_line;
  444. }
  445. /* Convert a given srv object to a string for the control port. This doesn't
  446. * fail and the srv object MUST be valid. */
  447. static char *
  448. srv_to_control_string(const sr_srv_t *srv)
  449. {
  450. char *srv_str;
  451. char srv_hash_encoded[SR_SRV_VALUE_BASE64_LEN + 1];
  452. tor_assert(srv);
  453. sr_srv_encode(srv_hash_encoded, sizeof(srv_hash_encoded), srv);
  454. tor_asprintf(&srv_str, "%s", srv_hash_encoded);
  455. return srv_str;
  456. }
  457. /* Return a heap allocated string that contains the given <b>srv</b> string
  458. * representation formatted for a networkstatus document using the
  459. * <b>key</b> as the start of the line. This doesn't return NULL. */
  460. static char *
  461. srv_to_ns_string(const sr_srv_t *srv, const char *key)
  462. {
  463. char *srv_str;
  464. char srv_hash_encoded[SR_SRV_VALUE_BASE64_LEN + 1];
  465. tor_assert(srv);
  466. tor_assert(key);
  467. sr_srv_encode(srv_hash_encoded, sizeof(srv_hash_encoded), srv);
  468. tor_asprintf(&srv_str, "%s %" PRIu64 " %s\n", key,
  469. srv->num_reveals, srv_hash_encoded);
  470. log_debug(LD_DIR, "SR: Consensus SRV line: %s", srv_str);
  471. return srv_str;
  472. }
  473. /* Given the previous SRV and the current SRV, return a heap allocated
  474. * string with their data that could be put in a vote or a consensus. Caller
  475. * must free the returned string. Return NULL if no SRVs were provided. */
  476. static char *
  477. get_ns_str_from_sr_values(const sr_srv_t *prev_srv, const sr_srv_t *cur_srv)
  478. {
  479. smartlist_t *chunks = NULL;
  480. char *srv_str;
  481. if (!prev_srv && !cur_srv) {
  482. return NULL;
  483. }
  484. chunks = smartlist_new();
  485. if (prev_srv) {
  486. char *srv_line = srv_to_ns_string(prev_srv, previous_srv_str);
  487. smartlist_add(chunks, srv_line);
  488. }
  489. if (cur_srv) {
  490. char *srv_line = srv_to_ns_string(cur_srv, current_srv_str);
  491. smartlist_add(chunks, srv_line);
  492. }
  493. /* Join the line(s) here in one string to return. */
  494. srv_str = smartlist_join_strings(chunks, "", 0, NULL);
  495. SMARTLIST_FOREACH(chunks, char *, s, tor_free(s));
  496. smartlist_free(chunks);
  497. return srv_str;
  498. }
  499. /* Return 1 iff the two commits have the same commitment values. This
  500. * function does not care about reveal values. */
  501. STATIC int
  502. commitments_are_the_same(const sr_commit_t *commit_one,
  503. const sr_commit_t *commit_two)
  504. {
  505. tor_assert(commit_one);
  506. tor_assert(commit_two);
  507. if (strcmp(commit_one->encoded_commit, commit_two->encoded_commit)) {
  508. return 0;
  509. }
  510. return 1;
  511. }
  512. /* We just received a commit from the vote of authority with
  513. * <b>identity_digest</b>. Return 1 if this commit is authorititative that
  514. * is, it belongs to the authority that voted it. Else return 0 if not. */
  515. STATIC int
  516. commit_is_authoritative(const sr_commit_t *commit,
  517. const char *voter_key)
  518. {
  519. tor_assert(commit);
  520. tor_assert(voter_key);
  521. return fast_memeq(commit->rsa_identity, voter_key,
  522. sizeof(commit->rsa_identity));
  523. }
  524. /* Decide if the newly received <b>commit</b> should be kept depending on
  525. * the current phase and state of the protocol. The <b>voter_key</b> is the
  526. * RSA identity key fingerprint of the authority's vote from which the
  527. * commit comes from. The <b>phase</b> is the phase we should be validating
  528. * the commit for. Return 1 if the commit should be added to our state or 0
  529. * if not. */
  530. STATIC int
  531. should_keep_commit(const sr_commit_t *commit, const char *voter_key,
  532. sr_phase_t phase)
  533. {
  534. const sr_commit_t *saved_commit;
  535. tor_assert(commit);
  536. tor_assert(voter_key);
  537. log_debug(LD_DIR, "SR: Inspecting commit from %s (voter: %s)?",
  538. sr_commit_get_rsa_fpr(commit),
  539. hex_str(voter_key, DIGEST_LEN));
  540. /* For a commit to be considered, it needs to be authoritative (it should
  541. * be the voter's own commit). */
  542. if (!commit_is_authoritative(commit, voter_key)) {
  543. log_debug(LD_DIR, "SR: Ignoring non-authoritative commit.");
  544. goto ignore;
  545. }
  546. /* Let's make sure, for extra safety, that this fingerprint is known to
  547. * us. Even though this comes from a vote, doesn't hurt to be
  548. * extracareful. */
  549. if (trusteddirserver_get_by_v3_auth_digest(commit->rsa_identity) == NULL) {
  550. log_warn(LD_DIR, "SR: Fingerprint %s is not from a recognized "
  551. "authority. Discarding commit.",
  552. escaped(commit->rsa_identity));
  553. goto ignore;
  554. }
  555. /* Check if the authority that voted for <b>commit</b> has already posted
  556. * a commit before. */
  557. saved_commit = sr_state_get_commit(commit->rsa_identity);
  558. switch (phase) {
  559. case SR_PHASE_COMMIT:
  560. /* Already having a commit for an authority so ignore this one. */
  561. if (saved_commit) {
  562. /* Receiving known commits should happen naturally since commit phase
  563. lasts multiple rounds. However if the commitment value changes
  564. during commit phase, it might be a bug so log more loudly. */
  565. if (!commitments_are_the_same(commit, saved_commit)) {
  566. log_info(LD_DIR,
  567. "SR: Received altered commit from %s in commit phase.",
  568. sr_commit_get_rsa_fpr(commit));
  569. } else {
  570. log_debug(LD_DIR, "SR: Ignoring known commit during commit phase.");
  571. }
  572. goto ignore;
  573. }
  574. /* A commit with a reveal value during commitment phase is very wrong. */
  575. if (commit_has_reveal_value(commit)) {
  576. log_warn(LD_DIR, "SR: Commit from authority %s has a reveal value "
  577. "during COMMIT phase. (voter: %s)",
  578. sr_commit_get_rsa_fpr(commit),
  579. hex_str(voter_key, DIGEST_LEN));
  580. goto ignore;
  581. }
  582. break;
  583. case SR_PHASE_REVEAL:
  584. /* We are now in reveal phase. We keep a commit if and only if:
  585. *
  586. * - We have already seen a commit by this auth, AND
  587. * - the saved commit has the same commitment value as this one, AND
  588. * - the saved commit has no reveal information, AND
  589. * - this commit does have reveal information, AND
  590. * - the reveal & commit information are matching.
  591. *
  592. * If all the above are true, then we are interested in this new commit
  593. * for its reveal information. */
  594. if (!saved_commit) {
  595. log_debug(LD_DIR, "SR: Ignoring commit first seen in reveal phase.");
  596. goto ignore;
  597. }
  598. if (!commitments_are_the_same(commit, saved_commit)) {
  599. log_warn(LD_DIR, "SR: Commit from authority %s is different from "
  600. "previous commit in our state (voter: %s)",
  601. sr_commit_get_rsa_fpr(commit),
  602. hex_str(voter_key, DIGEST_LEN));
  603. goto ignore;
  604. }
  605. if (commit_has_reveal_value(saved_commit)) {
  606. log_debug(LD_DIR, "SR: Ignoring commit with known reveal info.");
  607. goto ignore;
  608. }
  609. if (!commit_has_reveal_value(commit)) {
  610. log_debug(LD_DIR, "SR: Ignoring commit without reveal value.");
  611. goto ignore;
  612. }
  613. if (verify_commit_and_reveal(commit) < 0) {
  614. log_warn(LD_BUG, "SR: Commit from authority %s has an invalid "
  615. "reveal value. (voter: %s)",
  616. sr_commit_get_rsa_fpr(commit),
  617. hex_str(voter_key, DIGEST_LEN));
  618. goto ignore;
  619. }
  620. break;
  621. default:
  622. tor_assert(0);
  623. }
  624. return 1;
  625. ignore:
  626. return 0;
  627. }
  628. /* We are in reveal phase and we found a valid and verified <b>commit</b> in
  629. * a vote that contains reveal values that we could use. Update the commit
  630. * we have in our state. Never call this with an unverified commit. */
  631. STATIC void
  632. save_commit_during_reveal_phase(const sr_commit_t *commit)
  633. {
  634. sr_commit_t *saved_commit;
  635. tor_assert(commit);
  636. /* Get the commit from our state. */
  637. saved_commit = sr_state_get_commit(commit->rsa_identity);
  638. tor_assert(saved_commit);
  639. /* Safety net. They can not be different commitments at this point. */
  640. int same_commits = commitments_are_the_same(commit, saved_commit);
  641. tor_assert(same_commits);
  642. /* Copy reveal information to our saved commit. */
  643. sr_state_copy_reveal_info(saved_commit, commit);
  644. }
  645. /* Save <b>commit</b> to our persistent state. Depending on the current
  646. * phase, different actions are taken. Steals reference of <b>commit</b>.
  647. * The commit object MUST be valid and verified before adding it to the
  648. * state. */
  649. STATIC void
  650. save_commit_to_state(sr_commit_t *commit)
  651. {
  652. sr_phase_t phase = sr_state_get_phase();
  653. ASSERT_COMMIT_VALID(commit);
  654. switch (phase) {
  655. case SR_PHASE_COMMIT:
  656. /* During commit phase, just save any new authoritative commit */
  657. sr_state_add_commit(commit);
  658. break;
  659. case SR_PHASE_REVEAL:
  660. save_commit_during_reveal_phase(commit);
  661. sr_commit_free(commit);
  662. break;
  663. default:
  664. tor_assert(0);
  665. }
  666. }
  667. /* Return 1 if we should we keep an SRV voted by <b>n_agreements</b> auths.
  668. * Return 0 if we should ignore it. */
  669. static int
  670. should_keep_srv(int n_agreements)
  671. {
  672. /* Check if the most popular SRV has reached majority. */
  673. int n_voters = get_n_authorities(V3_DIRINFO);
  674. int votes_required_for_majority = (n_voters / 2) + 1;
  675. /* We need at the very least majority to keep a value. */
  676. if (n_agreements < votes_required_for_majority) {
  677. log_notice(LD_DIR, "SR: SRV didn't reach majority [%d/%d]!",
  678. n_agreements, votes_required_for_majority);
  679. return 0;
  680. }
  681. /* When we just computed a new SRV, we need to have super majority in order
  682. * to keep it. */
  683. if (sr_state_srv_is_fresh()) {
  684. /* Check if we have super majority for this new SRV value. */
  685. if (n_agreements < num_srv_agreements_from_vote) {
  686. log_notice(LD_DIR, "SR: New SRV didn't reach agreement [%d/%d]!",
  687. n_agreements, num_srv_agreements_from_vote);
  688. return 0;
  689. }
  690. }
  691. return 1;
  692. }
  693. /* Helper: compare two DIGEST256_LEN digests. */
  694. static int
  695. compare_srvs_(const void **_a, const void **_b)
  696. {
  697. const sr_srv_t *a = *_a, *b = *_b;
  698. return tor_memcmp(a->value, b->value, sizeof(a->value));
  699. }
  700. /* Return the most frequent member of the sorted list of DIGEST256_LEN
  701. * digests in <b>sl</b> with the count of that most frequent element. */
  702. static sr_srv_t *
  703. smartlist_get_most_frequent_srv(const smartlist_t *sl, int *count_out)
  704. {
  705. return smartlist_get_most_frequent_(sl, compare_srvs_, count_out);
  706. }
  707. /** Compare two SRVs. Used in smartlist sorting. */
  708. static int
  709. compare_srv_(const void **_a, const void **_b)
  710. {
  711. const sr_srv_t *a = *_a, *b = *_b;
  712. return fast_memcmp(a->value, b->value,
  713. sizeof(a->value));
  714. }
  715. /* Using a list of <b>votes</b>, return the SRV object from them that has
  716. * been voted by the majority of dirauths. If <b>current</b> is set, we look
  717. * for the current SRV value else the previous one. The returned pointer is
  718. * an object located inside a vote. NULL is returned if no appropriate value
  719. * could be found. */
  720. STATIC sr_srv_t *
  721. get_majority_srv_from_votes(const smartlist_t *votes, int current)
  722. {
  723. int count = 0;
  724. sr_srv_t *most_frequent_srv = NULL;
  725. sr_srv_t *the_srv = NULL;
  726. smartlist_t *srv_list;
  727. tor_assert(votes);
  728. srv_list = smartlist_new();
  729. /* Walk over votes and register any SRVs found. */
  730. SMARTLIST_FOREACH_BEGIN(votes, networkstatus_t *, v) {
  731. sr_srv_t *srv_tmp = NULL;
  732. if (!v->sr_info.participate) {
  733. /* Ignore vote that do not participate. */
  734. continue;
  735. }
  736. /* Do we want previous or current SRV? */
  737. srv_tmp = current ? v->sr_info.current_srv : v->sr_info.previous_srv;
  738. if (!srv_tmp) {
  739. continue;
  740. }
  741. smartlist_add(srv_list, srv_tmp);
  742. } SMARTLIST_FOREACH_END(v);
  743. smartlist_sort(srv_list, compare_srv_);
  744. most_frequent_srv = smartlist_get_most_frequent_srv(srv_list, &count);
  745. if (!most_frequent_srv) {
  746. goto end;
  747. }
  748. /* Was this SRV voted by enough auths for us to keep it? */
  749. if (!should_keep_srv(count)) {
  750. goto end;
  751. }
  752. /* We found an SRV that we can use! Habemus SRV! */
  753. the_srv = most_frequent_srv;
  754. {
  755. /* Debugging */
  756. char encoded[SR_SRV_VALUE_BASE64_LEN + 1];
  757. sr_srv_encode(encoded, sizeof(encoded), the_srv);
  758. log_debug(LD_DIR, "SR: Chosen SRV by majority: %s (%d votes)", encoded,
  759. count);
  760. }
  761. end:
  762. /* We do not free any sr_srv_t values, we don't have the ownership. */
  763. smartlist_free(srv_list);
  764. return the_srv;
  765. }
  766. /* Encode the given shared random value and put it in dst. Destination
  767. * buffer must be at least SR_SRV_VALUE_BASE64_LEN plus the NULL byte. */
  768. void
  769. sr_srv_encode(char *dst, size_t dst_len, const sr_srv_t *srv)
  770. {
  771. int ret;
  772. /* Extra byte for the NULL terminated char. */
  773. char buf[SR_SRV_VALUE_BASE64_LEN + 1];
  774. tor_assert(dst);
  775. tor_assert(srv);
  776. tor_assert(dst_len >= sizeof(buf));
  777. ret = base64_encode(buf, sizeof(buf), (const char *) srv->value,
  778. sizeof(srv->value), 0);
  779. /* Always expect the full length without the NULL byte. */
  780. tor_assert(ret == (sizeof(buf) - 1));
  781. tor_assert(ret <= (int) dst_len);
  782. strlcpy(dst, buf, dst_len);
  783. }
  784. /* Free a commit object. */
  785. void
  786. sr_commit_free(sr_commit_t *commit)
  787. {
  788. if (commit == NULL) {
  789. return;
  790. }
  791. /* Make sure we do not leave OUR random number in memory. */
  792. memwipe(commit->random_number, 0, sizeof(commit->random_number));
  793. tor_free(commit);
  794. }
  795. /* Generate the commitment/reveal value for the protocol run starting at
  796. * <b>timestamp</b>. <b>my_rsa_cert</b> is our authority RSA certificate. */
  797. sr_commit_t *
  798. sr_generate_our_commit(time_t timestamp, const authority_cert_t *my_rsa_cert)
  799. {
  800. sr_commit_t *commit = NULL;
  801. char digest[DIGEST_LEN];
  802. tor_assert(my_rsa_cert);
  803. /* Get our RSA identity fingerprint */
  804. if (crypto_pk_get_digest(my_rsa_cert->identity_key, digest) < 0) {
  805. goto error;
  806. }
  807. /* New commit with our identity key. */
  808. commit = commit_new(digest);
  809. /* Generate the reveal random value */
  810. crypto_strongest_rand(commit->random_number,
  811. sizeof(commit->random_number));
  812. commit->commit_ts = commit->reveal_ts = timestamp;
  813. /* Now get the base64 blob that corresponds to our reveal */
  814. if (reveal_encode(commit, commit->encoded_reveal,
  815. sizeof(commit->encoded_reveal)) < 0) {
  816. log_err(LD_DIR, "SR: Unable to encode our reveal value!");
  817. goto error;
  818. }
  819. /* Now let's create the commitment */
  820. tor_assert(commit->alg == SR_DIGEST_ALG);
  821. /* The invariant length is used here since the encoded reveal variable
  822. * has an extra byte added for the NULL terminated byte. */
  823. if (crypto_digest256(commit->hashed_reveal, commit->encoded_reveal,
  824. SR_REVEAL_BASE64_LEN, commit->alg) < 0) {
  825. goto error;
  826. }
  827. /* Now get the base64 blob that corresponds to our commit. */
  828. if (commit_encode(commit, commit->encoded_commit,
  829. sizeof(commit->encoded_commit)) < 0) {
  830. log_err(LD_DIR, "SR: Unable to encode our commit value!");
  831. goto error;
  832. }
  833. log_debug(LD_DIR, "SR: Generated our commitment:");
  834. commit_log(commit);
  835. /* Our commit better be valid :). */
  836. commit->valid = 1;
  837. return commit;
  838. error:
  839. sr_commit_free(commit);
  840. return NULL;
  841. }
  842. /* Compute the shared random value based on the active commits in our state. */
  843. void
  844. sr_compute_srv(void)
  845. {
  846. uint64_t reveal_num = 0;
  847. char *reveals = NULL;
  848. smartlist_t *chunks, *commits;
  849. digestmap_t *state_commits;
  850. /* Computing a shared random value in the commit phase is very wrong. This
  851. * should only happen at the very end of the reveal phase when a new
  852. * protocol run is about to start. */
  853. tor_assert(sr_state_get_phase() == SR_PHASE_REVEAL);
  854. state_commits = sr_state_get_commits();
  855. commits = smartlist_new();
  856. chunks = smartlist_new();
  857. /* We must make a list of commit ordered by authority fingerprint in
  858. * ascending order as specified by proposal 250. */
  859. DIGESTMAP_FOREACH(state_commits, key, sr_commit_t *, c) {
  860. /* Extra safety net, make sure we have valid commit before using it. */
  861. ASSERT_COMMIT_VALID(c);
  862. /* Let's not use a commit from an authority that we don't know. It's
  863. * possible that an authority could be removed during a protocol run so
  864. * that commit value should never be used in the SRV computation. */
  865. if (trusteddirserver_get_by_v3_auth_digest(c->rsa_identity) == NULL) {
  866. log_warn(LD_DIR, "SR: Fingerprint %s is not from a recognized "
  867. "authority. Discarding commit for the SRV computation.",
  868. sr_commit_get_rsa_fpr(c));
  869. continue;
  870. }
  871. /* We consider this commit valid. */
  872. smartlist_add(commits, c);
  873. } DIGESTMAP_FOREACH_END;
  874. smartlist_sort(commits, compare_reveal_);
  875. /* Now for each commit for that sorted list in ascending order, we'll
  876. * build the element for each authority that needs to go into the srv
  877. * computation. */
  878. SMARTLIST_FOREACH_BEGIN(commits, const sr_commit_t *, c) {
  879. char *element = get_srv_element_from_commit(c);
  880. if (element) {
  881. smartlist_add(chunks, element);
  882. reveal_num++;
  883. }
  884. } SMARTLIST_FOREACH_END(c);
  885. smartlist_free(commits);
  886. {
  887. /* Join all reveal values into one giant string that we'll hash so we
  888. * can generated our shared random value. */
  889. sr_srv_t *current_srv;
  890. char hashed_reveals[DIGEST256_LEN];
  891. reveals = smartlist_join_strings(chunks, "", 0, NULL);
  892. SMARTLIST_FOREACH(chunks, char *, s, tor_free(s));
  893. smartlist_free(chunks);
  894. if (crypto_digest256(hashed_reveals, reveals, strlen(reveals),
  895. SR_DIGEST_ALG) < 0) {
  896. goto end;
  897. }
  898. current_srv = generate_srv(hashed_reveals, reveal_num,
  899. sr_state_get_previous_srv());
  900. sr_state_set_current_srv(current_srv);
  901. /* We have a fresh SRV, flag our state. */
  902. sr_state_set_fresh_srv();
  903. }
  904. end:
  905. tor_free(reveals);
  906. }
  907. /* Parse a list of arguments from a SRV value either from a vote, consensus
  908. * or from our disk state and return a newly allocated srv object. NULL is
  909. * returned on error.
  910. *
  911. * The arguments' order:
  912. * num_reveals, value
  913. */
  914. sr_srv_t *
  915. sr_parse_srv(const smartlist_t *args)
  916. {
  917. char *value;
  918. int ok, ret;
  919. uint64_t num_reveals;
  920. sr_srv_t *srv = NULL;
  921. tor_assert(args);
  922. if (smartlist_len(args) < 2) {
  923. goto end;
  924. }
  925. /* First argument is the number of reveal values */
  926. num_reveals = tor_parse_uint64(smartlist_get(args, 0),
  927. 10, 0, UINT64_MAX, &ok, NULL);
  928. if (!ok) {
  929. goto end;
  930. }
  931. /* Second and last argument is the shared random value it self. */
  932. value = smartlist_get(args, 1);
  933. if (strlen(value) != SR_SRV_VALUE_BASE64_LEN) {
  934. goto end;
  935. }
  936. srv = tor_malloc_zero(sizeof(*srv));
  937. srv->num_reveals = num_reveals;
  938. /* We substract one byte from the srclen because the function ignores the
  939. * '=' character in the given buffer. This is broken but it's a documented
  940. * behavior of the implementation. */
  941. ret = base64_decode((char *) srv->value, sizeof(srv->value), value,
  942. SR_SRV_VALUE_BASE64_LEN - 1);
  943. if (ret != sizeof(srv->value)) {
  944. tor_free(srv);
  945. srv = NULL;
  946. goto end;
  947. }
  948. end:
  949. return srv;
  950. }
  951. /* Parse a commit from a vote or from our disk state and return a newly
  952. * allocated commit object. NULL is returned on error.
  953. *
  954. * The commit's data is in <b>args</b> and the order matters very much:
  955. * version, algname, RSA fingerprint, commit value[, reveal value]
  956. */
  957. sr_commit_t *
  958. sr_parse_commit(const smartlist_t *args)
  959. {
  960. uint32_t version;
  961. char *value, digest[DIGEST_LEN];
  962. digest_algorithm_t alg;
  963. const char *rsa_identity_fpr;
  964. sr_commit_t *commit = NULL;
  965. if (smartlist_len(args) < 4) {
  966. goto error;
  967. }
  968. /* First is the version number of the SR protocol which indicates at which
  969. * version that commit was created. */
  970. value = smartlist_get(args, 0);
  971. version = (uint32_t) tor_parse_ulong(value, 10, 1, UINT32_MAX, NULL, NULL);
  972. if (version > SR_PROTO_VERSION) {
  973. log_info(LD_DIR, "SR: Commit version %" PRIu32 " (%s) is not supported.",
  974. version, escaped(value));
  975. goto error;
  976. }
  977. /* Second is the algorithm. */
  978. value = smartlist_get(args, 1);
  979. alg = crypto_digest_algorithm_parse_name(value);
  980. if (alg != SR_DIGEST_ALG) {
  981. log_warn(LD_BUG, "SR: Commit algorithm %s is not recognized.",
  982. escaped(value));
  983. goto error;
  984. }
  985. /* Third argument is the RSA fingerprint of the auth and turn it into a
  986. * digest value. */
  987. rsa_identity_fpr = smartlist_get(args, 2);
  988. if (base16_decode(digest, DIGEST_LEN, rsa_identity_fpr,
  989. HEX_DIGEST_LEN) < 0) {
  990. log_warn(LD_DIR, "SR: RSA fingerprint %s not decodable",
  991. escaped(rsa_identity_fpr));
  992. goto error;
  993. }
  994. /* Allocate commit since we have a valid identity now. */
  995. commit = commit_new(digest);
  996. /* Fourth argument is the commitment value base64-encoded. */
  997. value = smartlist_get(args, 3);
  998. if (commit_decode(value, commit) < 0) {
  999. goto error;
  1000. }
  1001. /* (Optional) Fifth argument is the revealed value. */
  1002. if (smartlist_len(args) > 4) {
  1003. value = smartlist_get(args, 4);
  1004. if (reveal_decode(value, commit) < 0) {
  1005. goto error;
  1006. }
  1007. }
  1008. return commit;
  1009. error:
  1010. sr_commit_free(commit);
  1011. return NULL;
  1012. }
  1013. /* Called when we are done parsing a vote by <b>voter_key</b> that might
  1014. * contain some useful <b>commits</b>. Find if any of them should be kept
  1015. * and update our state accordingly. Once done, the list of commitments will
  1016. * be empty. */
  1017. void
  1018. sr_handle_received_commits(smartlist_t *commits, crypto_pk_t *voter_key)
  1019. {
  1020. char rsa_identity[DIGEST_LEN];
  1021. tor_assert(voter_key);
  1022. /* It's possible that the vote has _NO_ commits. */
  1023. if (commits == NULL) {
  1024. return;
  1025. }
  1026. /* Get the RSA identity fingerprint of this voter */
  1027. if (crypto_pk_get_digest(voter_key, rsa_identity) < 0) {
  1028. return;
  1029. }
  1030. SMARTLIST_FOREACH_BEGIN(commits, sr_commit_t *, commit) {
  1031. /* We won't need the commit in this list anymore, kept or not. */
  1032. SMARTLIST_DEL_CURRENT(commits, commit);
  1033. /* Check if this commit is valid and should be stored in our state. */
  1034. if (!should_keep_commit(commit, rsa_identity,
  1035. sr_state_get_phase())) {
  1036. sr_commit_free(commit);
  1037. continue;
  1038. }
  1039. /* Ok, we have a valid commit now that we are about to put in our state.
  1040. * so flag it valid from now on. */
  1041. commit->valid = 1;
  1042. /* Everything lines up: save this commit to state then! */
  1043. save_commit_to_state(commit);
  1044. } SMARTLIST_FOREACH_END(commit);
  1045. }
  1046. /* Return a heap-allocated string containing commits that should be put in
  1047. * the votes. It's the responsibility of the caller to free the string.
  1048. * This always return a valid string, either empty or with line(s). */
  1049. char *
  1050. sr_get_string_for_vote(void)
  1051. {
  1052. char *vote_str = NULL;
  1053. digestmap_t *state_commits;
  1054. smartlist_t *chunks = smartlist_new();
  1055. const or_options_t *options = get_options();
  1056. /* Are we participating in the protocol? */
  1057. if (!options->AuthDirSharedRandomness) {
  1058. goto end;
  1059. }
  1060. log_debug(LD_DIR, "SR: Preparing our vote info:");
  1061. /* First line, put in the vote the participation flag. */
  1062. {
  1063. char *sr_flag_line;
  1064. tor_asprintf(&sr_flag_line, "%s\n", sr_flag_ns_str);
  1065. smartlist_add(chunks, sr_flag_line);
  1066. }
  1067. /* In our vote we include every commitment in our permanent state. */
  1068. state_commits = sr_state_get_commits();
  1069. smartlist_t *state_commit_vote_lines = smartlist_new();
  1070. DIGESTMAP_FOREACH(state_commits, key, const sr_commit_t *, commit) {
  1071. char *line = get_vote_line_from_commit(commit, sr_state_get_phase());
  1072. smartlist_add(state_commit_vote_lines, line);
  1073. } DIGESTMAP_FOREACH_END;
  1074. /* Sort the commit strings by version (string, not numeric), algorithm,
  1075. * and fingerprint. This makes sure the commit lines in votes are in a
  1076. * recognisable, stable order. */
  1077. smartlist_sort_strings(state_commit_vote_lines);
  1078. /* Now add the sorted list of commits to the vote */
  1079. smartlist_add_all(chunks, state_commit_vote_lines);
  1080. smartlist_free(state_commit_vote_lines);
  1081. /* Add the SRV value(s) if any. */
  1082. {
  1083. char *srv_lines = get_ns_str_from_sr_values(sr_state_get_previous_srv(),
  1084. sr_state_get_current_srv());
  1085. if (srv_lines) {
  1086. smartlist_add(chunks, srv_lines);
  1087. }
  1088. }
  1089. end:
  1090. vote_str = smartlist_join_strings(chunks, "", 0, NULL);
  1091. SMARTLIST_FOREACH(chunks, char *, s, tor_free(s));
  1092. smartlist_free(chunks);
  1093. return vote_str;
  1094. }
  1095. /* Return a heap-allocated string that should be put in the consensus and
  1096. * contains the shared randomness values. It's the responsibility of the
  1097. * caller to free the string. NULL is returned if no SRV(s) available.
  1098. *
  1099. * This is called when a consensus (any flavor) is bring created thus it
  1100. * should NEVER change the state nor the state should be changed in between
  1101. * consensus creation.
  1102. *
  1103. * <b>num_srv_agreements</b> is taken from the votes thus the voted value
  1104. * that should be used.
  1105. * */
  1106. char *
  1107. sr_get_string_for_consensus(const smartlist_t *votes,
  1108. int32_t num_srv_agreements)
  1109. {
  1110. char *srv_str;
  1111. const or_options_t *options = get_options();
  1112. tor_assert(votes);
  1113. /* Not participating, avoid returning anything. */
  1114. if (!options->AuthDirSharedRandomness) {
  1115. log_info(LD_DIR, "SR: Support disabled (AuthDirSharedRandomness %d)",
  1116. options->AuthDirSharedRandomness);
  1117. goto end;
  1118. }
  1119. /* Set the global value of AuthDirNumSRVAgreements found in the votes. */
  1120. num_srv_agreements_from_vote = num_srv_agreements;
  1121. /* Check the votes and figure out if SRVs should be included in the final
  1122. * consensus. */
  1123. sr_srv_t *prev_srv = get_majority_srv_from_votes(votes, 0);
  1124. sr_srv_t *cur_srv = get_majority_srv_from_votes(votes, 1);
  1125. srv_str = get_ns_str_from_sr_values(prev_srv, cur_srv);
  1126. if (!srv_str) {
  1127. goto end;
  1128. }
  1129. return srv_str;
  1130. end:
  1131. return NULL;
  1132. }
  1133. /* We just computed a new <b>consensus</b>. Update our state with the SRVs
  1134. * from the consensus (might be NULL as well). Register the SRVs in our SR
  1135. * state and prepare for the upcoming protocol round. */
  1136. void
  1137. sr_act_post_consensus(const networkstatus_t *consensus)
  1138. {
  1139. const or_options_t *options = get_options();
  1140. /* Don't act if our state hasn't been initialized. We can be called during
  1141. * boot time when loading consensus from disk which is prior to the
  1142. * initialization of the SR subsystem. We also should not be doing
  1143. * anything if we are _not_ a directory authority and if we are a bridge
  1144. * authority. */
  1145. if (!sr_state_is_initialized() || !authdir_mode_v3(options) ||
  1146. authdir_mode_bridge(options)) {
  1147. return;
  1148. }
  1149. /* Set the majority voted SRVs in our state even if both are NULL. It
  1150. * doesn't matter this is what the majority has decided. Obviously, we can
  1151. * only do that if we have a consensus. */
  1152. if (consensus) {
  1153. /* Start by freeing the current SRVs since the SRVs we believed during
  1154. * voting do not really matter. Now that all the votes are in, we use the
  1155. * majority's opinion on which are the active SRVs. */
  1156. sr_state_clean_srvs();
  1157. /* Reset the fresh flag of the SRV so we know that from now on we don't
  1158. * have a new SRV to vote for. We just used the one from the consensus
  1159. * decided by the majority. */
  1160. sr_state_unset_fresh_srv();
  1161. /* Set the SR values from the given consensus. */
  1162. sr_state_set_previous_srv(srv_dup(consensus->sr_info.previous_srv));
  1163. sr_state_set_current_srv(srv_dup(consensus->sr_info.current_srv));
  1164. }
  1165. /* Prepare our state so that it's ready for the next voting period. */
  1166. {
  1167. voting_schedule_t *voting_schedule =
  1168. get_voting_schedule(options,time(NULL), LOG_NOTICE);
  1169. time_t interval_starts = voting_schedule->interval_starts;
  1170. sr_state_update(interval_starts);
  1171. voting_schedule_free(voting_schedule);
  1172. }
  1173. }
  1174. /* Initialize shared random subsystem. This MUST be called early in the boot
  1175. * process of tor. Return 0 on success else -1 on error. */
  1176. int
  1177. sr_init(int save_to_disk)
  1178. {
  1179. return sr_state_init(save_to_disk, 1);
  1180. }
  1181. /* Save our state to disk and cleanup everything. */
  1182. void
  1183. sr_save_and_cleanup(void)
  1184. {
  1185. sr_state_save();
  1186. sr_cleanup();
  1187. }
  1188. /* Return the current SRV string representation for the control port. Return a
  1189. * newly allocated string on success containing the value else "" if not found
  1190. * or if we don't have a valid consensus yet. */
  1191. char *
  1192. sr_get_current_for_control(void)
  1193. {
  1194. char *srv_str;
  1195. const networkstatus_t *c = networkstatus_get_latest_consensus();
  1196. if (c && c->sr_info.current_srv) {
  1197. srv_str = srv_to_control_string(c->sr_info.current_srv);
  1198. } else {
  1199. srv_str = tor_strdup("");
  1200. }
  1201. return srv_str;
  1202. }
  1203. /* Return the previous SRV string representation for the control port. Return
  1204. * a newly allocated string on success containing the value else "" if not
  1205. * found or if we don't have a valid consensus yet. */
  1206. char *
  1207. sr_get_previous_for_control(void)
  1208. {
  1209. char *srv_str;
  1210. const networkstatus_t *c = networkstatus_get_latest_consensus();
  1211. if (c && c->sr_info.previous_srv) {
  1212. srv_str = srv_to_control_string(c->sr_info.previous_srv);
  1213. } else {
  1214. srv_str = tor_strdup("");
  1215. }
  1216. return srv_str;
  1217. }
  1218. #ifdef TOR_UNIT_TESTS
  1219. /* Set the global value of number of SRV agreements so the test can play
  1220. * along by calling specific functions that don't parse the votes prior for
  1221. * the AuthDirNumSRVAgreements value. */
  1222. void
  1223. set_num_srv_agreements(int32_t value)
  1224. {
  1225. num_srv_agreements_from_vote = value;
  1226. }
  1227. #endif /* TOR_UNIT_TESTS */