基于双线性对的轻量级Ad Hoc网络匿名路由协议  

Lightweight protocol with anonymity for Ad Hoc network based on bilinear pairings

作　　者：梁钰敏[1] 曹天杰[1,2] 

机构地区：[1]中国矿业大学计算机科学与技术学院,江苏徐州221116 [2]信息安全国家重点实验室(中国科学院信息工程研究所),北京100049

出　　处：《计算机应用》2013年第12期3402-3405,3409,共5页journal of Computer Applications

基　　金：信息安全国家重点实验室开放基金资助项目(02-04-4)

摘　　要：为实现Ad Hoc网络节点的匿名性,一些匿名Ad Hoc网络协议被提出,但是这些协议中使用了大量的公钥计算,而公钥计算消耗了大量的时间和能量,这对于能量和计算能力均有限,同时移动速度很高的Ad Hoc网络节点很不适用。因此,提出一种新的轻量级的Ad Hoc网络匿名路由协议,在保证节点的一些安全特性以及匿名性的同时,更重要地是使用双线性对的算法进行密钥协商,很大程度地降低了计算时间,并减少了公钥的使用,从而提高了路由建立的效率。分析表明,与其他协议相比,所提协议更加高效。Lots of anonymous protocols for Ad Hoe network have been proposed to enforce the anonymity of the nodes in the network. However, most of the protocols utilize many asymmetric key computations which consume vast time and resources, thus, these protocols are not so suitable for those nodes in Ad Hoe network with limited power and poor computational ability. Hence, a new lightweight protocol with anonymity for Ad Hoc network was proposed. The new protocol ensured many security features and anonymity; most importantly, it employed bilinear pairings to realize the authenticated key exchange. Compared with other protocols, the proposed protocol is more efficient in routing construction by lowering the computing time to large extent and reducing the asymmetric key computation.

关 键 词：Ad HOC网络 匿名路由协议 双线性对 密钥交换 轻量级 

分 类 号：TP309[自动化与计算机技术—计算机系统结构] TP393[自动化与计算机技术—计算机科学与技术]