检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张凌浩 唐勇 邓东 刘洋洋 唐超 桂盛霖[2] ZHANG Linghao;TANG Yong;DENG Dong;LIU Yangyang;TANG Chao;GUI Shenglin(State Grid Sichuan Eletric Power Research Institute,Chengdu 610000;School of Computer Science and Engineering,University of Electronic Science and Technology of China,Chengdu 611731,China)
机构地区:[1]国网四川省电力公司电力科学研究院,成都610000 [2]电子科技大学计算机科学与工程学院,成都611731
出 处:《计算机科学》2023年第5期363-371,共9页Computer Science
基 金:国家自然科学基金(61401067);四川省科技重大专项(2018GZDZX0009);国网四川省电力公司科技项目(52199719001F)。
摘 要:认证和秘钥协商协议是解决无线传感器网络中设备安全通信的主流方法,而目前主流的无线传感器网络秘钥协商协议考虑的场景为对等节点之间的认证和协商,存在计算量高、通信效率低的问题。针对以上问题,提出了适用于异构无线传感器网络中的认证与秘钥管理协议,通信终端节点(L节点)双方首先与各自所在簇的管理节点(H节点)协商会话秘钥,若未通过身份认证,则拒绝L节点接入网络,解决了大多数协议缺少应对拒绝服务攻击的问题;然后借助通信路径所经过的H节点转发会话秘钥协商信息,完成通信双方端到端的会话秘钥协商,使得协议具有安全网关和访问控制的能力。该协议还支持对被捕获节点的节点注销,并减少对其他通信链路安全性的影响。基于求解椭圆曲线上的离散对数问题和Diffie-Hellman问题的困难性假设,在随机预言机模型中证明了该方案可以满足前向安全、抗秘钥泄露伪装攻击、未知秘钥共享安全、无秘钥托管、已知秘钥安全等更完整的安全属性,与已有文献相比,所提协议在应对拒绝服务攻击上具有最低的计算开销,整体计算量和通信量适中。Authentication and key agreement protocol is the mainstream method to solve the secure communication of devices in wireless sensor networks.For the current mainstream secret key agreement protocol in wireless sensor networks,the scenario considered is authentication and agreement between peer nodes,which has the problems of high computation and low communication efficiency.To solve the above problems,this paper proposes an authentication and secret key management protocol suitable for heterogeneous wireless sensor networks.Both communication terminal nodes(L node)first establish the session secret key with the management node(H node)of their respective cluster.If they fail to pass the identity authentication,the L node will be denied access to the network,which solves the problem that most protocols lack to deal with denial of service attacks.Then,with the help of the H node through which the communication path passes,the session key agreement information is forwarded to complete the end-to-end session key agreement between the communication parties,so that the protocol has the abilities of security gateway and access control.The protocol also supports the revocation of the captured node and reduces the impact on the security of other communication links.Based on the difficult assumption of solving the discrete logarithm problem and Diffie Hellman problem on elliptic curve,it is proved in the random oracle model that the scheme can meet more complete security attributes such as forward security,anti secret key leakage camouflage attack,unknown secret key sharing security,no secret key escrow,known secret key security and so on.Compared with the existing literature,the protocol has the lowest computational overhead in dealing with denial of service attack,and the overall amount of computation and communication is moderate.
分 类 号:TN918.91[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.202