TY - GEN
T1 - A novel tree-based authenticated dynamic group key agreement protocol for wireless sensor network
AU - Hong, Tang
AU - Liehuang, Zhu
AU - Yuanda, Cao
AU - Dazhen, Wang
PY - 2008
Y1 - 2008
N2 - Group key agreement protocol allows all the members to agree upon a common session key, which may be used for later secure communication among all the participants. Since TGDH (tree based Diffie-Hellman) has been proposed by Yongdae Kim, Adrian Perrig, and Gene Tsudik, there are several group key agreement protocols proposed to improve the security and performance of TGDH. In this paper, we first propose authenticated two-party and three-party key agreement protocols based on bilinear pairing. Then, using authenticated two party or three party key agreement protocols to compute the key of a node which has two or three child nodes, we propose a novel tree-based authenticated group key agreement protocol. Our protocol provides implicit key authentication, which TGDH cannot provide. Through substituting ternary tree for binary and substituting bilinear pairing and ellipse curve DH for DH, our protocol is more efficient both in term of computation and communication than TGDH.
AB - Group key agreement protocol allows all the members to agree upon a common session key, which may be used for later secure communication among all the participants. Since TGDH (tree based Diffie-Hellman) has been proposed by Yongdae Kim, Adrian Perrig, and Gene Tsudik, there are several group key agreement protocols proposed to improve the security and performance of TGDH. In this paper, we first propose authenticated two-party and three-party key agreement protocols based on bilinear pairing. Then, using authenticated two party or three party key agreement protocols to compute the key of a node which has two or three child nodes, we propose a novel tree-based authenticated group key agreement protocol. Our protocol provides implicit key authentication, which TGDH cannot provide. Through substituting ternary tree for binary and substituting bilinear pairing and ellipse curve DH for DH, our protocol is more efficient both in term of computation and communication than TGDH.
UR - http://www.scopus.com/inward/record.url?scp=54049133292&partnerID=8YFLogxK
U2 - 10.1109/ISECS.2008.216
DO - 10.1109/ISECS.2008.216
M3 - Conference contribution
AN - SCOPUS:54049133292
SN - 9780769532585
T3 - Proceedings of the International Symposium on Electronic Commerce and Security, ISECS 2008
SP - 540
EP - 544
BT - Proceedings of the International Symposium on Electronic Commerce and Security, ISECS 2008
T2 - International Symposium on Electronic Commerce and Security, ISECS 2008
Y2 - 3 August 2008 through 5 August 2008
ER -