Authenticated Tree Based Group Key Agreement

Author

Jiang, Weijia ; Li, Jiguo

Author_Institution

Coll. of Comput. & Inf. Eng., Hohai Univ., Nanjing, China

Volume

2

fYear

2009

fDate

11-14 Dec. 2009

Firstpage

251

Lastpage

255

Abstract

Secure and reliable group communication is an active area of research. Its popularity is caused by the growing importance of group-oriented and collaborative applications. The central research challenge is secure and efficient group key management. In this paper, we present a provably secure authenticated tree based key agreement protocol ASTR (authenticated STR). The protocol is obtained by combining Paterson´s digital signature scheme with STR key agreement protocol which is an unauthenticated protocol based Diffie-Hellman key agreement protocol. The security of ASTR can be reducible to 2-party decision Diffie-Hellman (DDH) problem.

Keywords

digital signatures; protocols; 2-party decision Diffie-Hellman problem; Diffie-Hellman key agreement protocol; Paterson digital signature scheme; authenticated STR; authenticated tree based group key agreement; authenticated tree based key agreement protocol; group communication security; group-oriented application; Communication system control; Computational intelligence; Computer security; Cryptographic protocols; Digital signatures; Educational institutions; Identity-based encryption; Information security; Public key cryptography; Reliability engineering; authenticated tree; digital signature; group key agreement; provably secure;

fLanguage

English

Publisher

ieee

Conference_Titel

Computational Intelligence and Security, 2009. CIS '09. International Conference on

Conference_Location

Beijing

Print_ISBN

978-1-4244-5411-2

Type

conf

DOI

10.1109/CIS.2009.90

Filename

5376055