编码器带有因果状态信息的任意变化窃听信道上的强保密通信

陈一齐; 董晨; 骆源

doi:10.11959/j.issn.1000-436x.2026070

您当前的位置：

首页 >

文章列表页 >

编码器带有因果状态信息的任意变化窃听信道上的强保密通信

更新时间：2026-04-10

- 编码器带有因果状态信息的任意变化窃听信道上的强保密通信
- Strong secrecy of arbitrarily varying wiretap channels with causal side information at the encoder
- 通信学报 2026年页码：1-12
- 作者机构：
  
  1.慕尼黑工业大学理论信息技术实验室，慕尼黑 80333
  2.上海交通大学计算机学院，上海 200240
- 作者简介：
  
  [ "陈一齐（1996- ），男，浙江杭州人，博士，慕尼黑工业大学在站博士后，主要研究方向为信息论、信息理论安全等。" ]
  [ "董晨（1994- ），男，湖北宜昌人，上海交通大学博士生，主要研究方向为信息论、联邦学习等。" ]
  [ "骆源（1971- ），男，上海人，博士，上海交通大学教授、博士生导师，主要研究方向为信息论、信息通信、区块链技术等。" ]
- 基金信息：
  
  国家自然科学基金资助项目(62571321)
- DOI：10.11959/j.issn.1000-436x.2026070
  中图分类号： TN911
- 收稿：2026-01-02，
  
  修回：2026-03-12，
  
  录用：2026-03-13，
  
  网络首发：2026-04-10，
- 稿件说明：
移动端阅览
陈一齐,董晨,骆源.编码器带有因果状态信息的任意变化窃听信道上的强保密通信[J].通信学报,

Chen Yiqi,Dong Chen,Luo Yuan.Strong secrecy of arbitrarily varying wiretap channels with causal side information at the encoder[J].Journal on Communications,
陈一齐,董晨,骆源.编码器带有因果状态信息的任意变化窃听信道上的强保密通信[J].通信学报, DOI：10.11959/j.issn.1000-436x.2026070.

Chen Yiqi,Dong Chen,Luo Yuan.Strong secrecy of arbitrarily varying wiretap channels with causal side information at the encoder[J].Journal on Communications, DOI：10.11959/j.issn.1000-436x.2026070.

摘要

为了在存在干扰者和窃听者，且编码器在每个发送时刻可以检测到干扰信号的通信系统中进行可靠且保密的通信，提出一种编码方案并研究该通信系统的理论通信能力极限。该编码方案利用每个时刻检测到的干扰信号对信道输入进行针对性编码，首先构造出了用于组合信道上保密可靠通信的码。基于此码，利用一组对码字的随机置换构造出用于可以抵抗任意变化的干扰信号的强保密通信码，得到了所研究通信系统的强保密通信容量的下界。通过分析可得，当所构造的编码方案用于主信道比窃听信道严格低噪的情况时，达到了最优强保密容量，是该情况下的最优编码方案。

Abstract

To achieve reliable and secure communication over a channel in presence of a jammer and an eavesdropper

in which the encoder observes the jamming signal before transmitting each input symbol

a coding scheme was proposed

and the fundamental limit of the communication system was studied. The proposed coding scheme encoded each message using the observed jamming signal and was constructed as a code for reliable and secure communication over compound channels. Then

a set of random permutations over the codewords was used and the compound channel code was transformed into a code that could achieve reliable and secure communication over channels against arbitrarily varying jamming signals. A lower bound of the strong secrecy communication rate has been established. By analyzing the code over channels whose main channel is severely less noisy than the wiretap channel

the strong secrecy capacity of the channel is established and the proposed coding scheme is the optima scheme.

关键词

Keywords

references

Shannon C E , Weaver W . The mathematical theory of communication [M ] . Urbana : University of Illinois Press , 1964 .

Shannon C E . Channels with side information at the transmitter [J ] . IBM Journal of Research and Development , 1958 , 2 ( 4 ): 289 - 293 .

Blackwell D , Breiman L , Thomasian A J . The capacities of certain channel classes under random coding [J ] . The Annals of Mathematical Statistics , 1960 , 31 ( 3 ): 558 - 567 .

Ahlswede R . Elimination of correlation in random codes for arbitrarily varying channels [J ] . Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete , 1978 , 44 ( 2 ): 159 - 175 .

Csiszar I , Narayan P . The capacity of the arbitrarily varying channel revisited: positivity, constraints [J ] . IEEE Transactions on Information Theory , 1988 , 34 ( 2 ): 181 - 193 .

Torres-Figueroa L , Mönich U J , Voichtleitner J , et al . Experimental evaluation of a modular coding scheme for physical layer security [C ] // Proceedings of the 2021 IEEE Global Communications Conference (GLOBECOM) . Piscataway : IEEE Press , 2021 : 1 - 6 .

Wiese M , Boche H . Semantic security via seeded modular coding schemes and Ramanujan graphs [J ] . IEEE Transactions on Information Theory , 2021 , 67 ( 1 ): 52 - 80 .

Frank A , Voichtleitner J , Wiese M , et al . Implementation of a modular coding scheme for secure communication [C ] // Proceedings of the ICC 2022 - IEEE International Conference on Communications . Piscataway : IEEE Press , 2022 : 2900 - 2905 .

Ezzine R , Wiese M , Deppe C , et al . Common randomness generation from finite compound sources [C ] // Proceedings of the 2024 IEEE International Symposium on Information Theory (ISIT) . Piscataway : IEEE Press , 2024 : 2317 - 2322 .

Ezzine R , Wiese M , Deppe C , et al . Uniform common randomness generation over arbitrary point-to-point channels [J ] . IEEE Transactions on Information Theory , 2025 , 71 ( 7 ): 5312 - 5329 .

Ahlswede R , Csiszar I . Common randomness in information theory and cryptography. I. Secret sharing [J ] . IEEE Transactions on Information Theory , 1993 , 39 ( 4 ): 1121 - 1132 .

Ahlswede R , Csiszar I . Common randomness in information theory and cryptography. II. CR capacity [J ] . IEEE Transactions on Information Theory , 1998 , 44 ( 1 ): 225 - 240 .

Ahlswede R . Arbitrarily varying channels with states sequence known to the sender [J ] . IEEE Transactions on Information Theory , 1986 , 32 ( 5 ): 621 - 629 .

Wyner A D . The wire-tap channel [J ] . Bell System Technical Journal , 1975 , 54 ( 8 ): 1355 - 1387 .

Csiszar I , Korner J . Broadcast channels with confidential messages [J ] . IEEE Transactions on Information Theory , 1978 , 24 ( 3 ): 339 - 348 .

Yassaee M H , Aref M R . Multiple access wiretap channels with strong secrecy [C ] // Proceedings of the 2010 IEEE Information Theory Workshop . Piscataway : IEEE Press , 2010 : 1 - 5 .

Liang Y B , Poor H V . Multiple-access channels with confidential messages [J ] . IEEE Transactions on Information Theory , 2008 , 54 ( 3 ): 976 - 1002 .

Helal N , Bloch M , Nosratinia A . Cooperative resolvability and secrecy in the cribbing multiple-access channel [J ] . IEEE Transactions on Information Theory , 2020 , 66 ( 9 ): 5429 - 5447 .

Liang Y B , Kramer G , Poor H V , et al . Compound wiretap channels [J ] . EURASIP Journal on Wireless Communications and Networking , 2009 , 2009 : 142374 .

Bjelaković I , Boche H , Sommerfeld J . Secrecy results for compound wiretap channels [J ] . Problems of Information Transmission , 2013 , 49 ( 1 ): 73 - 98 .

Lai L F , Gamal H E . Cooperation for secure communication: the relay wiretap channel [C ] // Proceedings of the 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP’07 . Piscataway : IEEE Press , 2007 : III-149-III-152.

Dai B , Ma Z . Multiple-access relay wiretap channel [J ] . IEEE Transactions on Information Forensics and Security , 2015 , 10 ( 9 ): 1835 - 1849 .

Dai B , Li C , Liang Y B , et al . Impact of action-dependent state and channel feedback on Gaussian wiretap channels [J ] . IEEE Transactions on Information Theory , 2020 , 66 ( 6 ): 3435 - 3455 .

Dai B , Luo Y . An improved feedback coding scheme for the wire-tap channel [J ] . IEEE Transactions on Information Forensics and Security , 2019 , 14 ( 1 ): 262 - 271 .

Xia D F , Li K , Deng H , et al . Capacity-achieving coding schemes of Gaussian finite-state Markov wiretap channels with delayed feedback [J ] . IEEE Transactions on Information Forensics and Security , 2025 , 20 : 7029 - 7044 .

Chen Y L , Vinck A J H . Wiretap channel with side information [J ] . IEEE Transactions on Information Theory , 2008 , 54 ( 1 ): 395 - 402 .

Goldfeld Z , Cuff P , Permuter H H . Wiretap channels with random states non-causally available at the encoder [J ] . IEEE Transactions on Information Theory , 2020 , 66 ( 3 ): 1497 - 1519 .

Chia Y K , Gamal A E . Wiretap channel with causal state information [J ] . IEEE Transactions on Information Theory , 2012 , 58 ( 5 ): 2838 - 2849 .

Han T S , Sasaki M . Wiretap channels with causal state information: strong secrecy [J ] . IEEE Transactions on Information Theory , 2019 , 65 ( 10 ): 6750 - 6765 .

Chen Y Q , Oechtering T J , Skoglund M , et al . On strong secrecy for multiple access channels with states and causal CSI [J ] . IEEE Transactions on Information Theory , 2025 , 71 ( 4 ): 3070 - 3099 .

MolavianJazi E , Bloch M , Laneman J N . Arbitrary jamming can preclude secure communication [C ] // Proceedings of the 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton) . Piscataway : IEEE Press , 2009 : 1069 - 1075 .

Bjelaković I , Boche H , Sommerfeld J . Capacity results for arbitrarily varying wiretap channels [C ] // Information Theory, Combinatorics, and Search Theory: In Memory of Rudolf Ahlswede . Berlin : Springer , 2013 : 123 - 144 .

Goldfeld Z , Cuff P , Permuter H H . Arbitrarily varying wiretap channels with type constrained states [J ] . IEEE Transactions on Information Theory , 2016 , 62 ( 12 ): 7216 - 7244 .

Chen Y Q , He D , Luo Y . Strong secrecy of arbitrarily varying multiple access channels [J ] . IEEE Transactions on Information Forensics and Security , 2021 , 16 : 3662 - 3677 .

Chen Y Q , He D , Ying C H , et al . Strong secrecy of arbitrarily varying wiretap channel with constraints [J ] . IEEE Transactions on Information Theory , 2022 , 68 ( 7 ): 4700 - 4722 .

Csiszár I , Körner J . Information theory [M ] . Cambridge New York : Cambridge University Press , 2011 .

Gamal A E , Kim Y H . Network information theory [M ] . Cambridge, UK : Cambridge University Press , 2011 .

He D , Guo W M . Strong secrecy capacity of a class of wiretap networks [J ] . Entropy , 2016 , 18 ( 7 ): 238 .

Kramer G . Teaching IT: an identity for the Gelfand-Pinsker converse [J ] . IEEE Information Theory Society Newsletter , 2021 , 61 ( 4 ): 4 - 6 .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于相似性样本生成的深度强化学习快速抗干扰算法

WSN中可靠通信保障下的生存周期优化问题研究