03-12-2012, 02:08 PM
Efficient key Agreement for Large and Dynamic Multicast Groups (IEEE)
ABSTRACT
Secure multicast represents the core component of many web and multimedia applications such
as pay-TV, teleconferencing, real-time distribution of stock market price and etc. The main
challenge for secure multicast is scalability, efficiency and authenticity. In this project, we
propose a scalable, efficient, authenticated group key agreement scheme for large and dynamic
multicast systems. The proposed key agreement scheme is identity-based which uses the
bilinear map over the elliptic curves. Compared with the previously published schemes, our
scheme provides group member authenticity without imposing extra mechanism. Furthermore,
we give a scalability solution based on the subgroups, which has advantages over the existing
schemes. Security analysis shows that our scheme satisfies both forward secrecy and backward
secrecy.
Existing System:
In the Existing system we use Iolus approach proposed the notion of hierarchy subgroup for
scalable and secure multicast. In this method, a large communication group is divided into
smaller subgroups. Each subgroup is treated almost like a separate multicast group and is
managed by a trusted group security intermediary (GSI). GSI connect between the subgroups
and share the subgroup key with each of their subgroup members. GSIs act as message relays
and key translators between the subgroups by receiving the multicast messages from one
subgroup, decrypting them and then re multicasting them to the next subgroup after encrypting
Proposed System:
The advantages over the existing system are, we use an identity tree instead of key tree in our
scheme. Each node in the identity tree is associated with an identity. The leaf node’s identity is
corresponding to the user’s identity and the intermediate node’s identity is generated by its
children’s identity. Hence, in an identity tree, an intermediate node represents set users in the
sub tree rooted at this node.
In our scheme, even though a subgroup controller fails, it does not affect its subgroup.
Because every user in the subgroup can act as the subgroup group controller.
The keys used in each subgroup can be generated by a group of key generation centers (KGCs)
in parallel. All the members in the same subgroup can compute the same subgroup key though
the keys for them are generated by different KGCs. This is a desirable feature especially for the
large-scale network systems, because it minimizes the problem of concentrating the workload
on a single entity.