面向智能电网安全认证的掩码对称密钥加密验证码

V. O. Nyangaresi
{"title":"面向智能电网安全认证的掩码对称密钥加密验证码","authors":"V. O. Nyangaresi","doi":"10.1109/gpecom55404.2022.9815718","DOIUrl":null,"url":null,"abstract":"Although many smart grid authentication protocols have been presented in literature, majority of them remain susceptible to numerous attacks. In addition, some of these protocols are based on computationally intensive cryptographic primitives, which render them inefficient. To address some of these challenges, a protocol based on masked symmetric key encrypted verification codes is presented in this paper. The security analysis carried out shows that this protocol provides message confidentiality, unlinkability, and traceability for malicious network entities. It is also resilient against side-channel and forgery attacks. In terms of efficiency, limited numbers of elliptic curve multiplication and one way-hashing operations are executed during mutual authentication, message signing and verification. As such, this protocol exhibits the least computation and communication complexities in comparison with its peers.","PeriodicalId":441321,"journal":{"name":"2022 4th Global Power, Energy and Communication Conference (GPECOM)","volume":"280 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Masked Symmetric Key Encrypted Verification Codes for Secure Authentication in Smart Grid Networks\",\"authors\":\"V. O. Nyangaresi\",\"doi\":\"10.1109/gpecom55404.2022.9815718\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although many smart grid authentication protocols have been presented in literature, majority of them remain susceptible to numerous attacks. In addition, some of these protocols are based on computationally intensive cryptographic primitives, which render them inefficient. To address some of these challenges, a protocol based on masked symmetric key encrypted verification codes is presented in this paper. The security analysis carried out shows that this protocol provides message confidentiality, unlinkability, and traceability for malicious network entities. It is also resilient against side-channel and forgery attacks. In terms of efficiency, limited numbers of elliptic curve multiplication and one way-hashing operations are executed during mutual authentication, message signing and verification. As such, this protocol exhibits the least computation and communication complexities in comparison with its peers.\",\"PeriodicalId\":441321,\"journal\":{\"name\":\"2022 4th Global Power, Energy and Communication Conference (GPECOM)\",\"volume\":\"280 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 4th Global Power, Energy and Communication Conference (GPECOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/gpecom55404.2022.9815718\",\"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 4th Global Power, Energy and Communication Conference (GPECOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/gpecom55404.2022.9815718","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

尽管文献中已经提出了许多智能电网身份验证协议,但大多数协议仍然容易受到大量攻击。此外,其中一些协议基于计算密集型的加密原语,这使得它们效率低下。为了解决这些问题,本文提出了一种基于掩码对称密钥加密验证码的协议。安全性分析表明,该协议为恶意网络实体提供了消息保密性、不可链接性和可追溯性。它还具有抗侧信道和伪造攻击的弹性。在效率方面,在相互认证、消息签名和验证期间执行有限数量的椭圆曲线乘法和单向哈希操作。因此,与同类协议相比,该协议具有最少的计算和通信复杂性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Masked Symmetric Key Encrypted Verification Codes for Secure Authentication in Smart Grid Networks
Although many smart grid authentication protocols have been presented in literature, majority of them remain susceptible to numerous attacks. In addition, some of these protocols are based on computationally intensive cryptographic primitives, which render them inefficient. To address some of these challenges, a protocol based on masked symmetric key encrypted verification codes is presented in this paper. The security analysis carried out shows that this protocol provides message confidentiality, unlinkability, and traceability for malicious network entities. It is also resilient against side-channel and forgery attacks. In terms of efficiency, limited numbers of elliptic curve multiplication and one way-hashing operations are executed during mutual authentication, message signing and verification. As such, this protocol exhibits the least computation and communication complexities in comparison with its peers.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信