A concrete treatment of efficient continuous group key agreement via multi-recipient PKEs
Continuous group key agreements (CGKAs) are a class of protocols that can provide strong security guarantees to secure group messaging protocols such as Signal and MLS. Protection against device compromise is provided by commit messages: at a regular rate, each group member may refresh their key material by uploading a commit message, which is then downloaded and processed by all the other members. In practice, propagating commit messages dominates the bandwidth consumption of existing CGKAs. We propose Chained CmPKE, a CGKA with an asymmetric bandwidth cost: in a group of N members, a commit message costs O(N) to upload and O(1) to download, for a total bandwidth cost of O(N). In contrast, TreeKEM costs (log N) in both directions, for a total cost (N log N). Our protocol relies on generic primitives, and is therefore readily post-quantum. We go one step further and propose post-quantum primitives that are tailored to \Chained CmPKE, which allows us to cut the growth rate of uploaded commit messages by two or three orders of magnitude compared to naive instantiations. Finally, we realize a software implementation of Chained CmPKE. Our experiments show that even for groups with a size as large as N = 2^10, commit messages can be computed and processed in less than 100 ms.
|, , ,|
|PQShield SAS, Paris, France , Cloudflare, Amsterdam, The Netherlands|
|27th ACM Annual Conference on Computer and Communication Security, CCS 2021|
|Organisation||Centrum Wiskunde & Informatica, Amsterdam (CWI), The Netherlands|
Hashimoto, K, Katsumata, S, Postlethwaite, E.W, Prest, T, & Westerbaan, B. (2021). A concrete treatment of efficient continuous group key agreement via multi-recipient PKEs. In Proceedings of the ACM Conference on Computer and Communications Security (pp. 1441–1462). doi:10.1145/3460120.3484817