International Research Journal of Engineering and Technology (IRJET) Volume: 04 Issue: 03 | Mar -2017
www.irjet.net
e-ISSN: 2395 -0056 p-ISSN: 2395-0072
DISTRIBUTIVE COLLABORATIVE KEY AGREEMENT PROTOCOL FOR DYNAMIC PEER GROUPS Chilla Sruthi1, Yarlagadda Sravani2, Gampa Ravi Kumar3, Laskey Babla4 , N Praveena5 1,2,3,4 IV/IV B Tech, 5Assistant
Professor, Department of Information Technology, 4th YEAR, VRSEC, Vijayawada, India
---------------------------------------------------------------------***---------------------------------------------------------------------
Abstract -
no need to worry but if the information contains sensitive data like country defense secrets, financial mechanisms, etc. then we cannot send the information without any security. If doesn’t take care of the security many kinds of attacks will take place such as, denial of service, spoofing, etc. The basic approaches for group key management include centralized, distributed and collaborative.
There are several distributive collaborative key
agreement protocols for dynamic peer groups. This problem has several important features that makes it different from existing group communication which are listed down as follows. Firstly, they are distributed in nature where there is no centralized key server, and they are collaborative in nature which means that each and every person in the group contributes their own part in generating the group key and finally dynamic in nature where existing members can leave the group and new members may join. We need a protocol that allows the members of the group to communicate in a risk freeway so that they can share private, confidential and vital information over the internet. Cryptography has become an important tool for protecting the important information. So, we use Diffie-Hellman key exchange to generate the group key to solve the problem. This is one of the most west known asymmetric algorithms but is restricted for two users. We use the concept of an extended Diffie-Hellman algorithm known as
A centralized group key management is the simplest way to generate and distribute keys among the group as it involves only single entity. Though it is very simple it involves some disadvantages, in this concept the central key server should always be available else the system may stop functioning due to the unresponsiveness from the server. Another problem is the collapse of the central key server, it maybe unrecognizable and leads to inactiveness of the group. Major problem arises when the channel used to distribute keys is attacked, the attacker can now know the keys and may perform any actions on the messages being sent leading insecure communication.
Tree-Based Diffie-Hellman algorithm to generate the group Key.
The distributed group key management is the best way when the channel of communication is unreliable. This method uses dynamic approach to select a key server at a particular time. While changing the server the data structures and other information need to be recreated or updated resulting in high computations.
Key Words: Distributive, Collaborative, Dynamic, Cryptography, Diffie – Hellman, group key
Collaborative group key management is a type where each group member contributes in generating the group key. Every member takes equal share and the final result is a common group key. This the best suitable concept for dynamic peer groups which avoids single point of trust and failure. Unlike other most group key distribution protocols, these offer strong key management security properties like key independence and perfect forward secrecy.
1. INTRODUCTION These days there is a vital growth in the need of group communication, but there is also a growing problem of communication privacy which requires some sort of protection. For such security there should be a common group key. The group members agree on the common key for secure communication. The nature of the group is dynamic where a member can join or leave the group at any time. The key is also distributed and contributory within the peers of the group.
2. LITERATURE SURVEY The Diffie-Hellman algorithm was first published in the year 1976 by Whitefield Diffie and Martin Hellman. This is the first scheme where two users agree on a common key for their communication. This algorithm uses arithmetic modules as the basis of its calculation. The key is very difficult to be acquired by the hacker. It gives most secure communication as it is very difficult to solve the discrete
If there is no group key for communication and if the communications are being done using broadcasts or some open mechanisms then there is a lot of risk coming forth. There will be attackers ready at all the time to loot the information. If the information is just a common greeting or information which is not of much importance then there is
© 2017, IRJET
|
Impact Factor value: 5.181
|
ISO 9001:2008 Certified Journal
|
Page 1