Posts: 742
Threads: 424
Joined: Jan 2010
The project implements the fundamental establishment of group key through distributed and collaborative approach for a dynamic peer group. The main function of the project is to provide secured communication through key authentication process. Three Interval Based Re-Keying algorithms are used to eliminate the individual re-keying approach in which re-computation of the key is performed after each joining and leaving of the member. The three interval based re-keying algorithms are 1. Rebuild Algorithm 2. Batch Algorithm 3. Queue-Batch Algorithm. The usage of these three interval based rekeying algorithm maintains the distributed nature in which there is no centralized key server and collaborative nature in which the key is generated in a contributory fashion. The interval based re-keying algorithms significantly out-performs the individual rekeying algorithm. Queue-Batch Algorithm performs the best among the three intervals based algorithms. More importantly, the Queue-Batch Algorithm substantially reduces the computation workload in a highly dynamic environment. The interval based re-keying algorithms concentrates on authentication, which focuses on security.
Posts: 18
Threads: 0
Joined: May 2011
plz send a full report to my email - fruit_ooi10[at]yahoo.com
Posts: 133
Threads: 62
Joined: May 2011
A Secure and Efficient Conference Key Distribution System
A practical interactive conference key distribution system based on public keys is presented in this article. Under the assumption that the Diffie-Hellman problem is intractable, the system is proven secure. The users are authenticated by the system and they can compute their own conference keys. The number of interactions required is independent of the number of users. The same amount of computation and communication is performed by all the users involved.
The secret keys must be distributed securely in order to communicate securely over insecure channels. If the keys are not distributed safely, the entire system is vulnerable even if the encryption algorithm used is computationally infeasible to break. the Diffie-Hellman key distribution system is the most popular among the ones that has been proposed for this purpose. This enables two users to compute a common key from a secret key and publicly exchanged information.But it has the drawback that it does not authenticate the users. a conference key distribution system is used when more than two users want to compute a common key.owing to the the complexity of the interactions between the many users, designing of such systems can be very challenging.
Get the report here:
http://cs.fsu.edu/~langley/Eurocrypt/euro-pre.pdf