An Efficient Protocol for Authenticated Group Key Agreement in Heterogeneous Networks
With the advent of wireless and ubiquitous computing, group communication in heterogeneous environment is gaining popularity. Although a number of protocols for group key agreement exist in the literature, most of them are not applicable in heterogeneous environment where a number of computationally limited nodes coexist with one or more computationally efficient nodes. Among the few existing protocols, where some fail to satisfy the key agreement properties, some are unable to handle the agreement for dynamic group. In this work, we propose a constant round group key agreement protocol for heterogeneous environment using polynomial interpolation. The protocol ensures both communication and computation efficiency by shifting the major computation load on powerful users, achieves true contributory key agreement property and dynamic handling of user join and leave. The security of the protocol has been analyzed under formal model. The comparison result shows considerable improvement in protocol efficiency compared to the existing ones.
KeywordsGroup key agreement Heterogeneous network Resource-constrained environment Hierarchical key agreement Provable security
Unable to display preview. Download preview PDF.
- 3.Becker, K., Wille, U.: Communication complexity of group key distribution. In: 5th ACM Conf. on Computer and Communications Security, pp. 1–6 (1998)Google Scholar
- 6.Bresson, E., Chevassut, O., Pointcheval, D., Quisquater, J.: Provably authenticated group diffie-hellman key exchange. In: 8th ACM Conf. on Computer and Communications Security, pp. 255–264 (2001)Google Scholar