SoK: Game-Based Security Models for Group Key Exchange
Poettering B, Rösler P, Schwenk J, Stebila D (2021)
Publication Type: Conference contribution
Publication year: 2021
Journal
Publisher: Springer Science and Business Media Deutschland GmbH
Book Volume: 12704 LNCS
Pages Range: 148-176
Conference Proceedings Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Event location: Online
ISBN: 9783030755386
DOI: 10.1007/978-3-030-75539-3_7
Abstract
Group key exchange (GKE) protocols let a group of users jointly establish fresh and secure key material. Many flavors of GKE have been proposed, differentiated by, among others, whether group membership is static or dynamic, whether a single key or a continuous stream of keys is established, and whether security is provided in the presence of state corruptions (forward and post-compromise security). In all cases, an indispensable ingredient to the rigorous analysis of a candidate solution is a corresponding formal security model. We observe, however, that most GKE-related publications are more focused on building new constructions that have more functionality or are more efficient than prior proposals, while leaving the job of identifying and working out the details of adequate security models a subordinate task. In this systematization of knowledge we bring the formal modeling of GKE security to the fore by revisiting the intuitive goals of GKE, critically evaluating how these goals are reflected (or not) in the established models, and how they would be best considered in new models. We classify and compare characteristics of a large selection of game-based GKE models that appear in the academic literature, including those proposed for GKE with post-compromise security. We observe a range of shortcomings in some of the studied models, such as dependencies on overly restrictive syntactical constrains, unrealistic adversarial capabilities, or simply incomplete definitions. Our systematization enables us to identify a coherent suite of desirable characteristics that we believe should be represented in all general purpose GKE models. To demonstrate the feasibility of covering all these desirable characteristics simultaneously in one concise definition, we conclude with proposing a new generic reference model for GKE.
Authors with CRIS profile
Involved external institutions
Ruhr-Universität Bochum (RUB)
Germany (DE)
IBM Zurich Research Laboratory
Switzerland (CH)
Technische Universität Darmstadt
Germany (DE)
University of Waterloo (UW)
Canada (CA)
Germany (DE)
IBM Zurich Research Laboratory
Switzerland (CH)
Technische Universität Darmstadt
Germany (DE)
University of Waterloo (UW)
Canada (CA)
How to cite
APA:
Poettering, B., Rösler, P., Schwenk, J., & Stebila, D. (2021). SoK: Game-Based Security Models for Group Key Exchange. In Kenneth G. Paterson (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 148-176). Online: Springer Science and Business Media Deutschland GmbH.
MLA:
Poettering, Bertram, et al. "SoK: Game-Based Security Models for Group Key Exchange." Proceedings of the Cryptographer's Track at the RSA Conference, CT-RSA 2021, Online Ed. Kenneth G. Paterson, Springer Science and Business Media Deutschland GmbH, 2021. 148-176.
BibTeX: Download