Contributory Key Agreement in Groups: Quest for AuthenticationContributory Key Agreement • December 9th, 2006
We will look at two popular approaches to contributory group key agreement, Burmester-Desmedt and Group Diffie-Hellman protocols, and attempts to bundle im- plicit key authentication into the same package with them. Known attacks against some of these authenti- cated GKA protocols are presented to illustrate the dif- ficult nature of proving the security of a protocol. In these protocols authentication is brought to the proto- col with help of pre-shared passwords or authenticated auxiliary channels.
Contributory Key Agreement in Groups: Quest for AuthenticationContributory Key Agreement • November 7th, 2006
col. This protocol is presented for instance in [2] and there are Cliques variants that use this version instead of the unauthenticated GDH.2 for initial key agree- ment.
An Interval-based Contributory Key AgreementContributory Key Agreement • September 10th, 2011
Applications in Dynamic Peer Group are becoming in- creasing popular nowadays. There is a need for security services to provide group-oriented communication privacy and data integrity. It is important that members of the group can establish a common secret key for encrypting group communication. A secure distributed group key agreement and authentication protocol is required to han- dle this issue. A key tree approach has been proposed by other authors to distribute group key in such a way that the rekeying cost scales with the logarithm of the group size for a join or leave request. The efficiency of this key tree approach critically depends on whether the key tree remains balanced over time as members join or leave. Instead of performing individual re-keying operations, an interval-based approach of re-keying is adopted in the pro- posed scheme. The proposed interval based algorithms considered are Batch algorithm and the Queue-batch al- gorithm. The interval-based approach provides
