Exponential Arithmetic Based Self-Healing Group Key Distribution Scheme with Backward Secrecy under the Resource-Constrained Wireless Networks

Hua Guo, Yandong Zheng, Xiyong Zhang, Zhoujun Li2016 · DOI

TL;DR

This paper introduces a novel self-healing group key distribution (SGKD) scheme for resource-constrained wireless networks that achieves backward secrecy, a crucial security property often missing in existing schemes. By employing a dual-chain mechanism and a unique approach to personal secrets, their scheme offers optimal storage and efficient communication, making it well-suited for devices like ZigBee sensors.

What Problem Does This Paper Address?

In wireless sensor networks (WSNs), devices are often battery-powered and have limited storage and communication bandwidth. Secure communication is vital, especially in applications like emergency response or military operations. Group key distribution (GKD) is essential for encrypting and authenticating communications among multiple nodes. However, WSNs are prone to packet loss, and nodes can join or leave the network dynamically. Traditional GKD schemes struggle with these challenges.

Self-healing GKD (SGKD) schemes aim to address these issues by allowing group members to recover lost session keys without constant retransmission from a group manager (GM). This reduces communication overhead and manager burden. While various SGKD schemes exist (polynomial-based, vector space, bilinear pairings, and exponential arithmetic-based), many suffer from either high storage/communication costs or a lack of backward secrecy. Backward secrecy is critical because it prevents newly joined members from accessing past communication, a common vulnerability in existing schemes where personal secrets are static. This paper specifically targets the limitations of existing Exponential Arithmetic-based SGKD (E-SGKD) schemes, which offer good storage efficiency but often lack backward secrecy.

Methods

The authors propose a novel E-SGKD scheme built upon a basic E-SGKD construction. The core innovations are:

  • Backward Secrecy Mechanism: To achieve backward secrecy, each user's personal secret is bound to a session-specific identifier ($\epsilon_j$). Instead of a static secret $S_i = f(i)$, users receive $S_i = \epsilon_j \cdot f(i)$, where $f(i)$ is a polynomial based on the user's identity and $\epsilon_j$ is a random value for session $j$. This prevents new users from recovering past session keys using their current secrets.
  • Dual Chains for Self-Healing: To maintain efficient self-healing while incorporating backward secrecy, the scheme uses two chains:
  • Hash Chain: A traditional hash chain is used for efficient message sealing.
  • Key Chain: A new key chain is introduced to further reduce communication overhead. These dual chains work together to help active group users compute lost session keys, minimizing the number of broadcast messages.

  • Revocation Polynomials: The scheme constructs revocation polynomials to identify and exclude revoked users, ensuring they cannot access current or future session keys.

  • Optimal Storage: The scheme achieves constant storage overhead, requiring only one element in a finite field ($F_p$) per user, which is optimal.

The scheme comprises standard SGKD procedures: Setup, Broadcast, SessionKeyRecovery, GroupMemberAddition, and GroupMemberRevocation.

Datasets

Not discussed in the paper. The evaluation is based on theoretical analysis and simulations.

Key Insights and Ideas

  • Backward Secrecy is Achievable with Constant Storage: The paper demonstrates that backward secrecy, a critical security feature, can be achieved in E-SGKD schemes without sacrificing the optimal constant storage overhead. This is a significant improvement over prior E-SGKD schemes.
  • Dual Chains for Efficient Self-Healing: The introduction of a dual hash and key chain mechanism is a clever way to balance the need for robust self-healing with the constraint of minimizing communication overhead.
  • Practicality for Resource-Constrained Networks: The proposed scheme's efficiency in terms of storage and communication makes it highly suitable for devices like ZigBee sensors, which have severe resource limitations.
  • Flexibility in Parameter Selection: The paper shows that the scheme's performance is adaptable to different network conditions by adjusting parameters like the number of sessions ($m$) and the degree of the polynomial ($t$), allowing for a trade-off between security and efficiency.

Key Results

  • Security Properties: The proposed E-SGKD scheme is proven to satisfy:
  • Self-healing property.
  • $m$-revocation capability.
  • $m$-wise forward secrecy.
  • Any-wise backward secrecy.
  • $m$-wise collusion attack resistance.
  • Storage Overhead: Optimal constant storage overhead (log$_2 p$).
  • Communication Overhead: Significantly reduced compared to previous E-SGKD schemes, especially when the number of sessions with new users joining ($v$) is small.
  • Practicality in ZigBee: Simulations show that the scheme is practical for ZigBee networks, where broadcast packet sizes are limited, outperforming existing E-SGKD schemes. For instance, with a 4 KB broadcast limit, their scheme with $v = [0.2m]$ can accommodate larger $m$ and $t$ values than other schemes.

Limitations and Future Work

  • Parameter Selection: While the paper discusses parameter selection for ZigBee networks, further research could explore optimal parameter choices for a wider range of resource-constrained environments.
  • Performance in Real-World Deployments: The current evaluation is based on simulations. Future work could involve implementing and testing the scheme on actual hardware to validate its performance under real-world network conditions.
  • Scalability for Very Large Groups: While the scheme is efficient, its scalability for extremely large groups might warrant further investigation.

The authors suggest that their proposed dual-chain mechanism and backward secrecy approach can be applied to convert other polynomial-based SGKD schemes into secure E-SGKD schemes. They also highlight the scheme's applicability to SCADA systems in smart grids, demonstrating its broad potential.

Summary updated

BibTeX
@misc{guo2016exponential,
  author = {Hua Guo and Yandong Zheng and Xiyong Zhang and Zhoujun Li},
  title = {{Exponential Arithmetic Based Self-Healing Group Key Distribution Scheme with Backward Secrecy under the Resource-Constrained Wireless Networks}},
  year = {2016},
  doi = {10.3390/s16050609},
}
Figure