An efficient tree-based group key agreement using bilinear map

Cited 21 time in webofscience Cited 0 time in scopus
  • Hit : 383
  • Download : 0
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 BERLIN
Issue Date
2003
Language
English
Article Type
Article; Proceedings Paper
Keywords

CRYPTOSYSTEMS; PROTOCOL; WEIL

Citation

APPLIED CRYPTOGRAPHY AND NETWORK SECURITY, PROCEEDINGS BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.2846, pp.357 - 371

ISSN
0302-9743
URI
http://hdl.handle.net/10203/85345
Appears in Collection
EE-Journal Papers(저널논문)CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 21 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0