Providing secrecy with lattice codes

46th Annual Allerton Conference on Communication, Control, and Computing

Volumn , Issue , 2008, Pages 1199-1206

  He, Xiang ^a   Yener, Aylin ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL CODES; GAUSSIAN; GAUSSIAN CHANNELS; INFORMATION NEEDS; LATTICE CODES; LINE NETWORKS; MULTI HOPS; NUMBER OF HOPS; PHYSICAL LAYERS; RANDOM CODES; RELAY NODES; SOURCE CODES; WIRETAP CHANNELS;

JAMMING;

TRELLIS CODES;

EID: 64549085982     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2008.4797696     Document Type: Conference Paper

References (21)

1. C. E.. Shannon. Communication Theory and Secrecy Systems. Bell Telephone Laboratories, 1949.
2. A. D. Wyner. The Wire-tap Channel. Bell System Technical Journal, 54 (8) :1355-1387, 1975.
3. I. Csiszar and J. Korner. Broadcast Channels with Confidential Messages. IEEE Transactions on Information Theory, 24 (3) :339-348, 1978.
4. S. Leung-Yan-Cheong and M. Hellman. The Gaussian Wire-tap Channel. IEEE Transactions on Information Theory, 24 (4) :451-456, 1978.
5. A. Khisti and G. Wornell. Secure Transmission with Multiple Antennas: The MISOME Wiretap Channel. Submitted to IEEE Transactions on Information Theory, 2007.
6. S. Shafiee, N. Liu, and S. Ulukus. Towards the Secrecy Capacity of the Gaussian MIMO Wire-tap Channel: The 2-2-1 Channel. Submitted to IEEE Transactions on Information Theory, 2007.
7. F. Oggier and B. Hassibi. The Secrecy Capacity of the MIMO Wiretap Channel. IEEE International Symposium on Information Theory, 2008.
8. E. Tekin and A. Yener. The Gaussian Multiple Access Wire-tap Channel. IEEE Transaction on Information Theory, to appear, December 2008.
9. B. Nazer and M. Gastpar. The Case for Structured Random Codes in Network Capacity Theorems. European Transactions on Telecommunications, Special Issue on New Directions in Information Theory, 2008.
10. K. Narayanan, M. P. Wilson, and A. Sprintson. Joint Physical Layer Coding and Network Coding for Bi-Directional Relaying. Allerton Conference on Communication, Control, and Computing, 2007.
11. W. Nam, S-Y Chung, and Y. H. Lee. Capacity Bounds for Two-way Relay Channels. Internation Zurich Seminar on Communications, 2008.
12. G. Bresler, A. Parekh, and D. Tse. the Approximate Capacity of the Many-to-one and One-to-many Gaussian Interference Channels. Allerton Conference on Communication, Control, and Computing, 2007.
13. S. Sridharan, A. Jafarian, S. Vishwanath, and S. A. Jafar. Capacity of Symmetric K-User Gaussian Very Strong Interference Channels. 2008. http://www.citebase.org/abstract?id=oai:arXiv.org:0808.2314.
14. E. Tekin and A. Yener. Achievable Rates for Two-Way Wire-Tap Channels. International Symposium on Information Theory, 2007.
15. L. Lai, H. El Gamal, and H. V. Poor. The Wiretap Channel with Feedback: Encryption over the Channel. 2007. IEEE Transaction on Information Theory, to appear.
16. H. A. Loeliger. Averaging bounds for lattices and linear codes. IEEE Transaction on Information Theory, 43 (6) :1767-1773, 1997.
17. U. Erez and R. Zamir. Achieving 1/2 log (1+ SNR) on the AWGN Channel with Lattice Encoding and Decoding. IEEE Transactions on Information Theory, 50 (10) :2293-2314, 2004.
18. S. A. Jafar. Capacity with Causal and Non-Causal Side Information - A Unified View. IEEE Transactions on Information Theory, 52 (12) :5468-5475, 2006.
19. J. H. Conway and N. J. A. Sloane. Sphere Packings, Lattices and Groups. Springer, 1999.
20. E. Tekin and A. Yener. The General Gaussian Multiple Access and Two-Way Wire-Tap Channels: Achievable Rates and Cooperative Jamming. IEEE Transactions on Information Theory, 54 (6) :2735-2751, June 2008.
21. U. Erez, S. Litsyn, and R. Zamir. Lattices Which Are Good for (Almost) Everything. IEEE Transactions on Information Theory, 51 (10) :3401-3416, 2005.