An Efficient Tree-based Group Key Agreement using Bilinear Map

Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challenges is to design secure and efficient group key management. While centralized management is often appropriate for key distribution in large multicast-style groups, many collaborative group settings require distributed key agreement. The communication and computation cost is one of important factors in the group key management for Dynamic Peer Group. In this paper, we extend TGDH (Tree-based Group Diffie-Hellman) protocol to improve the computational efficiency by utilizing pairing-based cryptography. The resulting protocol reduces computational cost of TGDH protocol without degrading the communication complexity.
Publisher
Springer Verlag (Germany)
Issue Date
2003
Keywords

Group key agreement; TGDH; Bilinear Diffie-Hellman; Bilinear map; Pairings

Citation

Lecture Notes in Computer Science, Vol.2846, pp.357-371

ISBN
978-3-540-20208-0
ISSN
0302-9743
DOI
10.1007/b13996
URI
http://hdl.handle.net/10203/15954
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
26.pdf(386.45 kB)Download
  • Hit : 140
  • Download : 134
  • Cited 0 times in thomson ci

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0