International Research Journal of Engineering and Technology (IRJET)
e-ISSN: 2395 -0056
Volume: 04 Issue: 04 | Apr -2017
p-ISSN: 2395-0072
www.irjet.net
Group Key Agreement with Local Connectivity 1PROF.
HARISH BARAPATRE, 2MANSI NAIK, 3BHAGYASHRI KURLE, 4PRATIBHA
1234Yadavrao
GHADAGE
Tasgaonkar Institute Of Engineering And Technology 1234Dept.
Of Computer Engineering
---------------------------------------------------------------------***---------------------------------------------------------------------
Abstract - In computer networks security and secrecy in communication is must. For data transformation, transactions and other various operations need to be Carrie out securely. Group key agreement is an agreement which provides the security in communication of two persons. In social networking it is not possible always to communicate directly with the unknown person. It includes the any third one to communicate through. Group key agreement provides the mechanism in which two users can communicate with each other without intruption or without includeing any third person.In group key agreement mechanism a special key that is called session key is generated. This key is used for the communication.
1.1 EXISTING SYSTEM
1. INTRODUCTION
2. PROPOSED SYSTEM
Group Key agreement is a process of assigning a unique key for communication. In this paper, we studied that on social networks mostly it is not possible to communicate with unknown person directly. Group key agreement provides the mechanism where any two unknown person can communicate directly. For example on social sites their are groups of people communicate together. But it is not necessary that each and every person in a group well knows each other. Assume their are persons A, B and C. Person A and B are good friends. Person C is a friend of A but B wants to communicate C. So to get the authority to communicate with C , B must have to go through A. Then the communication between them can possible. But in Group Key Agreement mechanism the directly communication between B and C can possible. To make this possible we are using the theory of diffie hellman algorithm. Diffie Hellman algorithm provides the key exchange mechanism for communication. Group key agreement is surly more effective for the social networks. We are using passively secure protocol to construct an actively secure protocol. Which is round efficient.
A key-agreement protocol is a protocol where one user is only aware of his neighbors. Two or more parties can agree on a key in such a way that both influence the outcome. If properly done, this precludes undesired third parties from forcing a key choice on the agreeing parties. Sender generates key and sends it to receiver. The connection made between is actively secure protocol using passively secure protocol. Protocols that are useful in practice also do not reveal to any eavesdropping party what key has been agreed upon. public-key agreement protocol that meets the above criteria was the Diffie–Hellman key exchange, in which two parties jointly exponentiation a generator with random numbers, in such a way that an eavesdropper cannot feasibly determine what the resultant value used to produce a shared key is. Exponential key exchange in and of itself does not specify any prior agreement or subsequent authentication between the participants. It has thus been described as an anonymous key agreement protocol.
© 2017, IRJET
|
Impact Factor value: 5.181
In social networking there are many applications which provide the data connectivity, communication, file transfer, sharing, uploading and many other operations. But sometimes there are problems in communication between two unknown authorities. Most of the systems does not support to the direct connectivity of unknown authorities’ for communication or data transfer. However the one person is neighbor of another person who cannot get access with their neighbors directly. So sometimes it makes problem connectivity. So this can be helped with the group key agreement to make it possible.
|
ISO 9001:2008 Certified Journal
|
Page 450