Date of Publication :7th May 2015

Abstract: Key management is the management of cryptographic keys in a cryptosystem. This includes dealing with the key generation, exchange, storage, use, and replacement of keys. Several schemes have been proposed to make key management efficient and usable. This paper proposes a centralized group key management with minimal computation complexity to support dynamic secure multicast communication. In this scheme, a Chinese remainder theorem-based group key management scheme that drastically reduces computation complexity of the key server. The computation complexity of key server is reduced to O (1) in this proposed algorithm. Moreover, the computation complexity of group member is also minimized by performing one modulo division operation when a user join or leave operation is performed in a multicast group. The keys generated in the network are securely exchanged with the help of ElGamal algorithm. This paper solves the most security problem by user registration and verification phases in the multicast network. The security of ElGamal is based on the discrete logarithm problem. To encrypt and respectively decrypt a message, a discrete power is executed. An attacker that seeks to decrypt an intercepted message may try to recover the private key. To this end a logarithm needs to be computed. No actual method exists for this, given certain requirements on the initial group are met. Under these circumstances, the encryption is secure.

Reference :