一种基于轻量级哈希链的IoT网络多节点相互认证算法

Shengli Yuan, Randy Phan-Huynh
{"title":"一种基于轻量级哈希链的IoT网络多节点相互认证算法","authors":"Shengli Yuan, Randy Phan-Huynh","doi":"10.1109/FNWF55208.2022.00021","DOIUrl":null,"url":null,"abstract":"As an emerging technology, IoT is rapidly revolutionizing the global communication network with billions of new devices deployed and connected with each other. Many of these devices collect and transfer a large amount of sensitive or mission critical data, making security a top priority. Compared to traditional Internet, IoT networks often operate in open and harsh environment, and may experience frequent delays, traffic loss and attacks; Meanwhile, IoT devices are often severally constrained in computational power, storage space, network bandwidth, and power supply, which prevent them from deploying traditional security schemes. Authentication is an important security mechanism that can be used to identify devices or users. Due to resource constrains of IoT networks, it is highly desirable for the authentication scheme to be lightweight while also being highly effective. In this paper, we developed and evaluated a hash-chain-based multi-node mutual authentication algorithm. Nodes on a network all share a common secret key and broadcast to other nodes in range. Each node may also add to the hash chain and rebroadcast, which will be used to authenticate all nodes in the network. This algorithm has a linear running time and complexity of $O(n)$, a significant improvement from the $O(n^{2})$ running time and complexity of the traditional pairwise multi-node mutual authentication.","PeriodicalId":300165,"journal":{"name":"2022 IEEE Future Networks World Forum (FNWF)","volume":"37 22","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Lightweight Hash-Chain-Based Multi-Node Mutual Authentication Algorithm for IoT Networks\",\"authors\":\"Shengli Yuan, Randy Phan-Huynh\",\"doi\":\"10.1109/FNWF55208.2022.00021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As an emerging technology, IoT is rapidly revolutionizing the global communication network with billions of new devices deployed and connected with each other. Many of these devices collect and transfer a large amount of sensitive or mission critical data, making security a top priority. Compared to traditional Internet, IoT networks often operate in open and harsh environment, and may experience frequent delays, traffic loss and attacks; Meanwhile, IoT devices are often severally constrained in computational power, storage space, network bandwidth, and power supply, which prevent them from deploying traditional security schemes. Authentication is an important security mechanism that can be used to identify devices or users. Due to resource constrains of IoT networks, it is highly desirable for the authentication scheme to be lightweight while also being highly effective. In this paper, we developed and evaluated a hash-chain-based multi-node mutual authentication algorithm. Nodes on a network all share a common secret key and broadcast to other nodes in range. Each node may also add to the hash chain and rebroadcast, which will be used to authenticate all nodes in the network. This algorithm has a linear running time and complexity of $O(n)$, a significant improvement from the $O(n^{2})$ running time and complexity of the traditional pairwise multi-node mutual authentication.\",\"PeriodicalId\":300165,\"journal\":{\"name\":\"2022 IEEE Future Networks World Forum (FNWF)\",\"volume\":\"37 22\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE Future Networks World Forum (FNWF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FNWF55208.2022.00021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Future Networks World Forum (FNWF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FNWF55208.2022.00021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

作为一项新兴技术,物联网正在迅速改变全球通信网络,数十亿台新设备被部署并相互连接。许多此类设备收集和传输大量敏感或关键任务数据,因此安全性是重中之重。与传统互联网相比,物联网网络往往运行在开放、恶劣的环境中,可能会出现频繁的时延、流量丢失和攻击;同时,物联网设备通常在计算能力、存储空间、网络带宽和电源等方面受到一定的限制,这使得它们无法部署传统的安全方案。身份验证是一种重要的安全机制,可以用来识别设备或用户。由于物联网网络的资源限制,非常希望认证方案既轻便又高效。在本文中,我们开发并评估了一种基于哈希链的多节点相互认证算法。网络上的节点都共享一个公共密钥,并向范围内的其他节点广播。每个节点也可以添加到哈希链中并重新广播,这将用于验证网络中的所有节点。该算法线性运行时间为$O(n)$,复杂度为$O(n^{2})$,较传统的两两多节点相互认证的$O(n^{2})$运行时间和复杂度有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Lightweight Hash-Chain-Based Multi-Node Mutual Authentication Algorithm for IoT Networks
As an emerging technology, IoT is rapidly revolutionizing the global communication network with billions of new devices deployed and connected with each other. Many of these devices collect and transfer a large amount of sensitive or mission critical data, making security a top priority. Compared to traditional Internet, IoT networks often operate in open and harsh environment, and may experience frequent delays, traffic loss and attacks; Meanwhile, IoT devices are often severally constrained in computational power, storage space, network bandwidth, and power supply, which prevent them from deploying traditional security schemes. Authentication is an important security mechanism that can be used to identify devices or users. Due to resource constrains of IoT networks, it is highly desirable for the authentication scheme to be lightweight while also being highly effective. In this paper, we developed and evaluated a hash-chain-based multi-node mutual authentication algorithm. Nodes on a network all share a common secret key and broadcast to other nodes in range. Each node may also add to the hash chain and rebroadcast, which will be used to authenticate all nodes in the network. This algorithm has a linear running time and complexity of $O(n)$, a significant improvement from the $O(n^{2})$ running time and complexity of the traditional pairwise multi-node mutual authentication.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
SliceSecure: Impact and Detection of DoS/DDoS Attacks on 5G Network Slices A Score Function Heuristic for Crosstalk- and Fragmentation-Aware Dynamic Routing, Modulation, Core, and Spectrum Allocation in SDM-EONs Machine Learning Aided Design of Sub-Array MIMO Antennas for CubeSats Based on 3D Printed Metallic Ridge Gap Waveguides A Supra-Disciplinary Open Framework of Knowledge to Address the Future Challenges of a Network of Feelings Resource Allocation with Vickrey-Dutch Auctioning Game for C-RAN Fronthaul
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1