Secret Writing on Dirty Paper: A Deterministic View

Recently, there has been a lot of success in using the deterministic approach to provide approximate characterization of Gaussian network capacity. In this paper, we take a deterministic view and revisit the problem of wiretap channel with side information. A precise characterization of the secrecy capacity is obtained for a linear deterministic model, which naturally suggests a coding scheme which we show to achieve the secrecy capacity of the degraded Gaussian model (dubbed as “secret writing on dirty paper”) to within half a bit.

[1]  Tsachy Weissman,et al.  Capacity of Channels With Action-Dependent States , 2009, IEEE Transactions on Information Theory.

[2]  A. J. Han Vinck,et al.  An achievable region for the Gaussian wiretap channel with side information , 2006, IEEE Transactions on Information Theory.

[3]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

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

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

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

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

[8]  Frans M. J. Willems.  An informationtheoretical approach to information embedding , 2000 .

[9]  H. Vincent Poor,et al.  Secrecy Capacity of Semi-deterministic Wire-tap Channels , 2007, 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks.

[10]  Imre Csiszár,et al.  Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.

[11]  Reza Khosravi-Farsani,et al.  Capacity bounds for multiuser channels with non-causal channel state information at the transmitters , 2011, 2011 IEEE Information Theory Workshop.

[12]  Bin Dai,et al.  Wiretap Channel With Side Information , 2006, ArXiv.

[13]  Hua Wang,et al.  Gaussian Interference Channel Capacity to Within One Bit , 2007, IEEE Transactions on Information Theory.