Welcome to the resource topic for 2025/1035
Title:
Continuous Group-Key Agreement: Concurrent Updates without Pruning
Authors: Benedikt Auerbach, Miguel Cueto Noval, Boran Erol, Krzysztof Pietrzak
Abstract:Continuous Group Key Agreement (CGKA) is the primitive underlying secure group messaging.
It allows a large group of N users to maintain a shared secret key that is frequently rotated by the group members in order to achieve forward secrecy and post compromise security.
The group messaging scheme Messaging Layer Security (MLS) standardized by the IETF makes use of a CGKA called TreeKEM which arranges the N group members in a binary tree.
Here, each node is associated with a public-key,
each user is assigned one of the leaves,
and a user knows the corresponding secret keys from their leaf to the root.
To update the key material known to them, a user must just replace keys at \log(N) nodes, which requires them to create and upload \log(N) ciphertexts. Such updates must be processed sequentially by all users, which for large groups is impractical.
To allow for concurrent updates, TreeKEM uses the ``propose and commit’’ paradigm, where multiple users can concurrently propose to update (by just sampling a fresh leaf key), and a single user can then commit to all proposals at once.
Unfortunately, this process destroys the binary tree structure as the tree gets pruned and some nodes must be ``blanked’’ at the cost of increasing the in-degree of others, which makes the commit operation, as well as, future commits more costly.
In the worst case, the update cost (in terms of uploaded ciphertexts) per user can grow from \log(N) to \Omega(N).
In this work we provide two main contributions.
First, we show that MLS’ communication complexity is bad not only in the worst case but also if the proposers and committers are chosen at random:
even if there’s just one update proposal for every commit the expected cost is already over \sqrt{N}, and it approaches N as this ratio changes towards more proposals.
Our second contribution is a new variant of propose and commit for TreeKEM which for moderate amounts of update proposals per commit provably achieves an update cost of \Theta(\log(N)) assuming the proposers and committers are chosen at random.
ePrint: https://eprint.iacr.org/2025/1035
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .