News for hackers. Stuff that matters.
Re:Better Encrypted Group Chat by doomrobo on Thursday August 08, 2019 @11:31AM (#20645457)
Good point. I don't think it'd be unreasonable to promote everyone to their parent in this example.

One thing that I left out of the post is that the MLS ratchet tree has something called a "tree hash". Every node carries a hash digest, which is the hash of its two children. The root node's hash is used to derive a bunch of group-specific values, so it's important to keep this hash up to date. If you promote every member to their parent, this would require about N log(N) total hash operations, since every path from a leaf to the root would have to have its hashes recalculated.

N log(N) hashes seems like a small price to pay for optimizing a structure that determines how many ECDH operations you end up doing. I'll ask other MLS people about this and see if I'm missing something.

There are no comments on this comment yet.