Abstract
A robust group key
agreement protocol (GKA) allows a set of players to establish a shared secret
key, regardless of network/node
failures. Current constant-round GKA protocols are either efficient and
nonrobust or robust but not efficient; assuming a reliable broadcast
communication medium, the standard encryption-based group key agreement
protocol can be robust against arbitrary number of node faults, but the size of
the messages broadcast by every player is proportional to the number of
players. In contrast, nonrobust group key agreement can be achieved with each
player broadcasting just constant-sized messages. We propose a novel 2-round
group key agreement protocol, which tolerates up to T node failures, using
OðTÞ-sized messages for any T. We show that the new protocol implies a
fully-robust group key agreement with logarithmic-sized messages and expected
round complexity close to 2, assuming random node faults. The protocol can be
extended to withstand malicious insiders at small constant factor
increases in bandwidth and computation. The proposed
protocol is secure under the (standard) Decisional Square Diffie-Hellman assumption.
Requirement
Analysis:
System Requirements:-
Ø Language : Java1.5
Ø Front
End : Java Swing
Ø Back
End : SQL Server 2000
Ø Operating
System : Windows XP.
Hardware Requirements:-
Ø Hard
disk : 60GB
Ø RAM :
1GB
No comments:
Post a Comment