Group Key Agreement Protocol Based on m-tree and DH Protocol

LV Jin-na · Jisuanji gongcheng · 2010

This paper proposes a group key agreement protocol based on m-tree and DH protocol to improve the poor scalability and efficiency of most group key agreement protocols in dynamic peer communication.Compared with TGDH,this protocol reduces the depth of key tree efficiently and computing costs of group key agreement by adopting m-tree.Compared with GDH,this protocol reduces communication costs of the group key agreement through layer-by-layer agreement.Communication and computing costs are balanced by variable m-tree,which makes a great progress in applications of LAN and WAN.

Read the paper · More papers on PaperTik