20-05-2011, 09:36 PM
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
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