[Cryptech Tech] Tor consensus use case

Linus Nordberg linus at nordberg.se
Thu Jan 29 13:40:35 UTC 2015


Joachim Strömbergson <joachim at secworks.se> wrote
Thu, 29 Jan 2015 14:28:12 +0100:

| Aloha!
| 
| Linus Nordberg wrote:
| > Tor status votes are signed once per hour using an authority signing
| > key [0]. Status votes are verified ~10 times per hour (by directory
| > authorities, which is what we care about for this use case).
| >
| > The outcome of the voting, a consensus status ("the consensus"), is
| > signed once per hour as well. Consensus statuses are verified ~10
| > times per hour.
| >
| > The digest algorithm used is SHA1 or SHA256. The signing algorithm is
| > RSA. The key size is 2048-4096.
| 
| So the required number of active private keys to be handled (including
| storage) by the machine is one?

Yes.


| And from a single machine there would be 2 sign operations/s and 10
| verification operations/s.

2 sign and 20 verification operations per _hour_.


| From how many nodes generating inbound status messages can a node
| receive and thus need to have public keys for? (If I understand the use
| case.)

10.


Totally forgot to tell you about number of keys. Thanks.


More information about the Tech mailing list