Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Communication-efficient group key agreement
Sec '01 Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge
Tree-based group key agreement
ACM Transactions on Information and System Security (TISSEC)
Group Key Agreement Efficient in Communication
IEEE Transactions on Computers
A communication-computation efficient group key algorithm for large and dynamic groups
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
Several groupware applications such as distributed databases, video conferences, distributed computation etc require secure transmission while communicating over open connected networks, and for which numerous group key agreement protocols for static/dynamic groups have been proposed for establishing a secret session key among the group members. This paper proposes ternary tree based new technique to establish a contributory secure group key for dynamic groups, where a ternary tree has at most three children per node. The proposed technique instead of using two-party Diffie-Hellman technique as used in most of the binary tree based group-key generation techniques, uses an existing three party key exchange technique called GDH.2 to establish a shared secret key between the participants. The method provides some advantages over the existing binary tree based technique as it reduces the number of iterations to log3N, where N is the number of participants, covers larger subgroup using broadcast messages than subgroup formed in binary tree based approaches etc. As a result, the total number of broadcast messages and the exponential operations are reduced and it becomes a communication and computation efficient group key agreement protocol. Since proposed technique is projected for dynamic groups, therefore after initialization operation, the method describes and calculates the complexity of major group key management operations like single join, mass join and mass leave. The results obtained are then compared with other efficient group key agreement protocols like CCEGK, EGK, TGDH, STR and it has been seen that proposed method in most of the cases performs well.