基于同余的无线传感器网络零知识认证

B. Vijayalakshmi
{"title":"基于同余的无线传感器网络零知识认证","authors":"B. Vijayalakshmi","doi":"10.1109/ICOAC.2011.6165155","DOIUrl":null,"url":null,"abstract":"The three critical resources in any cluster based Wireless Sensor Networks (WSN) are Sensor Nodes (SN), Cluster Head (CH) and Base Station (BS). The main job of Cluster Head is to send all the aggregated data collected from multiple sensor Nodes to the Base Station. But before sending the data, the Cluster Head must be perfectly sure about the actual identity of Base Station. If any intruder acts as Base Station and receives the aggregated data the entire security of the network is spoiled. To avoid this, the authenticity of the base station needs to be checked by cluster head before sending any data. Many asymmetric authentication techniques like digital signatures are difficult to implement in resource constraint sensor Nodes. A zero-knowledge proof protocol is a powerful cryptographic system that can be applied in many cryptographic applications and operations such as identification, authentication, key exchange and others, but many of the existing zero knowledge proof of identity involves exponential calculations which are not suitable for WSN. To overcome the limitations of the existing techniques, the proposed protocol provides Zero knowledge proof identity using congruence equations. Here, Triplet simultaneous linear congruence equations are used to subdivide a whole secret into three shares. A part of a secret is used as identity of the base station and stored in it. The Base Station won't reveal the part of secret stored in it to the Cluster Head but the Cluster Head confirms the true identity without getting the actual secret from Base Station. In this scheme, the Cluster Heads need to solve only congruence equations which need only limited computation and memory. When the proposed protocol is compared with existing protocols it shows that it provide instant authentication, with minimum memory utilization and withstand many attacks.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"88 10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A zero-knowledge authentication for Wireless Sensor Networks based on congruence\",\"authors\":\"B. Vijayalakshmi\",\"doi\":\"10.1109/ICOAC.2011.6165155\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The three critical resources in any cluster based Wireless Sensor Networks (WSN) are Sensor Nodes (SN), Cluster Head (CH) and Base Station (BS). The main job of Cluster Head is to send all the aggregated data collected from multiple sensor Nodes to the Base Station. But before sending the data, the Cluster Head must be perfectly sure about the actual identity of Base Station. If any intruder acts as Base Station and receives the aggregated data the entire security of the network is spoiled. To avoid this, the authenticity of the base station needs to be checked by cluster head before sending any data. Many asymmetric authentication techniques like digital signatures are difficult to implement in resource constraint sensor Nodes. A zero-knowledge proof protocol is a powerful cryptographic system that can be applied in many cryptographic applications and operations such as identification, authentication, key exchange and others, but many of the existing zero knowledge proof of identity involves exponential calculations which are not suitable for WSN. To overcome the limitations of the existing techniques, the proposed protocol provides Zero knowledge proof identity using congruence equations. Here, Triplet simultaneous linear congruence equations are used to subdivide a whole secret into three shares. A part of a secret is used as identity of the base station and stored in it. The Base Station won't reveal the part of secret stored in it to the Cluster Head but the Cluster Head confirms the true identity without getting the actual secret from Base Station. In this scheme, the Cluster Heads need to solve only congruence equations which need only limited computation and memory. When the proposed protocol is compared with existing protocols it shows that it provide instant authentication, with minimum memory utilization and withstand many attacks.\",\"PeriodicalId\":369712,\"journal\":{\"name\":\"2011 Third International Conference on Advanced Computing\",\"volume\":\"88 10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Third International Conference on Advanced Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOAC.2011.6165155\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Advanced Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOAC.2011.6165155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在任何基于集群的无线传感器网络(WSN)中,三个关键资源是传感器节点(SN)、簇头(CH)和基站(BS)。簇头的主要工作是将从多个传感器节点收集的所有聚合数据发送到基站。但是在发送数据之前,簇头必须完全确定基站的实际身份。如果任何入侵者充当基站并接收聚合数据,整个网络的安全性就会被破坏。为了避免这种情况,集群头需要在发送任何数据之前检查基站的真实性。在资源约束传感器节点中,数字签名等非对称身份验证技术难以实现。零知识证明协议是一种功能强大的密码系统,可用于身份识别、认证、密钥交换等多种密码应用和操作,但现有的许多零知识身份证明涉及指数计算,不适合无线传感器网络。为了克服现有技术的局限性,提出的协议使用同余方程提供零知识证明身份。在这里,使用三重联立线性同余方程将整个秘密细分为三个部分。密码的一部分用作基站的标识并存储在其中。基站不会将存储在其中的部分秘密透露给簇头,但簇头在没有从基站获得实际秘密的情况下确认了真实身份。在该方案中,簇头只需要求解同余方程,只需要有限的计算量和内存。将该协议与现有协议进行比较,结果表明该协议具有快速认证、内存利用率低、抗攻击能力强等优点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A zero-knowledge authentication for Wireless Sensor Networks based on congruence
The three critical resources in any cluster based Wireless Sensor Networks (WSN) are Sensor Nodes (SN), Cluster Head (CH) and Base Station (BS). The main job of Cluster Head is to send all the aggregated data collected from multiple sensor Nodes to the Base Station. But before sending the data, the Cluster Head must be perfectly sure about the actual identity of Base Station. If any intruder acts as Base Station and receives the aggregated data the entire security of the network is spoiled. To avoid this, the authenticity of the base station needs to be checked by cluster head before sending any data. Many asymmetric authentication techniques like digital signatures are difficult to implement in resource constraint sensor Nodes. A zero-knowledge proof protocol is a powerful cryptographic system that can be applied in many cryptographic applications and operations such as identification, authentication, key exchange and others, but many of the existing zero knowledge proof of identity involves exponential calculations which are not suitable for WSN. To overcome the limitations of the existing techniques, the proposed protocol provides Zero knowledge proof identity using congruence equations. Here, Triplet simultaneous linear congruence equations are used to subdivide a whole secret into three shares. A part of a secret is used as identity of the base station and stored in it. The Base Station won't reveal the part of secret stored in it to the Cluster Head but the Cluster Head confirms the true identity without getting the actual secret from Base Station. In this scheme, the Cluster Heads need to solve only congruence equations which need only limited computation and memory. When the proposed protocol is compared with existing protocols it shows that it provide instant authentication, with minimum memory utilization and withstand many attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信