网络物理电力系统中基于 ECC 的无证书聚合签名加密方案

IF 4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Xue Li;Renqing Zhu;Dajun Du;Cheng Jiang;Zhe Zhou
{"title":"网络物理电力系统中基于 ECC 的无证书聚合签名加密方案","authors":"Xue Li;Renqing Zhu;Dajun Du;Cheng Jiang;Zhe Zhou","doi":"10.1109/JSYST.2024.3365848","DOIUrl":null,"url":null,"abstract":"The signcryption schemes play an important role in keeping the security of information interactions among the devices in cyber-physical power systems (CPPSs). However, the existing schemes based on bilinear pairing have heavy computation and communication costs, making it challenging to deploy to resource-constrained devices (RCDs). Moreover, the most existing aggregate signcryption schemes do not validate the signcryption ciphertext when the data are aggregated by the aggregation device, jeopardizing the security and stability of the CPPSs. To solve these issues, this article explores a novel certificateless aggregate signcryption scheme based on elliptic curve cryptography applied to information interaction among RCDs of CPPSs. First, a lightweight signcryption scheme is proposed to achieve secure information interaction of RCDs. Then, to efficiently discover illegal signcryption in the aggregate signcryption, a method of constructing a 2-D matrix is proposed, which improves the robustness of secure information interaction. Furthermore, the security of the proposed signcryption scheme is theoretically proven by the elliptic curve discrete logarithm problem and computational Diffie–Hellman problem assumptions, and the scheme is theoretically analyzed to meet the security requirements of RCDs. Finally, experiments are carried out to validate the efficacy and appropriateness of the proposed signcryption scheme.","PeriodicalId":55017,"journal":{"name":"IEEE Systems Journal","volume":"18 2","pages":"893-904"},"PeriodicalIF":4.0000,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ECC-Based Certificateless Aggregate Signcryption Scheme in Cyber-Physical Power Systems\",\"authors\":\"Xue Li;Renqing Zhu;Dajun Du;Cheng Jiang;Zhe Zhou\",\"doi\":\"10.1109/JSYST.2024.3365848\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The signcryption schemes play an important role in keeping the security of information interactions among the devices in cyber-physical power systems (CPPSs). However, the existing schemes based on bilinear pairing have heavy computation and communication costs, making it challenging to deploy to resource-constrained devices (RCDs). Moreover, the most existing aggregate signcryption schemes do not validate the signcryption ciphertext when the data are aggregated by the aggregation device, jeopardizing the security and stability of the CPPSs. To solve these issues, this article explores a novel certificateless aggregate signcryption scheme based on elliptic curve cryptography applied to information interaction among RCDs of CPPSs. First, a lightweight signcryption scheme is proposed to achieve secure information interaction of RCDs. Then, to efficiently discover illegal signcryption in the aggregate signcryption, a method of constructing a 2-D matrix is proposed, which improves the robustness of secure information interaction. Furthermore, the security of the proposed signcryption scheme is theoretically proven by the elliptic curve discrete logarithm problem and computational Diffie–Hellman problem assumptions, and the scheme is theoretically analyzed to meet the security requirements of RCDs. Finally, experiments are carried out to validate the efficacy and appropriateness of the proposed signcryption scheme.\",\"PeriodicalId\":55017,\"journal\":{\"name\":\"IEEE Systems Journal\",\"volume\":\"18 2\",\"pages\":\"893-904\"},\"PeriodicalIF\":4.0000,\"publicationDate\":\"2024-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Systems Journal\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10460416/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Systems Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10460416/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

在网络物理电力系统(CPPS)中,签名加密方案在保证设备间信息交互安全方面发挥着重要作用。然而,现有的基于双线性配对的方案计算和通信成本高昂,因此在资源受限的设备(RCD)中部署具有挑战性。此外,大多数现有的聚合签名加密方案在数据被聚合设备聚合时不会验证签名加密密文,从而危及 CPPS 的安全性和稳定性。为解决这些问题,本文探讨了一种基于椭圆曲线密码学的新型无证书聚合签名加密方案,并将其应用于 CPPS 的 RCD 之间的信息交互。首先,本文提出了一种轻量级签名加密方案,以实现 RCD 之间的安全信息交互。然后,为了有效发现聚合加密中的非法加密,提出了一种构建二维矩阵的方法,从而提高了安全信息交互的鲁棒性。此外,通过椭圆曲线离散对数问题和计算 Diffie-Hellman 问题假设从理论上证明了所提签名加密方案的安全性,并从理论上分析了该方案满足 RCD 的安全要求。最后,通过实验验证了所提签名加密算法的有效性和适用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
ECC-Based Certificateless Aggregate Signcryption Scheme in Cyber-Physical Power Systems
The signcryption schemes play an important role in keeping the security of information interactions among the devices in cyber-physical power systems (CPPSs). However, the existing schemes based on bilinear pairing have heavy computation and communication costs, making it challenging to deploy to resource-constrained devices (RCDs). Moreover, the most existing aggregate signcryption schemes do not validate the signcryption ciphertext when the data are aggregated by the aggregation device, jeopardizing the security and stability of the CPPSs. To solve these issues, this article explores a novel certificateless aggregate signcryption scheme based on elliptic curve cryptography applied to information interaction among RCDs of CPPSs. First, a lightweight signcryption scheme is proposed to achieve secure information interaction of RCDs. Then, to efficiently discover illegal signcryption in the aggregate signcryption, a method of constructing a 2-D matrix is proposed, which improves the robustness of secure information interaction. Furthermore, the security of the proposed signcryption scheme is theoretically proven by the elliptic curve discrete logarithm problem and computational Diffie–Hellman problem assumptions, and the scheme is theoretically analyzed to meet the security requirements of RCDs. Finally, experiments are carried out to validate the efficacy and appropriateness of the proposed signcryption scheme.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Systems Journal
IEEE Systems Journal 工程技术-电信学
CiteScore
9.80
自引率
6.80%
发文量
572
审稿时长
4.9 months
期刊介绍: This publication provides a systems-level, focused forum for application-oriented manuscripts that address complex systems and system-of-systems of national and global significance. It intends to encourage and facilitate cooperation and interaction among IEEE Societies with systems-level and systems engineering interest, and to attract non-IEEE contributors and readers from around the globe. Our IEEE Systems Council job is to address issues in new ways that are not solvable in the domains of the existing IEEE or other societies or global organizations. These problems do not fit within traditional hierarchical boundaries. For example, disaster response such as that triggered by Hurricane Katrina, tsunamis, or current volcanic eruptions is not solvable by pure engineering solutions. We need to think about changing and enlarging the paradigm to include systems issues.
×
引用
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学术官方微信