This is a project to hold a secure and authorised communication and data sharing between server and client.
Recently, Bertino et al. proposed a new time-bound key management scheme for broadcasting. The security of their scheme is planted on the hardness breaking of elliptic curve discrete log problem, HMAC, and tamper-resistance devices. They claimed that as long as the three assumptions hold, their scheme is secure. By means of secure, users cannot access resources that they are not granted, even if users collude. In this paper, we demonstrate that this scheme is insecure against the collusion attack. We also provide some possible amendments to this scheme.
The existing system involves centralized key server in which all the systems depend on centralized key server for key generation. All the members depend on the centralized key server for key generation. Re keying, which means renewing the keys associated with the nodes of the key tree, is performed whenever there is any group membership change including any new member joining or any existing member leaving the group.
This individual re keying operation increases the computation and communication cost. More resources have been utilized by the server in case of multiple join and leave of members in the group. For every individual re keying operation which is happening for single join and leave operation all the group members depends on the centralized key server for group key generation.
&#61558; A single point of failure; and
&#61558; Not suitable for peer groups and ad hoc networks
The proposed system involves collaborative key agreement in which all nodes become a part of the group key. The group key is generated which is common for all the members in the group. The communication in the group is done with the help of the group key. The members can communicate with other members such as sending files to other members with the help of the group key. Instead of performing individual re keying operations, i.e., re computing the group key after every join or leave request, we are going to re key for a batch of join operations. Moreover, re keying is done after a batch of join or leave operations. We consider interval-based distributed re-keying algorithms, or interval-based algorithms for short, for updating the group key:
These interval-based algorithms significantly outperform the individual re-keying approach and that the Queue-batch algorithm performs the best among the three interval-based algorithms. More importantly, the Queue-batch algorithm can substantially reduce the computation and communication workload in a highly dynamic environment. The re keying operation for multiple join members in to the group is done using Queue-batch algorithm.
The protocol remains efficient even when the occurrences of join/leave events are very frequent. Here Key information does not depend on centralized key server. The key is generated by the members in the group.
PROCESSOR : PENTIUM III 866 MHz
RAM : 256 MB DD RAM
MONITOR : 15” COLOR
HARD DISK : 40 GB
FLOPPY DRIVE : 1.44 MB
CDDRIVE : LG 52X
KEYBOARD : STANDARD 102 KEYS
MOUSE : 3 BUTTONS
OPERATING SYSTEM : WINDOWS XP PROFESSIONAL
ENVIRONMENT : VISUAL STUDIO .NET 2005
.NET FRAMEWORK : VERSION 1.0
LANGUAGE : VISUAL [url removed, login to view]
BACKEND : SQL-SERVER 2000