The Gaussian multiple access wire-tap channel: Wireless secrecy and cooperative jamming

2007 Information Theory and Applications Workshop, Conference Proceedings, ITA

Volumn , Issue , 2007, Pages 404-413

  Tekin, Ender ^a   Yener, Aylin ^a  

^a The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE RATES; CAPACITY REGIONS; CODE-WORDS; GAUSSIAN; GAUSSIAN CODEBOOKS; GAUSSIAN MULTIPLE ACCESS CHANNELS; MULTI-ACCESS; MULTIPLE ACCESS; MULTIPLE USERS; NUMERICA L RESULTS; OUTER BOUNDS; POWER ALLOCATIONS; SUM-CAPACITY; WIRE-TAP CHANNEL;

CYBERNETICS; ELECTRONIC WARFARE; INFORMATION THEORY; JAMMING; MILITARY OPERATIONS; SIGNAL RECEIVERS; WIRE;

TRELLIS CODES;

EID: 48049102969     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2007.4357611     Document Type: Conference Paper

References (29)

1. C. E. Shannon, "Communication theory of secrecy systems," Bell Sys. Tech. J., vol. 28, pp. 656-715, 1949.
2. A. Wyner, "The wire-tap channel," Bell Sys. Tech. J., vol. 54, pp. 1355-1387, 1975.
3. A. B. Carleial and M. E. Hellman, "A note on Wyner's wiretap channel," IEEE Tram. Inform. Theory, vol. 23, no. 3, pp. 387-390, May 1977.
4. S. K. Leung-Yan-Cheong and M. E. Hellman, "Gaussian wire-tap channel," IEEE Trans. Inform. Theory, vol. 24, no. 4, pp. 451-456, July 1978.
5. I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. Inform. Theory, vol. 24, no. 3, pp. 339-348, May 1978.
6. U. Maurer and S. Wolf, "Information-theoretic key agreement: From weak to strong secrecy for free," in Proceedings of EURO CRYPT 2000, Lecture Notes in Computer Science, vol. 1807. Springer-Verlag, 2000, pp. 351-368.
7. U. M. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inform. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
8. C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer, "Generalized privacy amplification," IEEE Trans. Inform. Theory, vol. 41, no. 6, pp. 1915-1923, November 1995.
9. R. Ahslwede and I. Csiszár, "Common randomness in information theory and cryptography, part I: Secret sharing," IEEE Trans. Inform. Theory, vol. 39, no. 4, pp. 1121-1132, July 1993.
10. _ , "Common randomness in information theory and cryptography, part II: CR capacity," IEEE Trans. Inform, Theory, vol. 44, no. 1, pp. 225-240, January 1998.
11. I. Csiszár and P. Narayan, "Common randomness and secret key generation with a helper," IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 344-366, March 2000.
12. _ , "Secrecy capacities for multiple terminals," IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3047-3061, December 2004.
13. S. Venkatesan and V. Anantharam, "The common randomness capacity of a pair of independent discrete memoryless channels," IEEE Trans. Inform. Theory, vol. 44, no. 1, pp. 215-224, January 1998.
14. _ , "The common randomness capacity of a network of discrete memoryless channels," IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 367-387, March 2000.
15. H. Yamamoto, "On secret sharing communication systems with two or three channels," IEEE Trans. Inform. Theory, vol. 32, no. 3, pp. 387-393, May 1986.
16. _ , "A coding theorem for secret sharing communication systems with two Gaussian wiretap channels," IEEE Trans. Inform. Theory, vol. 37, no. 3, pp. 634 - 638, May 1991.
17. Y. Oohama, "Coding for relay channels with confidential messages," in Proc. IEEE Inform. Theory Workshop (ITW), 2001, pp. 87 - 89.
18. J. Barros and M. R. D. Rodrigues, "Secrecy capacity of wireless channels," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Seattle, WA, July 9-14 2006.
19. Y Liang and V. Poor, "Secure communication over fading channels," in Proc. Allerton Conf. Commun., Contr, Comput., Monticello, IL, September 27-29 2006.
20. L. Zang, R. Yates, and W. Trappe, "Secrecy capacity of independent parallel channels," in Proc. Allerton Conf. Commun., Contr., Comput., Monticello, IL, September 27-29 2006.
21. R. Liu, I. Marie, R. D. Yates, and P. Spasojevic, "Discrete memoryless interference and broadcast channels with confidential messages," in Proc. Allerton Conf. Commun., Contr., Comput., Monticello, IL, September 27-29 2006.
22. Y. Liang and V. Poor, "Generalized multiple access channels with confidential messages," IEEE Trans. Inform. Theory, submitted for publication, conference version presented at ISIT'06. [Online.] Available: http://arxiv.org/format/cs.IT/0605014.
23. R. Liu, I. Marie, R. D. Yates, and P. Spasojevic, "The discrete memoryless multiple access channel with confidential messages," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Seattle, WA, July 9-14 2006.
24. E. Tekin, S. Şerbetli, and A. Yener, "On secure signaling for the Gaussian multiple access wire-tap channel," in Proc. ASILOMAR Conf. Sig., Syst, Comp., Asilomar, CA, November 2005.
25. E. Tekin and A. Yener, "The Gaussian multiple-access wire-tap channel with collective secrecy constraints," in Proc. IEEE Int. Symp. Inform. Theory (ISIT), Seattle, WA, July 9-14, 2006.
26. _ , "The Gaussian multiple-access wire-tap channel," IEEE Trans. Inform Theory, submitted for publication, [Online.] Available: http://arxiv.org/format/cs.IT/0605028.
27. _ , "Achievable rates for the general gaussian multiple access wire-tap channel with collective secrecy," in Proc. Allerton Conf. Commun., Contr., Comput, Monticello, IL, September 27-29 2006.
28. _ , "The general Gaussian multiple-access and two-way wire-tap channels: Achievable rates and cooperative jamming," IEEE Trans. Inform. Theory, submitted for publication February 2007.
29. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: John Wiley & Sons, 1991.