Secure Group Key Agreement Algorithm for Mobile Adhoc NetworksSecure Group Key Agreement Algorithm • March 29th, 2019
ABSTRACT: Social network plays a major role these days amongst users. Social network is a concept to connect people and to share personal details with their closest ones and these applications supporting group activities. Key agreement is suitable for the ad-hoc network because it does not need a TTP (Trusted Third Party). Group key agreement time means the time spent to share a group key between all members. To reduce the time, the tree-based key agreement method has been proposed and many protocols use this idea. We propose a group key agreement algorithm where the group members have different capabilities. This protocol has the goal of reducing the group key agreement time. We propose to gain a shorter group key agreement time by substituting the Generalization Diffie- Hellman (GDH) key agreement computations with Arbitrary Topological computations using symmetric key. A Secure hash algorithm provides a framework for offering the services needed to supply security over a network.
