On secure communication with constrained randomization
暂无分享,去创建一个
[1] Ender Tekin,et al. The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming , 2007, IEEE Transactions on Information Theory.
[2] Aylin Yener,et al. MIMO Broadcast Channel with Arbitrarily Varying Eavesdropper Channel: Secrecy Degrees of Freedom , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.
[3] Shlomo Shamai,et al. Information Theoretic Security , 2009, Found. Trends Commun. Inf. Theory.
[4] Rudolf Ahlswede,et al. Common Randomness in Information Theory and Cryptography - Part II: CR Capacity , 1998, IEEE Trans. Inf. Theory.
[5] A. J. Han Vinck,et al. Wiretap Channel With Side Information , 2006, IEEE Transactions on Information Theory.
[6] S. Verdu,et al. The resolvability and the capacity of AWGN channels are equal , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.
[7] Shigeki Miyake,et al. Construction of wiretap channel codes by using sparse matrices , 2009, 2009 IEEE Information Theory Workshop.
[8] A. D. Wyner,et al. The wire-tap channel , 1975, The Bell System Technical Journal.
[9] Watanabe Shun,et al. Broadcast Channels with Confidential Messages by Randomness Constrained Stochastic Encoder , 2012 .
[10] Paul Cuff,et al. Communication in networks for coordinating behavior , 2009 .
[11] A. Yener,et al. Providing secrecy when the eavesdropper channel is arbitrarily varying: A case for multiple antennas , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[12] Matthieu R. Bloch,et al. Physical-Layer Security: From Information Theory to Security Engineering , 2011 .
[13] Imre Csiszár,et al. Broadcast channels with confidential messages , 1978, IEEE Trans. Inf. Theory.
[14] Alexander Vardy,et al. Achieving the secrecy capacity of wiretap channels using Polar codes , 2010, ISIT.
[15] Shlomo Shamai,et al. Compound Wiretap Channels , 2009, EURASIP J. Wirel. Commun. Netw..