基于多项式子集的轻量级设备网络高效密钥管理

Zahid Mahmood, Huansheng Ning, A. Ghafoor, R. Mehmood, R. Bie
{"title":"基于多项式子集的轻量级设备网络高效密钥管理","authors":"Zahid Mahmood, Huansheng Ning, A. Ghafoor, R. Mehmood, R. Bie","doi":"10.1109/IIKI.2016.30","DOIUrl":null,"url":null,"abstract":"Wireless Sensor Networks (WSNs) is highly vulnerable to security attacks because of resource-constrained wireless devices. Complex and resource intensive security schemes are infeasible and reduce the network lifetime. We have explored polynomial distribution based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied, and it becomes more costly when these polynomials are regenerated dynamically after each node join or leave operations. To reduce the computation overhead on a cluster head, we have proposed XOR based key management scheme. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs. Proposed XOR based calculation reduces 65% computing cost. The reduction of memory overheads is from p-bits to m-bits where m","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"228 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Polynomial Subset Based Efficient Key Management for Lightweight Devices Networks\",\"authors\":\"Zahid Mahmood, Huansheng Ning, A. Ghafoor, R. Mehmood, R. Bie\",\"doi\":\"10.1109/IIKI.2016.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless Sensor Networks (WSNs) is highly vulnerable to security attacks because of resource-constrained wireless devices. Complex and resource intensive security schemes are infeasible and reduce the network lifetime. We have explored polynomial distribution based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied, and it becomes more costly when these polynomials are regenerated dynamically after each node join or leave operations. To reduce the computation overhead on a cluster head, we have proposed XOR based key management scheme. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs. Proposed XOR based calculation reduces 65% computing cost. The reduction of memory overheads is from p-bits to m-bits where m\",\"PeriodicalId\":371106,\"journal\":{\"name\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"volume\":\"228 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIKI.2016.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIKI.2016.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于无线设备的资源限制,无线传感器网络极易受到安全攻击。复杂和资源密集型的安全方案是不可行的,并且会降低网络的生命周期。我们探索了基于多项式分布的密钥建立方案,并发现了一个问题,即当大值相乘时,生成的多项式值要么存储密集,要么不可行,并且在每个节点加入或离开操作后动态地重新生成这些多项式会变得更加昂贵。为了减少簇头的计算开销,我们提出了基于异或的密钥管理方案。使用NS 2.35执行仿真场景,以验证存储,通信,延迟,能量和多项式计算成本的结果。所提出的基于异或的计算方法可减少65%的计算成本。内存开销的减少是从p位到m位,其中m
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Polynomial Subset Based Efficient Key Management for Lightweight Devices Networks
Wireless Sensor Networks (WSNs) is highly vulnerable to security attacks because of resource-constrained wireless devices. Complex and resource intensive security schemes are infeasible and reduce the network lifetime. We have explored polynomial distribution based key establishment schemes and identified an issue that the resultant polynomial value is either storage intensive or infeasible when large values are multiplied, and it becomes more costly when these polynomials are regenerated dynamically after each node join or leave operations. To reduce the computation overhead on a cluster head, we have proposed XOR based key management scheme. Simulation scenarios are performed using NS 2.35 to validate the results for storage, communication, latency, energy, and polynomial calculation costs. Proposed XOR based calculation reduces 65% computing cost. The reduction of memory overheads is from p-bits to m-bits where m
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on the Evaluation of Product Quality Perceived Value Based on Text Mining and Fuzzy Comprehensive Evaluation A New Pre-copy Strategy for Live Migration of Virtual Machines Hbase Based Surveillance Video Processing, Storage and Retrieval Mutual Information-Based Feature Selection and Ensemble Learning for Classification Implicit Correlation Intensity Mining Based on the Monte Carlo Method with Attenuation
×
引用
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