For Project Enquiry +91 9791 044 044

Group Key Agreement with Local Connectivity

ABSTRACT

We constructed two passively secure protocols with contributiveness and proved lower bounds on a round complexity, demonstrating that our protocols are round efficient. Finally, we constructed an actively secure protocol from a passively secure one. In our work, we did not consider how to update the group key more efficiently than just running the protocol again, when user memberships are changing. We are not clear how to do this. One can either propose algorithms to our current protocols.

EXISTING SYSTEM	PROPOSED SYSTEM
EXISTING SYSTEM:- 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.	PROPOSED SYSTEM:- ·                      We constructed an actively secure protocol from a passively secure one. In our work, we did not consider how to update the group key more efficiently than just running the protocol again, when user memberships are changing.
EXISTING ALGORITHM :- Encryption algorithm	PROPOSED ALGORITHM :- Key Generation and Encryption algorithm.
ALGORITHM   DEFINITION:- To improve upon the scalability of the above solutions, one-to-many encryption methods such as ABE can be used.	ALGORITHM DEFINITION:- In a ciphertext policy attribute-based encryption scheme, each user’s private key is associated with a set of attributes representing their capabilities,
DRAWBACKS:- Secure data sharing among a group that counters insider threats of legitimate yet malicious users is an important research issue.	ADVANTAGES:- We implement a working prototype of the SeDaSC methodology and evaluate its performance based on the time consumed during various operations.      .