On the parallel relay wire-tap network

Information-theoretic secrecy is studied for a parallel relay (diamond) network, in which a transmitter wishes to communicate to a receiver through two relay nodes. While there is no direct link between the transmitter and receiver and all flow of information has to be transmitted through the relays, the message has to be kept secret from each of them. The exact secrecy capacity is characterized for the network under the linear deterministic model. The problem is then studied when each terminal is equipped with multiple antennas, and the channels are parallel Gaussian links. Lower and upper bounds for the secrecy capacity are derived, and the gap is bounded by a constant independent of the channel parameters and SNR. This results in an approximate characterization for the secrecy capacity of the parallel Gaussian diamond network.

[1]  Suhas Diggavi,et al.  Information-theoretic secrecy for wireless networks , 2009 .

[2]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[4]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.

[5]  Shlomo Shamai,et al.  Information Theoretic Security , 2009, Found. Trends Commun. Inf. Theory.

[6]  Suhas N. Diggavi,et al.  Approximate Capacity of a Class of Gaussian Interference-Relay Networks , 2011, IEEE Transactions on Information Theory.

[7]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[8]  Joy A. Thomas,et al.  Feedback can at most double Gaussian multiple access channel capacity , 1987, IEEE Trans. Inf. Theory.

[9]  Vinod M. Prabhakaran,et al.  The secrecy capacity of a class of parallel Gaussian compound wiretap channels , 2008, 2008 IEEE International Symposium on Information Theory.