A SECURE AND EFFICIENT KEY DISTRIBUTION SYSTEM

AIM To provide security through key authentication

process To provide communication privacy in a dynamic

peer group. Communication-without centralized server

ABSTRACT Tree Based Group Diffie-Helman Protocol Establishment of group key. Interval Based Re-keying algorithms Maintains distributive and collaborative feature. Concentrates on authentication – security.

INTRODUCTION Emergence of group oriented applications. Need for security. Cryptography -Authentication. Key agreement- peer network.

EXISTING SYSTEM

Individual RekeyingLimitation

• Server Overload.• A Single point of failure.• Cost is more.

COMMUNICATION

A1 A2 B3B2B1A3 SERVER A SERVER B

LAN A LAN B

COMMUNICATES

PROBLEM DEFINITION Secured communication. Communication in a peer to peer network. Secure Collaborative distributed group key agreement.

LITERATURE SURVEY Michel Steiner - Authenticated Group Key

Agreement.• Two party key authentication.

Yang Richard Yang, “ Rekeying for Secure Group Communications”.

• Key Graph Approach

S.Seita and S.Jajodia, “Kronos”: A Re-keying approach for secure multicast.

• Intra Domain Key Management Protocol

PROPOSED SYSTEM

Secured communication- Peer Groups.Binary Tree. Interval Based Rekeying Approach-Join, Leave.

Rebuild Algorithm

Batch AlgorithmQueue Batch Algorithm.

COMMUNICATION

PEERGROUP

A

PEERGROUP

B

A3 B2

S

B3

B1

S

A1

A2

A3

B1A3SERVER

ROOT

SPONSOR

QUEUE BATCH ALGORITHM

Rekeying at regular intervals. Reduces the latency and workload. Improved Efficiency. Two stages:

• Queue - Sub tree.• Queue Merge.

QUEUE BATCH ALGORITHMEXAMPLE

0

21

0

M1 M2

2

4 6

7

1

53

8 11 12M3

M4 M5

M6

23 24

M7

M8, M9, M10 joinM2, M7 leave

3 6

8M1(S)

3 6

13 14

M8 M9

T’

27 28M10(S)

ANALYSIS Tree based Group Diffie-Hellman Protocol. Group key authentication. SOFTWARE REQUIREMENTS:

• Operating System : Windows XP Professional.ss• Environment : Visual Studio .Net 2003.• .Net Framework : Version 1.0.• Language : Visual Basic. Net.• Backend : SQL Server 2000.

Features:• Common Language Runtime (CLR)• Supports Pop up of individual dialog box.• Multithreading, Garbage collection, Structured Exception Handling.

DESIGNARCHITECTURE DIAGRAM

New MemberKey

Generation

Rekeying

Member Leaves

Queue BatchAlgorithm

ExistingMembers

DataExchange

loginPrime

number

Resources

Released

join leave

communication

DATA FLOW DIAGRAM

LEVEL 0

Members

Login

Group keyShared Key

Sign In

Username & password

Private key

Public key

LEVEL1 (JOIN)

User Join Request

Find Join Position

GenerateKeys

UpdateTree

Tree Structure

Tree Structure

Distribute Keys

LEVEL1(LEAVE)

Leave Request

Process Request

RemoveThe

Member

GenerateKeys

UpdateTree

Tree Structure

Tree StructureDistributeKeys

LEVEL 2Members

Sign In

Home Page

OtherGroup

Members

Upload Files

Group Members

Group, PrivatePublic Keys

IMPLEMENTAION Modules:

• Key Generation-Diffie Hellman Protocol.• Rekeying- Join, Leave• Sharing The Resources-

IMPLEMENTATION (CONTD…)

A B

M1 C M2 M3

M4 M5

ROOT

TESTING Unit Testing Integration Testing. Validation Testing. Security Testing.

CONCLUSION Key agreement -Without centralized server. Tree Based Group Diffie-Hellman Protocol achieves

Distributive and Collaborative key agreement. Queue-Batch Algorithm reduces computation and

communication cost.

FUTURE ENHANCEMENT Communication using Secret Keys. Use alternate for TGDH.

REFERENCES Y.Amir, Y.Kim, C.Nita-Rotaru, “ Secure group Communication using

robust contributory key agreement”, May 2009. S.Blake-Wilson and A.Menezees, “ Authenticated Diffie-Hellman Key

Agreement protocols”,2007. M.Burmester and Y.Desmedt, “ A secure efficient conference key

distribution system”,2007. S.Setia, S.Koussiti, “Kronos: A scalable group rekeying approach for

secure multicast”, May 2000.

SCREEN SHOTSSERVER

CLIENT-SERVER CONNECTION

FIRST MEMBER JOINS

SECOND MEMBER JOINS

BINARY TREE

FILE UPLOADED

FILE DOWNLOADED

MEMBER LEAVES

THANK YOU