一种用于物联网网络安全数据传输的增强线性同态网络编码签名方案

IF 8 1区 计算机科学 Q1 COMPUTER SCIENCE, THEORY & METHODS
Hao Huang;Xiaofen Wang;Man Ho Au;Sheng Cao;Qinglin Zhao;Jiguo Yu
{"title":"一种用于物联网网络安全数据传输的增强线性同态网络编码签名方案","authors":"Hao Huang;Xiaofen Wang;Man Ho Au;Sheng Cao;Qinglin Zhao;Jiguo Yu","doi":"10.1109/TIFS.2025.3563074","DOIUrl":null,"url":null,"abstract":"Recently, Li et al. proposed an identity-based linearly homomorphic network coding signature (IB-HNCS) scheme for secure data delivery in Internet of Things (IoT) networks, and they claimed that the IB-HNCS scheme can resist pollution attacks. However, this paper shows that the IB-HNCS scheme is vulnerable to pollution attacks, as anyone who only has the public parameter can forge a new file identifier or a valid signature on a corrupted data packet to pollute legitimate sensor data. To enhance security and performance in network coding-based IoT networks, we propose a secure and efficient certificateless linearly homomorphic network coding signature scheme for IoT data delivery, which is free of burdensome certificate management and key escrow issue. In addition, our scheme is proved to be secure against adaptive chosen identity and adaptive chosen subspace attacks under two types of adversaries in the algebraic group model and random oracle model. Therefore, our scheme can verify the validity of data packets and allow data packets to be computed, so as to resist pollution attacks. The performance evaluation demonstrates that our scheme is more efficient and practical than existing secure schemes. Specifically, for a 73-dimensional data vector, the costs of signature generation and verification in our scheme are reduced by 38.588%-86.076% and 38.570%-85.664% respectively under the symmetric bilinear pairing setting, and the costs of signature generation and verification in our scheme are reduced by 17.740%-49.752% and 29.697%-58.645% respectively under the asymmetric bilinear pairing setting.","PeriodicalId":13492,"journal":{"name":"IEEE Transactions on Information Forensics and Security","volume":"20 ","pages":"5534-5548"},"PeriodicalIF":8.0000,"publicationDate":"2025-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Enhanced Linearly Homomorphic Network Coding Signature Scheme for Secure Data Delivery in IoT Networks\",\"authors\":\"Hao Huang;Xiaofen Wang;Man Ho Au;Sheng Cao;Qinglin Zhao;Jiguo Yu\",\"doi\":\"10.1109/TIFS.2025.3563074\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, Li et al. proposed an identity-based linearly homomorphic network coding signature (IB-HNCS) scheme for secure data delivery in Internet of Things (IoT) networks, and they claimed that the IB-HNCS scheme can resist pollution attacks. However, this paper shows that the IB-HNCS scheme is vulnerable to pollution attacks, as anyone who only has the public parameter can forge a new file identifier or a valid signature on a corrupted data packet to pollute legitimate sensor data. To enhance security and performance in network coding-based IoT networks, we propose a secure and efficient certificateless linearly homomorphic network coding signature scheme for IoT data delivery, which is free of burdensome certificate management and key escrow issue. In addition, our scheme is proved to be secure against adaptive chosen identity and adaptive chosen subspace attacks under two types of adversaries in the algebraic group model and random oracle model. Therefore, our scheme can verify the validity of data packets and allow data packets to be computed, so as to resist pollution attacks. The performance evaluation demonstrates that our scheme is more efficient and practical than existing secure schemes. Specifically, for a 73-dimensional data vector, the costs of signature generation and verification in our scheme are reduced by 38.588%-86.076% and 38.570%-85.664% respectively under the symmetric bilinear pairing setting, and the costs of signature generation and verification in our scheme are reduced by 17.740%-49.752% and 29.697%-58.645% respectively under the asymmetric bilinear pairing setting.\",\"PeriodicalId\":13492,\"journal\":{\"name\":\"IEEE Transactions on Information Forensics and Security\",\"volume\":\"20 \",\"pages\":\"5534-5548\"},\"PeriodicalIF\":8.0000,\"publicationDate\":\"2025-04-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Information Forensics and Security\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10972086/\",\"RegionNum\":1,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Forensics and Security","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10972086/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

最近,Li等人提出了一种基于身份的线性同态网络编码签名(IB-HNCS)方案,用于物联网(IoT)网络中的安全数据传输,并声称IB-HNCS方案可以抵抗污染攻击。然而,本文表明IB-HNCS方案容易受到污染攻击,因为任何只有公共参数的人都可以在损坏的数据包上伪造新的文件标识符或有效签名来污染合法的传感器数据。为了提高基于网络编码的物联网网络的安全性和性能,我们提出了一种安全高效的无证书线性同态网络编码签名方案,该方案不需要繁琐的证书管理和密钥托管问题。此外,在代数群模型和随机oracle模型两种类型的攻击下,证明了该方案在自适应选择身份和自适应选择子空间攻击下的安全性。因此,我们的方案可以验证数据包的有效性,并允许对数据包进行计算,从而抵抗污染攻击。性能评估表明,该方案比现有的安全方案更有效、更实用。具体而言,对于73维数据向量,对称双线性配对设置下签名生成和验证成本分别降低了38.588% ~ 86.076%和38.570% ~ 85.664%,非对称双线性配对设置下签名生成和验证成本分别降低了17.740% ~ 49.752%和29.697% ~ 58.645%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Enhanced Linearly Homomorphic Network Coding Signature Scheme for Secure Data Delivery in IoT Networks
Recently, Li et al. proposed an identity-based linearly homomorphic network coding signature (IB-HNCS) scheme for secure data delivery in Internet of Things (IoT) networks, and they claimed that the IB-HNCS scheme can resist pollution attacks. However, this paper shows that the IB-HNCS scheme is vulnerable to pollution attacks, as anyone who only has the public parameter can forge a new file identifier or a valid signature on a corrupted data packet to pollute legitimate sensor data. To enhance security and performance in network coding-based IoT networks, we propose a secure and efficient certificateless linearly homomorphic network coding signature scheme for IoT data delivery, which is free of burdensome certificate management and key escrow issue. In addition, our scheme is proved to be secure against adaptive chosen identity and adaptive chosen subspace attacks under two types of adversaries in the algebraic group model and random oracle model. Therefore, our scheme can verify the validity of data packets and allow data packets to be computed, so as to resist pollution attacks. The performance evaluation demonstrates that our scheme is more efficient and practical than existing secure schemes. Specifically, for a 73-dimensional data vector, the costs of signature generation and verification in our scheme are reduced by 38.588%-86.076% and 38.570%-85.664% respectively under the symmetric bilinear pairing setting, and the costs of signature generation and verification in our scheme are reduced by 17.740%-49.752% and 29.697%-58.645% respectively under the asymmetric bilinear pairing setting.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Information Forensics and Security
IEEE Transactions on Information Forensics and Security 工程技术-工程:电子与电气
CiteScore
14.40
自引率
7.40%
发文量
234
审稿时长
6.5 months
期刊介绍: The IEEE Transactions on Information Forensics and Security covers the sciences, technologies, and applications relating to information forensics, information security, biometrics, surveillance and systems applications that incorporate these features
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信