Search your topic in Java2share
Home > Projects > IEEE
eXTReMe Tracker

Distributed Collaborative Key Agreement and Authentication Protocols for Dynamic Peer Groups


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 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 discuss an interval-based approach of rekeying.We consider three interval-based distributed rekeying algorithms, or interval-based algorithms for short, for updating the group key: 1) the Rebuild algorithm; 2) the Batch algorithm; and 3) the Queue-batch algorithm. Performance of these three interval-based algorithms under different settings, such as different join and leave probabilities, is analyzed. We show that the interval-based algorithms significantly outperform the individual rekeying approach and that the Queue-batch algorithm performs the best among the three interval-based algorithms. More importantly, the Queue-batch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment. We further enhance the interval-based algorithms in two aspects: authentication and implementation. Authentication focuses on the security improvement, while implementation realizes the interval-based algorithms in real network settings. Our work provides a fundamental understanding about establishing a group key via a distributed and collaborative approach for a dynamic peer group

Existing Systems:

           In order to enhance the performance of content distribution networks (CDNs), several approaches have been developed based on the use of data adaptation and content management services provided by intermediary proxies. In most of these approaches, content caching is the main service provided by proxies.

Proposed Systems:

Our approach also assures data confidentiality during transmission. It highlights load distribution through P-proxies to improve system performance and supports parallel content services. Because no modification is required to current content distribution systems in order to adopt our approach, our work is easy to deploy for many applications. In addition, our approach is extensible; if a new type of content service is required, our architecture can be easily adapted to the new requirement.

System Requirement Specification
Software Interface

  • JDK 1.5
  • Java Swing
  • SQL Server

Hardware Interface

  • PROCESSOR        :            PENTIUM IV 2.6 GHz
  • RAM                :        512 MB DD RAM
  • MONITOR     :        15” COLOR
  • HARD DISK         :  40 GB
  • KEYBOARD         :  STANDARD 102 KEYS
  • MOUSE            :        3 BUTTON

For Explanation/Installation of above project by our expert faculty please register here

  Name:    *
  Mobile No:    *
  E-Mail:    *
  Preferred Time:   
  Preferred Date:   

* Fields are Mandatory