Secure Degree of Freedom Bound of Secret-Key Capacity for Two-Way Wiretap Channel

IF 3.2 2区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Qingpeng Liang;Linsong Du;Yanzhi Wu;Zheng Ma
{"title":"Secure Degree of Freedom Bound of Secret-Key Capacity for Two-Way Wiretap Channel","authors":"Qingpeng Liang;Linsong Du;Yanzhi Wu;Zheng Ma","doi":"10.1109/LSP.2024.3525406","DOIUrl":null,"url":null,"abstract":"This letter focuses on the optimal sum secure degree of freedom (SDoF) in a two-way wiretap channel (TW-WC), wherein two legitimate full-duplex multiple-antenna nodes cooperate with each other and are wiretapped by a multiple antenna eavesdropper simultaneously. It aims to find the optimal sum SDoF pertaining to secret-key capacity for the TW-WC. First, we analyze the upper bound and lower bounds of the optimal sum SDoF by establishing their equivalence to the expression of the optimal SDoF corresponding to the secrecy rate for the TW-WC. Subsequently, in scenarios where the legitimate nodes are configured with an equal number of transmit and receive antennas, it is elucidated that the upper and lower bounds of the optimal SDoF converge. Furthermore, the findings suggest that a higher SDoF can be achieved than the existing works, thereby heralding an enhancement in secure spectral efficiency.","PeriodicalId":13154,"journal":{"name":"IEEE Signal Processing Letters","volume":"32 ","pages":"581-585"},"PeriodicalIF":3.2000,"publicationDate":"2025-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Signal Processing Letters","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/10824677/","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

This letter focuses on the optimal sum secure degree of freedom (SDoF) in a two-way wiretap channel (TW-WC), wherein two legitimate full-duplex multiple-antenna nodes cooperate with each other and are wiretapped by a multiple antenna eavesdropper simultaneously. It aims to find the optimal sum SDoF pertaining to secret-key capacity for the TW-WC. First, we analyze the upper bound and lower bounds of the optimal sum SDoF by establishing their equivalence to the expression of the optimal SDoF corresponding to the secrecy rate for the TW-WC. Subsequently, in scenarios where the legitimate nodes are configured with an equal number of transmit and receive antennas, it is elucidated that the upper and lower bounds of the optimal SDoF converge. Furthermore, the findings suggest that a higher SDoF can be achieved than the existing works, thereby heralding an enhancement in secure spectral efficiency.
双向窃听信道密钥容量的安全自由度边界
这封信的重点是在双向窃听信道(TW-WC)的最佳总和安全自由度(SDoF),其中两个合法的全双工多天线节点相互合作,同时被多天线窃听者窃听。其目的是寻找与TW-WC保密密钥容量相关的最优SDoF总和。首先,我们分析了最优和SDoF的上界和下界,建立了它们与TW-WC保密率对应的最优SDoF表达式的等价性。然后,在合法节点配置相同数量的发射和接收天线的情况下,阐明了最优SDoF的上界和下界收敛。此外,研究结果表明,可以实现比现有工作更高的SDoF,从而预示着安全频谱效率的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Signal Processing Letters
IEEE Signal Processing Letters 工程技术-工程:电子与电气
CiteScore
7.40
自引率
12.80%
发文量
339
审稿时长
2.8 months
期刊介绍: The IEEE Signal Processing Letters is a monthly, archival publication designed to provide rapid dissemination of original, cutting-edge ideas and timely, significant contributions in signal, image, speech, language and audio processing. Papers published in the Letters can be presented within one year of their appearance in signal processing conferences such as ICASSP, GlobalSIP and ICIP, and also in several workshop organized by the Signal Processing Society.
×
引用
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学术官方微信