New Efficient and Authenticated Key Agreement Protocol in Dynamic Peer Group

Author

Zeng, Shengke ; He, Mingxing ; Luo, Weidong

Author_Institution

Sch. of Math. & Comput. Eng., Xihua Univ., Chengdu

fYear

2008

Firstpage

746

Lastpage

751

Abstract

The members in the dynamic peer group (DPG) are divided into several clusters according to linker cluster architecture (J.B. Dennis and E. Anthony, 1981). In each cluster, the members perform the BD protocol (M. Burmester and Y. Desmedt, 1994) to establish the cluster key and the TGDH protocol (Y. Kim et al., 2004) is performed among the clusters to generate the group key. This method can not only avoid the weakness of AKA (auxiliary key agreement) of BD, but also reduce the computation cost of TGDH scheme. In our scheme the members have been authenticated based identity, and we prove the security in random oracle model.

Keywords

cryptographic protocols; message authentication; peer-to-peer computing; BD protocol; TGDH protocol; authenticated key agreement protocol; auxiliary key agreement; dynamic peer group; linker cluster architecture; random oracle model; Availability; Clustering algorithms; Computational efficiency; Computer security; Helium; Mathematics; Peer to peer computing; Protocols; Random number generation; Synchronous digital hierarchy; Dynamic Peer Group; ID-Based Signature; Key Agreement; Provable Security; Random Oracle Model.;

fLanguage

English

Publisher

ieee

Conference_Titel

Availability, Reliability and Security, 2008. ARES 08. Third International Conference on

Conference_Location

Barcelona

Print_ISBN

978-0-7695-3102-1

Type

conf

DOI

10.1109/ARES.2008.60

Filename

4529418