Secure Analysis for Interval-based Algorithms

V Ramakrishna, K Nithin Babu, M Kumar
unpublished
we consider several distributed 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: 1) distributed nature in which there is no centralized key server; 2) collaborative nature in which the group key is contributory (i.e., each group member will collaboratively contribute its part to the global group key); and 3) dynamic nature in which
more » ... existing members may leave the group while new members may join. Instead of performing individual rekeying operations, i.e., recomputing the group key after every join or leave request, we are going to re key for a batch of join and leave operations. The objectives of the project are to generate a group key.With the help of the group key sharing the resources like accessing the files and implement the Queue-batch algorithm, which performs the best among the three interval-based algorithms by comparing them. More importantly, to show that Queue-batch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment 1. INTRODUCTION The mainstay of the project is to collaboratively generate a common key for peer to peer group communication. To dynamically perform re-keying operation after batch of joins or leaves using Queue Batch algorithm and to share resources using the generated group key. The purpose of the proposed system is to provide the members of a group with secure common group key. This group key is generated collaboratively wherein each node becomes a part of the key generation. The distributive nature of the proposed system, avoids the usage of a centralized key server. The dynamic nature of the system allows the existing members to leave the group while new members can join, instead of performing individual rekeying operations. The system uses Queue-batch algorithm for re-keying. The algorithm can substantially reduce the computation and communication workload in a highly dynamic environment. The group key is used for future communication among the members of the group. Other than Queue-batch algorithm we have Rebuild algorithm and Batch algorithm .but the last two algorithms are not as effective as Queue-batch algorithm because Queue-batch works more efficient than the other algorithms at re-keying when no element leaves from the group. ,i.e, the element which is entered newly is kept in a Queue sub-tree phase and next the element is added to the group when an element leaves through Queue. In general the problems with the existing system are Key information depends on centralized key server and Computational and Communication cost is more.And when coming to re-keying , Individual re-keying is done Whenever a member joins or leaves in the case of
fatcat:oh7pjq6hrrgudnk6jm4rqlmb2e