Secure communication over fading channels

IEEE Transactions on Information Theory

Volumn 54, Issue 6, 2008, Pages 2470-2492

  Liang, Yingbin ^a   Poor, H Vincent ^b   Shamai, Schlomo ^c  

^a University of Hawaii at Manoa   (United States)

^b Princeton University   (United States)

^c TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Confidential message; Ergodic capacity; Fading broadcast channel; Gaussian broadcast channel; Outage probability; Parallel broadcast channel; Power allocation; Secrecy capacity

Indexed keywords

BEAMFORMING; CHANNEL STATE INFORMATION; CODES (SYMBOLS); FADING (RADIO); FADING CHANNELS; FOOD ADDITIVES; GAUSSIAN DISTRIBUTION; INFORMATION THEORY; MICROFLUIDICS; MULTITASKING; OUTAGES; PROBABILITY; RADIO BROADCASTING; TARGETS; TRELLIS CODES; WIRELESS TELECOMMUNICATION SYSTEMS;

ADDITIVE GAUSSIAN NOISE; APPLIED (CO); BROADCAST CHANNEL (BC); CHANNEL STATE (CS); CHANNEL-STATE INFORMATION (CSI); COMMON INFORMATION; CONFIDENTIAL INFORMATION; ERGODIC; GAIN COEFFICIENTS; GAUSSIAN; OPTIMAL POWER; OUTAGE PERFORMANCES; OUTAGE PROBABILITY; POWER ALLOCATION (PA); POWER CONSTRAINTS; SECRECY CAPACITY; SECURE COMMUNICATIONS; SOURCE NODES; SUB-CHANNELS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 45249119255     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.921678     Document Type: Article

References (60)

1. A. D. Wyner, "The wiretap channel," Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355-1387, Oct. 1975.
2. S. K. Leung-Yan-Cheong and M. E. Hellman, "The Gaussian wiretap channel," IEEE Trans. Inf. Theory, vol. IT-24, no. 4, pp. 451-456, Jul. 1978.
3. P. Parada and R. Blahut, "Secrecy capacity of SIMO and slow fading channels," in Proc. IEEE Int. Symp. Information Theory (ISIT , Adelaide, Australia, Sep. 2005, pp. 2152-2155.
4. J. Barros and M. R. D. Rodrigues, "Secrecy capacity of wireless channels," in Proc. IEEE Int. Symp. Information Theory (ISIT , Seattle, WA, Jul. 2006, pp. 356-360.
5. Y. Liang and H. V. Poor, "Secure communication over fading channels," in Proc. 44th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2006, pp. 817-823.
6. Z. Li, R. Yates, and W. Trappe, "Secrecy capacity of independent parallel channels," in Proc. 44th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2006, pp. 841-848.
7. P. Gopala, L. Lai, and H. El Gamal, "On the secrecy capacity of fading channels," IEEE Trans. Inf. Theory, submitted for publication.
8. A. Khisti and G. Wornell, "The MIMOME channel," in Proc. 45th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2007, pp. 625-632.
9. F. Oggier and B. Hassibi, "The secrecy capacity of the MIMO wiretap channel," in Proc. 45th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2007, pp. 848-855.
10. T. Liu and S. Shamai (Shitz), "A note on the secrecy capacity of the multi-antenna wiretap channel," IEEE Trans. Inf. Theory, [Online]. Available: http://arxiv.org/PS_cache/arxiv/pdf/0710/ 0710.4105v1.pdf, submitted for publication
11. S. Shafiee, N. Liu, and S. Ulukus, "Towards the secrecy capacity of the Gaussian MIMO wiretap channel:THe 2-2-1 channel," IEEE Trans. Inf. Theory, submitted for publication.
12. I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339-348, May 1978.
13. R. Liu, I. Maric, P. Spasojevic, and R. Yates, "Discrete memoryless interference and broadcast channels with confidential messages: Secrecy rate region," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2493-2507, Jun. 2008.
14. R. Liu and H. V. Poor, "Secrecy capacity region of a multi-antenna Gaussian broadcast channel with confidential messages," IEEE Trans. Inf. Theory, submitted for publication.
15. J. Xu and B. Chen, "Broadcast confidential and public messages," in Proc. 42nd Conf. Information Sciences and Systems (CISS), Princeton, NJ, Mar. 2008.
16. D. Hughes-Hartogs, "The Capacity of the Degraded Spectral Gaussian Broadcast Channel," Ph.D. dissertation, Stanford Univ., Stanford, CA, 1975.
17. D. N. C. Tse, "Optimal power allocation over parallel Gaussian broadcast channels," in Proc. IEEE Int. Symp. Information Theory (ISIT), Ulm, Germany, Jun. 1997, p. 27.
18. L. Li and A. J. Goldsmith, "Capacity and optimal resource allocation for fading broadcast channels-Part I: Ergodic capacity," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 1083-1102, Mar. 2001.
19. L. Li and A. J. Goldsmith, "Capacity and optimal resource allocation for fading broadcast channels-Part II: Outage capacity," IEEE Trans. Inf. Theory, vol. 47, no. 3, pp. 1103-1127, Mar. 2001.
20. N. Jindal and A. Goldsmith, "Capacity and dirty paper coding for Gaussian broadcast channels with common information," in Proc. IEEE Int. Symp. Information Theory (ISIT), Chicago, IL, Jun./Jul. 2004, p. 215.
21. H. Yamamoto, "A coding theorem for secret sharing communication systems with two Gaussian wiretap channels," IEEE Trans. Inf. Theory, vol. 37, no. 3, pp. 634-638, May 1991.
22. G. Caire, G. Taricco, and E. Bigheri, "Optimal power control over fading channels," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1468-1489, Jul. 1999.
23. A. Carleial and M. Hellman, "A note on Wyner's wiretap channel," IEEE Trans. Inf. Theory, vol. IT-23, no. 3, pp. 387-390, May 1977.
24. S. K. Leung-Yan-Cheong, "On a special class of wiretap channels," IEEE Trans. Inf. Theory, vol. IT-23, no. 5, pp. 625-627, Sep. 1977.
25. H. Yamamoto, "Coding theorem for secret sharing communication systems with two noisy channels," IEEE Trans. Inf. Theory, vol. 35, no. 3, pp. 572-578, May 1989.
26. M. van Dijk, "On a special class of broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. 43, no. 2, pp. 712-714, Mar. 1997.
27. C. Mitrpant, A. J. H. Vinck, and Y. Luo, "An achievable region for the Gaussian wiretap channel with side information," IEEE Trans. Inf. Theory, vol. 52, no. 5, pp. 2181-2190, May 2006.
28. H. Koga and N. Sato, "On an upper bound of the secrecy capacity for a general wiretap channel," in Proc. IEEE Int. Symp. Information Theory (ISIT), Adelaide, Australia, Sep. 2005, pp. 1641-1645.
29. G. Cohen and G. Zémor, "Generalized coset schemes for the wiretap channel: Applications to biometrics," in Proc. Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 46.
30. A. Thangaraj, S. Dihidar, A. R. Calderbank, S. W. McLaughlin, and J.-M. Merolla, "Application of LDPC codes to the wiretap channel," IEEE Trans. Inf. Theory, vol. 53, no. 8, pp. 2933-2945, Aug. 2007.
31. M. Hayashi, "General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channel," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1562-1575, Apr. 2006.
32. A. Khisti, A. Tchamkerten, and G. Wornell, "Secure broadcasting," IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2453-2469, Jun. 2008.
33. M. Bloch, J. Barros, M. R. D. Rodrigues, and S. W. McLaughlin, "Wireless information-theoretic security," IEEE Trans. Inform. Theory, vol. 54, no. 6, pp. 2515-2534, 2008.
34. R. Liu, Y. Liang, H. V. Poor, and P. Spasojevic, "Secure nested codes for type II wiretap channels," in Proc. IEEE Information Theory Workshop (ITW), Lake Tahoe, CA, Sep. 2007, pp. 337-342.
35. Y. Liang, G. Kramer, H. V. Poor, and S. Shamai (Shitz), "Compound wiretap channels," in Proc. 45th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2007, pp. 136-143.
36. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography-Part I: Secret sharing," IEEE Trans. Inf. Theory vol. 39, no. 4, pp. 1121-1132, Jul. 1993.
37. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography-Part II: CR capacity," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 225-240, Jan. 1998.
38. U. M. Maurer, "Secrete key agreement by public discussion based on common information," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
39. I. Csiszár and P. Narayan, "Common randomness and secret key generation with a helper," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 344-366, Mar. 2000.
40. I. Csiszár and P. Narayan, "Secrecy capacities for mulitple terminals," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
41. I. Csiszár and P. Narayan, "Secrecy capacities for multiterminal channel models," in Proc. IEEE Int. Symp. Information Theory (ISIT) Adelaide, Australia, Sep. 2005, pp. 2138-2141.
42. U. M. Maurer and S. Wolf, "From weak to strong information-theoretic key agreement," in Proc. IEEE Int. Symp. Information Theory (ISIT) Sorrento, Italy, Jun. 2000, p. 18.
43. U. M. Maurer and S. Wolf, "Secret-key agreement over unauthenticated public channels-Part I. Definitions and a completeness result," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 822-831, Apr. 2003.
44. U. M. Maurer and S. Wolf, "Secret-key agreement over unauthenticated public channels-Part II. Privacy amplification," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 832-838, Apr. 2003.
45. U. M. Maurer and S. Wolf, "Secret-key agreement over unauthenticated public channels-Part III. Privacy amplification," IEEE Trans. Inf. Theory, vol. 49, no. 4, pp. 839-851, Apr. 2003.
46. S. Venkatesan and V. Anantharam, "The common randomness capacity of a pair of independent discrete memoryless channels," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 215-224, Jan. 1998.
47. S. Venkatesan and V. Anantharam, "The common randomness capacity of a network of discrete memoryless channels," IEEE Trans. Inf. Theory vol. 46, no. 2, pp. 367-387, Mar. 2000.
48. Y. Liang and H. V. Poor, "Multiple access channels with confidential messages," IEEE Trans. Inf. Theory, vol. 54, no. 3, pp. 976-1002, Mar. 2008.
49. R. Liu, I. Marie, R. Yates, and P. Spasojevic, "The discrete memoryless multiple access channel with confidential messages," in Proc. IEEE Int. Symp. Information Theory (ISIT), Seattle, WA, Jul. 2006, pp. 957-961.
50. E. Tekin and A. Yener, "The Gaussian multiple access wiretap channel," IEEE Trans. Inf. Theory, submitted for publication.
51. E. Tekin and A. Yener, "Achievable rates for the general Gaussian multiple access wiretap channel with collective secrecy," in Proc. 44th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2006, pp. 809-816.
52. Y. Oohama, "Coding for relay channels with confidential messages," in Proc. IEEE Information Theory Workshop (ITW), Cairns, Australia, Sep. 2001, pp. 87-89.
53. Y. Oohama, "Relay channels with confidential messages," IEEE Trans. Information Theory, to be published.
54. L. Lai and H. El Gamal, "Cooperative secrecy: The relay-eaves-dropper channel," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 931-935, The extended journal version "The relay-eavesdropper channel: Cooperation for secrecy," was submitted for publication in IEEE Trans. Inf. Theory..
55. X. He and A. Yener, "Secrecy when the relay is the eavesdropper," in Proc. 3rd Information Theory and Applications Workshop, San Diego, CA, Jan. 2008, to be published.
56. M. Yuksel and E. Erkip, "Secure communication with a relay helping the wiretapper," in Proc. IEEE Information Theory Workshop (ITW , Lake Tahoe, CA, Sep. 2007, pp. 595-600.
57. Y. Liang, A. Somekh-Baruch, H. V. Poor, S. Shamai (Shitz), and S. Verdú, "Cognitive interference channels with confidential messages," in Proc. 45th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, Sep. 2007, pp. 1-6.
58. A. A. El Gamal, "Capacity of the product and sum of two unmatched broadcast channels," Probl. Inf. Transm., vol. 16, no. 1, pp. 1-16, Jan. -Mar. 1980.
59. T. M. Cover and J. A.Tbomas, Elements of Information Theory. New York: Wiley, 1991.
60. Y. Liang, V. V. Veeravalli, and H. V. Poor, "Resource allocation for wireless fading relay channels: Max-min solution," IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3432-3453, Oct. 2007.