Secure And Efficient Rekeying Distribution for Dynamic Peer Groups

Secure And Efficient Rekeying Distribution for Dynamic Peer Groups:

Secure And Efficient Rekeying Distribution for Dynamic Peer Groups

Outline:

Outline Identify the motivations of group key agreement and its requirements. Introduce Tree-Based Group Diffie-Hellman (TGDH) , which uses a key tree to arrange all the keys. Propose three interval-based rekeying algorithms : Rebuild , Batch and Queue-batch . Illustrate experimental results.

Motivations:

Motivations Many group-oriented and distributed applications require security services. Example: a closed and confidential business meeting in a p2p network. We therefore need a secure distributed group key agreement scheme so that the group can encrypt their communication data with a common secret group key.

OBJECTIVES:

OBJECTIVES The objectives of the project are to implement the interval-based algorithms which significantly outperform the individual rekeying approach and show that the Queue-batch algorithm performs the best among the three interval-based algorithms by comparing them. More importantly, to show that Queue-batch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment.

EXISTING SYSTEM :

EXISTING SYSTEM The existing system involves either centralized key server (in which all the systems depend on centralized server for key generation), or individual rekeying is done for join or leave operations in case of distributive key generation algorithms.

Slide 6:

Drawbacks: Key information depends on centralized key server. Computational and Communication cost is more. More resources used for rekeying because it is being done for individual join/leave operation.

PROPOSED SYSTEM:

PROPOSED SYSTEM The proposed system involves collaborative key agreement in which all nodes become a part of the secure group key. Moreover, rekeying is done after a batch of join or leave operations.

Slide 8:

Advantages: Key information does not depend on centralized key server. Computational and Communication cost is less. Resources used for rekeying is minimized because it is being done for batch of join/leave operations.

Modules:

Modules Modules used in the project: Group Key Generation within the workgroup Rekeying the group key when a new member joins the workgroup Rekeying the group key when a member leaves the workgroup Sharing data within the workgroup

Group Key Generation within the workgroup:

Group Key Generation within the workgroup The nodes in the workgroup will form a group key. Each group member will collaboratively contribute its part to the global group key. The group key is generated in a shared and contributory fashion and there is no single-point-of-failure.

2) Re keying the group key when a new member joins the workgroup:

2) Re keying the group key when a new member joins the workgroup To provide backward confidentiality (i.e., joined members cannot access previous communication data) we are rekeying the group key which means renewing the keys associated with the nodes of the key tree, this is performed whenever there is any group membership change including any new member joins the group. Rekeying means a new group key will be generated by members in the work group

3) Rekeying the group key when a member leaves the workgroup:

3) Rekeying the group key when a member leaves the workgroup To provide forward confidentiality (i.e. left members cannot access future communication data), we are rekeying the group key which means renewing the keys associated with the nodes of the key tree, this is performed whenever there is any group membership change including any existing member leaving the group. Rekeying means a new group key will be generated by members in the work group

4) Sharing data within the workgroup:

4) Sharing data within the workgroup With the help of group key generated by the members in the workgroup, the data will be transferred securely among the workgroup. Communication of data between group members is not susceptible to eavesdropping .

Group Key Generation :

Group Key Generation Random Prime No. Member1 Private Key Member2 Private Key Member1 Public Key Member2 Public Key Encryption Group Key

ReBuild Alogorithm:

ReBuild Alogorithm Intuition: Minimize the final tree height so that the number of rekeying operations of every member is reduced. Basic Idea : Reconstruct the whole key tree to form a complete tree. We can explore under which workload Rebuild is good

Batch Algorithm:

Batch Algorithm Based on the centralized batch rekeying approach Basic Idea : add the joins to suitable nodes: Replace the leave nodes with the join nodes. Attach the join nodes to the shallowest positions. Keep the key tree balanced

Queue Batch Algorithm:

Queue Batch Algorithm Intuition : The previous approaches perform rekeying at the start of every rekey interval, leading to a heavy processing workload at the update instance. Reduce the load by pre-processing the join events during the idle rekey interval Two stages: Queue-subtree and Queue-merge . Queue-subtree : Within the idle rekey interval, form a subtree T’ with all joining members, just like individual rekeying for a single join event. Queue-merge : At the beginning of the next rekey interval, prune all departed leaf nodes if any and add the subtree T’ to the highest leave position (or attach T’ to the shallowest position). Elect the sponsors who can help broadcast the new blinded keys.

Requirement Specification:

Requirement Specification Software Requirements: L anguage : Dot Net F ront End Tool : VB. Net Back End Tool : SQL Server Operating System: Windows 98. Hardware Requirements: Processor : Intel Pentium III Processor Random Memory : 128MB Hard Disk: 20GB Processor Speed: 300 min