[Paper Review] CAKE: An Efficient Group Key Management for Dynamic Groups

Peter Hillmann, Marcus Knüpfer+2 more|arXiv (Cornell University)|Feb 25, 2020

Security in Wireless Sensor Networks20 references4 citations

TL;DR

CAKE proposes a hybrid group key management protocol combining lightweight G-IKEv2 with a ternary key tree (CRT)-based key hierarchy to enable efficient, secure group communication in dynamic, resource-constrained environments like MANETs and IoT. It reduces network load to one message per group change and minimizes client-side computation, achieving low latency and backward/forward security with minimal key updates and communication overhead.

ABSTRACT

With rapid increase of mobile computing and wireless network linkage, the information exchange between connected systems and within groups increases heavily. Exchanging confidential information within groups via unsecured communication channels is a high security threat. In order to prevent third parties from accessing this data, it is essential to encrypt it. For this purpose, the group participants need a common group key to enable encrypted broadcast messages. But efficient key management of secured group communication is a challenging task, if participants rely on low performance hardware and small bandwidth. For coordination and distribution, we present the modular group key management procedure CAKE that is centrally organized and meets strict security requirements. The lightweight G-IKEv2 protocol in combination with the key exchange concept of CAKE leads to an efficiently integrated solution. The hybrid approach combines the advantages of the existing protocols with the objective to reduce the computation and communication effort. It is shown that the procedure is more suitable for changing MANET groups than the existing ones. Moreover, the exchanged group key can be used for any services which provides a wide range of applications.

Motivation & Objective

• Address the challenge of efficient, secure group key management in dynamic, resource-constrained networks such as MANETs, IoT, and WSNs.
• Reduce network overhead and computational cost during group rekeying due to frequent member joins and leaves.
• Achieve backward and forward security while minimizing the number of messages and cryptographic operations per group change.
• Integrate with standardized, secure protocols (G-IKEv2) to ensure compatibility and strong security guarantees.
• Optimize key distribution and update mechanisms to reduce energy and bandwidth usage in low-power, low-bandwidth environments.

Proposed method

• Utilizes a centralized Group-IKEv2 (G-IKEv2) protocol for initial key exchange and secure communication with a key server.
• Employs a Central Authorized Key Extension (CAKE) mechanism based on a ternary key tree (CRT) structure to organize cryptographic keys.
• Applies the Logical Key Hierarchy (LKH) concept with a novel addressing scheme to minimize key storage and transmission during rekeying.
• Uses a Secure Lock mechanism to compress encrypted group information into a single cipher, reducing per-packet overhead.
• Offloads complex cryptographic operations (e.g., key generation and encryption) to the group controller, reducing client-side load.
• Supports both standard G-IKEv2 rekeying for backward compatibility and optimized CAKE-specific rekeying for performance gains.

Experimental results

Research questions

• RQ1 How can group key management be made efficient in dynamic, resource-constrained environments like MANETs and IoT networks?
• RQ2 What is the impact of using a ternary key tree (CRT) on communication and computational overhead during group rekeying?
• RQ3 How does CAKE compare to the established Logical Key Hierarchy (LKH) in terms of network load, computation cost, and security guarantees?
• RQ4 Can the integration of G-IKEv2 with a novel key extension (CAKE) achieve both backward/forward security and minimal message overhead?
• RQ5 What trade-offs exist between network efficiency and computational cost in the proposed Lock MX mechanism for key compression?

Key findings

• CAKE reduces network load to a single message per group change (join or leave), significantly outperforming traditional LKH in dynamic environments.
• Client-side computation for group leave is reduced to a single modulo operation, achieving minimal delay and low calculation complexity.
• The use of a ternary key tree (CRT) reduces the number of keys stored and transmitted, minimizing key update overhead.
• Although CAKE increases client-side computational cost for creating the Lock MX, it scales similarly to LKH decryption in terms of performance.
• CAKE fulfills all key requirements: low data rate support, no 1-to-n effect, minimal key changes, low trust, and compatibility with G-IKEv2 standards.
• The protocol maintains strong security properties, including backward and forward security, due to integration with standardized G-IKEv2 and secure key distribution mechanisms.