检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]南京理工大学计算机科学与技术学院,南京210094
出 处:《计算机科学》2009年第5期51-55,71,共6页Computer Science
基 金:国家自然科学基金资助项目(90718021)资助
摘 要:传统的移动Ad Hoc网络匿名路由协议无法鉴别伪造的路由控制分组,并且公钥运算过多导致路由建立时间延长。提出一种基于邻居认证的安全匿名路由协议以解决上述问题,通过基于临时身份公钥的邻居匿名认证机制鉴定邻居节点合法性并动态协商密钥,路由发现过程中利用邻居协商密钥对路由控制消息进行逐跳的验证与处理。上述机制使得伪造路由分组可被有效鉴别,并且中间节点基于对称密钥运算处理分组降低了路由发现时延。理论分析和仿真结果表明,该协议可对抗基于伪造分组的DoS攻击,并且较传统协议具有更低的路由建立时间。In traditional anonymous routing protocols in mobile Ad Hoc networks, forged route control packets can't be distinguished and too many public key operations make the route construction delay too long. A new secure anonymous routing protocol based on neighborhood authentications was proposed to solve such problems. By anonymous neighborhood authentications using temporary identity-based public key, shared keys were established between legal neighboring nodes. In anonymous route discovery process, route control packets were hop-by-hop authenticated and hanlded. Such schemes ensure that the forged packets could be efficiently distinguished and nodes en route could handle route control packets by symmetric key operations which decrease the total route discovery delay. Theoretical analysis and simulation results show that this protocol can resist DoS attacks based on forged route control packets and has lower route construction delay than traditional ones.
关 键 词:网络安全 移动AD HOC网络 匿名路由 临时身份公钥 邻居匿名认证
分 类 号:TP309.7[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117