Compound Wiretap Channels

被引:179
作者
Liang, Yingbin [1 ]
Kramer, Gerhard [2 ]
Poor, H. Vincent [3 ]
Shamai , Shlomo [4 ]
机构
[1] Univ Hawaii, Dept Elect Engn, Honolulu, HI 96822 USA
[2] Univ So Calif, Dept Elect Engn, Los Angeles, CA 90089 USA
[3] Princeton Univ, Dept Elect Engn, Princeton, NJ 08544 USA
[4] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel
基金
美国国家科学基金会;
关键词
SHARING COMMUNICATION-SYSTEMS; CODING THEOREM; CAPACITY; REGION;
D O I
10.1155/2009/142374
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper considers the compound wiretap channel, which generalizes Wyner's wiretap model to allow the channels to the (legitimate) receiver and to the eavesdropper to take a number of possible states. No matter which states occur, the transmitter guarantees that the receiver decodes its message and that the eavesdropper is kept in full ignorance about the message. The compound wiretap channel can also be viewed as a multicast channel with multiple eavesdroppers, in which the transmitter sends information to all receivers and keeps the information secret from all eavesdroppers. For the discrete memoryless channel, lower and upper bounds on the secrecy capacity are derived. The secrecy capacity is established for the degraded channel and the semideterministic channel with one receiver. The parallel Gaussian channel is further studied. The secrecy capacity and the secrecy degree of freedom (s.d.o.f.) are derived for the degraded case with one receiver. Schemes to achieve the s.d.o.f. for the case with two receivers and two eavesdroppers are constructed to demonstrate the necessity of a prefix channel in encoder design. Finally, the multi-antenna (i.e., MIMO) compound wiretap channel is studied. The secrecy capacity is established for the degraded case and an achievable s.d.o.f. is given for the general case. Copyright (C) 2009 Yingbin Liang et al.
引用
收藏
页数:12
相关论文
共 27 条
[1]  
[Anonymous], P 45 ANN ALL C COMM
[2]  
[Anonymous], 1991, ELEMENTS INFORM THEO
[3]  
[Anonymous], 1981, Information Theory: Coding Theorems for Discrete Memoryless Systems
[4]   The Secrecy Capacity Region of the Degraded Vector Gaussian Broadcast Channel [J].
Bagherikaram, Ghadamali ;
Motahari, Abolfazl S. ;
Khandani, Amir K. .
2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, :2772-2776
[5]   Secure network coding [J].
Cai, N ;
Yeung, RW .
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, :323-323
[6]  
CSISZAR I, 1978, IEEE T INFORM THEORY, V24, P339, DOI 10.1109/TIT.1978.1055892
[7]   The worst additive noise under a covariance constraint [J].
Diggavi, SN ;
Cover, TM .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (07) :3072-3081
[8]  
Grubb J, 2007, PROCEEDINGS OF THE 2007 IEEE INFORMATION THEORY WORKSHOP ON INFORMATION THEORY FOR WIRELESS NETWORKS, P199
[9]   Secure broadcasting over fading channels [J].
Khisti, Ashish ;
Tchamkerten, Aslan ;
Wornell, Gregory W. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) :2453-2469
[10]   On the Compound MIMO Broadcast Channels with Confidential Messages [J].
Kobayashi, Mari ;
Liang, Yingbin ;
Shamai, Shlomo ;
Debbah, Merouane .
2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4, 2009, :1283-+