DISTRIBUTED COLLABORATIVE KEY AGREEMENT AND AUTHENTICATION PROTOCOL FOR DYNAMIC PEER GROUPS

DISTRIBUTED COLLABORATIVE KEY AGREEMENT AND AUTHENTICATION PROTOCOL FOR DYNAMIC PEER GROUPS

                                                                                                               

     ABSTRACT

                        We consider several collaborative key agreement and authentication protocols for dynamic peer groups. There are several important characteristics which make this problem different from traditional secure group communication; they are distributed nature in which there is no centralized key server .collaborative nature in which the group key is contributory.                                                 Dynamic nature in which existing members may leave the group while new members may join. Instead of performing individual rekeying operations, i.e. recomposing the group key after join or leave request, we discuss an interval-based approach of rekeying algorithm named Queue-batch algorithm.

                        We further enhance the algorithm in two aspects: authentication and implementation. Authentication focuses on the security improvement while implementation realizes the interval-based in real network settings.

EXISTING SYSTEM

                        The existing system involves either centralized key server (in which all the systems depend on centralized server for key generation), and individual rekeying is done for join or leave operations in case of distributive key generation algorithms.

                         In case of individual re-keying, after every join or leave operation each member individually rekeys’. More resources are used for re-keying because it is done for each join or leave operations. In case of using a centralized server, the risk of single point failure is more.

DRAWBACKS OF EXISTING SYSTEM

•         Key information depends on centralized key server.

•         Computational and Communication cost is more.

•         Individual re-keying is done. Whenever a member joins or leaves in the case of distributed key generation algorithm.

•         More resources used for re-keying because it is done for each join or leave operations.

PROPOSED SYSTEM

                              The proposed system involves collaborative key agreement in which all nodes become a part of the secure group key. Moreover, rekeying is done after a batch of join or leave operations.

                              The protocol remains efficient even when the occurrences of join/leave events are very frequent. Here key information does not depend on centralized key server. So it is free from the problem of single point failure.

                               Computational and communication cost is less. Resources used for rekeying is minimized because it is being done for batch of join/leave operations.