Group Key Agreement with Local Connectivity

ABSTRACT:

In this paper, we study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary. In our problem, there is no centralized initialization for users. A group key agreement with these features is very suitable for social networks. Under our setting, we construct two efficient protocols with passive security. We obtain lower bounds on the round complexity for this type of protocol, which demonstrates that our constructions are round efficient. Finally, we construct an actively secure protocol from a passively secure one.

AIM

The aim of this paper is study a group key agreement problem where a user is only aware of his neighbors while the connectivity graph is arbitrary.

SCOPE

The Scope of this paper is to construct an actively secure protocol from a passively secure one.

EXISTING SYSTEM

Key pre-distribution system (KPS) (a.k.a. non-interactive conference distribution system) can be regarded as a non-interactive group key agreement. In this case, the shared key of a given group is fixed after the setup. If a group is updated, then the group key changes to the shared key of the new group. The drawback of KPS is that the user key size is combinatorial large in the total number of users (if the system is unconditionally secure). Another drawback is that the group key of a given group cannot be changed even if it is leaked unexpectedly (e.g., cryptanalysis of cipher texts bearing this key). The key size problem may be overcome if a computationally secure system is used, while the key leakage problem is not easy. Further, computationally secure KPS is only known for the two party case and the three-party case KPS with a group size greater than 3 is still open

DISADVANTAGES:

1. The user key size is combinatorial large  in the total number of users (if the system is unconditionally secure).
2. The group key of a given group can not be changed even if it is leaked unexpectedly

PROPOSED SYSTEM

The group key agreement with an arbitrary connectivity graph, where each user is only aware of his neighbors and has no information about the existence of other users. Further, he has no information about the network topology. Under this setting, a user does not need to trust a user who is not his neighbor. Thus, if one is initialized using PKI, then he need not trust or remember public-keys of users beyond his neighbors

 ADVANTAGES

1. To update the group key more efficiently than just running the protocol again, when user memberships are changing.
2. Two passively secure protocols with contributiveness and proved lower bounds on a round complexity, demonstrating that our protocols are round efficient

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·                Processor          -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board                 -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System      : Windows  7                                     

·                Front End                  : ASP.NET and C#

·                Database                   : MSSQL

·                Tool                           :Visual Studio

REFERENCE:

Jiang, S “Group Key Agreement with Local Connectivity” IEEE Transactions on Dependable and Secure Computing  Volume PP   Issue 99 FEBRUARY 2015.