Secure Communication Under Channel Uncertainty and Adversarial Attacks

被引:50
作者
Schaefer, Rafael F. [1 ]
Boche, Holger [2 ]
Poor, H. Vincent [1 ]
机构
[1] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[2] Tech Univ Munich, Lehrstuhl Theoret Informat Tech, D-80290 Munich, Germany
基金
美国国家科学基金会;
关键词
Arbitrarily varying channel; common randomness; compound channel; continuity; robustness; secrecy capacity; wiretap channel; STRONG SECRECY; QUANTUM COMMUNICATION; BROADCAST CHANNELS; CAPACITY; TRANSMISSION; PROBABILITY; WEAK;
D O I
10.1109/JPROC.2015.2459652
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Information theoretic approaches to security have been examined as a promising complement to current cryptographic techniques. Such information theoretic approaches establish reliable communication and data confidentiality directly at the physical layer of a communication network by taking the properties of the noisy channel into account leading to unconditional security regardless of the computational capabilities of eavesdroppers. The provision of accurate channel state information is a major challenge particularly in wireless communication systems, especially information about the channels to eavesdroppers. In addition, there might be malevolent adversaries who jam or influence the channel of the legitimate users. This paper surveys different models for secure communication under channel uncertainty and adversarial attacks and reviews the corresponding secrecy capacity results, which characterize the maximum rate at which information can be sent to legitimate receivers while being kept perfectly security from eavesdroppers.
引用
收藏
页码:1796 / 1813
页数:18
相关论文
共 66 条
[1]   A NOTE ON EXISTENCE OF WEAK CAPACITY FOR CHANNELS WITH ARBITRARILY VARYING CHANNEL PROBABILITY FUNCTIONS AND ITS RELATION TO SHANNONS ZERO ERROR CAPACITY [J].
AHLSWEDE, R .
ANNALS OF MATHEMATICAL STATISTICS, 1970, 41 (03) :1027-+
[2]   ELIMINATION OF CORRELATION IN RANDOM CODES FOR ARBITRARILY VARYING CHANNELS [J].
AHLSWEDE, R .
ZEITSCHRIFT FUR WAHRSCHEINLICHKEITSTHEORIE UND VERWANDTE GEBIETE, 1978, 44 (02) :159-175
[3]   The Shannon capacity of a union [J].
Alon, N .
COMBINATORICA, 1998, 18 (03) :301-310
[4]  
[Anonymous], 2011, Information theory: Coding theorems for discrete memoryless systems
[5]  
[Anonymous], ROBUST CODE DE UNPUB
[6]  
[Anonymous], 2014, 2014 INT C PROB METH
[7]  
[Anonymous], 2014, THE TACTILE INTERNET
[8]  
[Anonymous], P IEEE INT S INF THE
[9]  
[Anonymous], P IEEE INT S INF THE
[10]  
[Anonymous], 1978, Coding Theorems of Information Theory