Abstract: Current schemes on group key management arc almost based on GDH (Group key Management Based on Diffie-Hellman)protocol,and their sub tree in key tree is limit To solve the ctuestion,this paper put forwards a new scheme based on bilinear pairing (BPGKM) , which increases the children of node in key tree from two to three. Therefore, this scheme supports larger networks on the premise of protecting the network security, whose efficiency is better than current schemes with reducing half of computations on key.

Key words: Group key management, Bilinear pairing, Shared key, Security, Efficiency