Trade-off between collusion resistance and user life cycle in self-healing key distributions with t-revocation

Abstract

Abstract-We solve the problem of resisting the collusion attack in the one-way hash chain based self-healing key distributions introduced by Dutta et al., coupling it with the prearranged life cycle based approach of Tian et al. that uses the same self-healing mechanism introduced in Dutta et al. Highly efficient schemes are developed compared to the existing works with the trade-off in pre-arranged life cycles on users by the group manager and a slight increase in the storage overhead. For scalability of business it is often necessary to design more innovation and flexible business strategies in certain business models that allow contractual subscription or rental, such as subscription of mobile connection or TV channel for a pre-defined period. The subscribers are not allowed to revoke before their contract periods (life cycles) are over. Our schemes fit into such business environment. The proposed schemes are proven to be computationally secure and resist collusion between new joined users and revoked users together with forward and backward secrecy. The security proof is in an appropriate security model. Moreover, our schemes do not forbid revoked users from rejoining in later sessions unlike the existing selfhealing key distribution schemes. Index Terms-session key distribution, self-healing, revocation, wireless networks, access structure, computational security, forward and backward secrecy.

Improved One-Way Hash Chain and Revocation Polynomial-Based Self-Healing Group Key Distribution Schemes in Resource-Constrained Wireless Networks

“…In [ 17 – 19 ], the pre-arranged life cycle-based SGKD schemes were proposed to make those HC-SGKD schemes resist to the collusion attack. However, these schemes can only apply to the scenario in which the user's life cycle is pre-determined, and the collusion of revoked users within the life cycles and new joined users can recover unauthorized session keys.…”

Access‐polynomial‐based self‐healing group key distribution scheme for resource‐constrained wireless networks

“…In this scheme, users use the secret sharing to bind the user's capability of recovering lost session keys to the user's membership, but this scheme has high overheads of storage and communication. Then, based on the work in , several improved self‐healing key management schemes have been proposed .…”

“…However, Dutta et al pointed out that although these schemes guarantee forward and backward secrecy, they cannot resist to the collusion attack in which revoked users colluding with newly joined users access unauthorized information of session keys (see for the definition of this kind of collusion attack). In , the pre‐arranged life cycle‐based group key management schemes were proposed to make those hash chain‐based schemes resist to collusion attack. The GM assigns a pre‐arranged life cycle to each user in the setup phase, and the user cannot be revoked within the life cycle.…”