How To Get Group Key Efficiently In Mobile Ad Hoc Networks?

2015 IEEE MILITARY COMMUNICATIONS CONFERENCE (MILCOM 2015)(2015)

引用 3|浏览4
暂无评分
摘要
Securing Group communications in mobile ad-hoc networks (MANETs) continues attracting researchers' attentions due to its importance in many critical applications. Yet, the nature lacking a key management center makes it a challenge in terms of group key management problem in MANETs. Although recent advances in certificateless public key cryptography (CL-PKC) shed light on lightweight group key management issues, most of them depend on the bilinear pairing during their operations, which were not suitable for resource constrained nodes in MANETs due to the heavy computation overhead. This paper proposes a Huffman-tree-based pairing free authenticated certificateless group key agreement protocol (HPF-CLGKA) to establishing the group key efficiently. Neither pairing operation nor the signature for authentication is used during the protocol execution, which will cut down the computation overheads greatly. Moreover, the Huffman key tree further minimizes the negotiation rounds and therefore reduces computation and communication costs. Through these measures, group key establishment and rekeying efficiencies are greatly improved.
更多
查看译文
关键词
MANETs,Certificateless public key cryptography,Group key agreement,Huffman key tree
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要