Building Group Key Establishment on Group Theory: A Modular Approach
Open Access
Abstract
A group key establishment protocol is presented and proven secure in the common reference string mode. The protocol builds on a group-theoretic assumption, and a concrete example can be obtained with a decision Diffie–Hellman assumption. The protocol is derived from a two-party solution by means of a protocol compiler presented by Abdalla et al. at TCC 2007, evidencing the possibility of meaningfully integrating cryptographic and group-theoretic tools in cryptographic protocol design. This compiler uses a standard ring configuration, where all users behave symmetrically, exchanging keys with their left and right neighbor, which are later combined to yield a shared group key.Keywords
Funding Information
- North Atlantic Treaty Organization (SPS G5448)
- Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España (MTM2016-77213-R.)
This publication has 23 references indexed in Scilit:
- Password–Authenticated Group Key Establishment from Smooth Projective Hash FunctionsInternational Journal of Applied Mathematics and Computer Science, 2019
- A Practical Cryptanalysis of the Algebraic Eraser2016
- A security weakness in Abdalla et al.’s generic construction of a group key exchange protocolInformation Sciences, 2011
- Secure group key establishment revisitedInternational Journal of Information Security, 2007
- Combinatorial Group Theory and Public Key CryptographyApplicable Algebra in Engineering, Communication and Computing, 2006
- A new key exchange protocol based on the decomposition problem2006
- Constructions in public-key cryptography over matrix groups2006
- Key agreement, the Algebraic Eraser^{𝑇𝑀}, and lightweight cryptography2006
- Thompson’s Group and Public Key Cryptography2005
- An algebraic method for public-key cryptographyMathematical Research Letters, 1999