基于水下声学动态超图的秘密密钥协议方案

IF 8.9 1区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Ming Xu;Ming Hao
{"title":"基于水下声学动态超图的秘密密钥协议方案","authors":"Ming Xu;Ming Hao","doi":"10.1109/JIOT.2025.3529425","DOIUrl":null,"url":null,"abstract":"In order to cope with the problem of how to agree on a covert secret key with high reliability and strong secrecy among an arbitrary number of legitimate nodes in underwater acoustic channel (UAC), a Covert Secret key agreement scheme based on underwater acoustics dynamic hypergraph called CSDH is proposed. The CSDH scheme is novel in three aspects. First, we utilize attention mechanism for extracting the feature of node in UAC and construct a dynamic hypergraph model by its characteristics, which has less storage space and lower computational complexity. Second, we design a spatio-temporal hypergraph convolution method based on the spatial and temporal variation characteristics of UAC in which the number of the nodes is arbitrary, the hyperedge is dynamic, and each hyperedge can encompass an arbitrary number of nodes. Third, we utilize covert communication and polar coding to construct high-entropy bit indices set and very high-entropy bit indices set to generate a common covert key among arbitrary number of legitimate nodes to ensure that not only the key is secret but the entire key agreement process remains covert to eavesdroppers. The reliability, uniformity, secrecy, covertness and secrecy capacity of the CSDH scheme are proved by the information theory and hypergraph theory. The simulation results demonstrate the performance of the CSDH scheme is better than that of existing schemes.","PeriodicalId":54347,"journal":{"name":"IEEE Internet of Things Journal","volume":"12 11","pages":"15792-15806"},"PeriodicalIF":8.9000,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Covert Secret Key Agreement Scheme Based on the Underwater Acoustic Dynamic Hypergraph\",\"authors\":\"Ming Xu;Ming Hao\",\"doi\":\"10.1109/JIOT.2025.3529425\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to cope with the problem of how to agree on a covert secret key with high reliability and strong secrecy among an arbitrary number of legitimate nodes in underwater acoustic channel (UAC), a Covert Secret key agreement scheme based on underwater acoustics dynamic hypergraph called CSDH is proposed. The CSDH scheme is novel in three aspects. First, we utilize attention mechanism for extracting the feature of node in UAC and construct a dynamic hypergraph model by its characteristics, which has less storage space and lower computational complexity. Second, we design a spatio-temporal hypergraph convolution method based on the spatial and temporal variation characteristics of UAC in which the number of the nodes is arbitrary, the hyperedge is dynamic, and each hyperedge can encompass an arbitrary number of nodes. Third, we utilize covert communication and polar coding to construct high-entropy bit indices set and very high-entropy bit indices set to generate a common covert key among arbitrary number of legitimate nodes to ensure that not only the key is secret but the entire key agreement process remains covert to eavesdroppers. The reliability, uniformity, secrecy, covertness and secrecy capacity of the CSDH scheme are proved by the information theory and hypergraph theory. The simulation results demonstrate the performance of the CSDH scheme is better than that of existing schemes.\",\"PeriodicalId\":54347,\"journal\":{\"name\":\"IEEE Internet of Things Journal\",\"volume\":\"12 11\",\"pages\":\"15792-15806\"},\"PeriodicalIF\":8.9000,\"publicationDate\":\"2025-01-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Internet of Things Journal\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10844926/\",\"RegionNum\":1,\"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 Internet of Things Journal","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10844926/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

为了解决水声信道(UAC)中任意数量合法节点间高可靠性、强保密性的秘密密钥协商问题,提出了一种基于水声动态超图的秘密密钥协商方案(CSDH)。CSDH方案在三个方面是新颖的。首先,我们利用注意机制提取UAC中节点的特征,并根据其特征构建动态超图模型,该模型存储空间小,计算复杂度低;其次,基于UAC的时空变化特征,设计了节点数量任意、超边缘动态、每个超边缘可以包含任意数量节点的时空超图卷积方法;第三,我们利用隐蔽通信和极性编码构造高熵位索引集和非常高熵位索引集,在任意数量的合法节点之间生成公共隐蔽密钥,以确保密钥不仅是秘密的,而且整个密钥协议过程对窃听者保持隐蔽。利用信息论和超图理论证明了CSDH方案的可靠性、一致性、保密性、隐蔽性和保密能力。仿真结果表明,CSDH方案的性能优于现有方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Covert Secret Key Agreement Scheme Based on the Underwater Acoustic Dynamic Hypergraph
In order to cope with the problem of how to agree on a covert secret key with high reliability and strong secrecy among an arbitrary number of legitimate nodes in underwater acoustic channel (UAC), a Covert Secret key agreement scheme based on underwater acoustics dynamic hypergraph called CSDH is proposed. The CSDH scheme is novel in three aspects. First, we utilize attention mechanism for extracting the feature of node in UAC and construct a dynamic hypergraph model by its characteristics, which has less storage space and lower computational complexity. Second, we design a spatio-temporal hypergraph convolution method based on the spatial and temporal variation characteristics of UAC in which the number of the nodes is arbitrary, the hyperedge is dynamic, and each hyperedge can encompass an arbitrary number of nodes. Third, we utilize covert communication and polar coding to construct high-entropy bit indices set and very high-entropy bit indices set to generate a common covert key among arbitrary number of legitimate nodes to ensure that not only the key is secret but the entire key agreement process remains covert to eavesdroppers. The reliability, uniformity, secrecy, covertness and secrecy capacity of the CSDH scheme are proved by the information theory and hypergraph theory. The simulation results demonstrate the performance of the CSDH scheme is better than that of existing schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Internet of Things Journal
IEEE Internet of Things Journal Computer Science-Information Systems
CiteScore
17.60
自引率
13.20%
发文量
1982
期刊介绍: The EEE Internet of Things (IoT) Journal publishes articles and review articles covering various aspects of IoT, including IoT system architecture, IoT enabling technologies, IoT communication and networking protocols such as network coding, and IoT services and applications. Topics encompass IoT's impacts on sensor technologies, big data management, and future internet design for applications like smart cities and smart homes. Fields of interest include IoT architecture such as things-centric, data-centric, service-oriented IoT architecture; IoT enabling technologies and systematic integration such as sensor technologies, big sensor data management, and future Internet design for IoT; IoT services, applications, and test-beds such as IoT service middleware, IoT application programming interface (API), IoT application design, and IoT trials/experiments; IoT standardization activities and technology development in different standard development organizations (SDO) such as IEEE, IETF, ITU, 3GPP, ETSI, etc.
×
引用
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学术官方微信