Error-Control Coding for Physical-Layer Secrecy

Proceedings of the IEEE

Volumn 103, Issue 10, 2015, Pages 1725-1746

  Bloch, Matthieu ^a   Hayashi, Masahito ^b,c   Thangaraj, Andrew ^d  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b NAGOYA UNIVERSITY   (Japan)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^d INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

Author keywords

Channel resolvability; error control coding; physical layer security; privacy amplification

Indexed keywords

ERRORS; NETWORK LAYERS; RANDOM PROCESSES; STOCHASTIC SYSTEMS;

AMOUNT OF INFORMATION; CHANNEL RESOLVABILITY; ERROR CONTROL CODE; ERROR CONTROL CODING; PHYSICAL LAYER SECURITY; PHYSICAL-LAYER SECRECIES; PRACTICAL SYSTEMS; PRIVACY AMPLIFICATION;

CODES (SYMBOLS);

EID: 84960154985     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/JPROC.2015.2463678     Document Type: Article

References (87)

1. A. D. Wyner, "The wire-tap channel," Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355-1367, Oct. 1975.
2. R. Ahlswede and I. Csiszár, "Common randomness in information theory and cryptography. I. Secret sharing," IEEE Trans. Inf. Theory, vol. 39, no. 4, pp. 1121-1132, Jul. 1993.
3. U. Maurer, "Secret key agreement by public discussion from common information," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
4. T. Han and S. Verdú, "Approximation theory of output statistics," IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 752-772, May 1993.
5. C. H. Bennett, G. Brassard, C. Crépeau, and U. Maurer, "Generalized privacy amplification," IEEE Trans Inf. Theory, vol. 41, no. 6, pp. 1915-1923, Nov. 1995.
6. C. E. Shannon, "Communication theory of secrecy systems," Bell Syst. Tech. J., vol. 28, pp. 656-715, 1948.
7. I. Csiszár and J. Körner, "Broadcast channels with confidential messages," IEEE Trans Inf. Theory, vol. 24, no. 3, pp. 339-348, May 1978.
8. M. N. Wegman and J. Carter, "New hash functions and their use in authentication and set equality," J. Comput. Sci. Syst., vol. 22, pp. 265-279, 1981.
9. S. Arimoto, "On the converse to the coding theorem for discrete memoryless channels," IEEE Trans Inf. Theory, vol. IT-19, no. 3, pp. 357-359, May 1973.
10. D. Klinc, J. Ha, S. W. McLaughlin, J. Barros, and B.-J. Kwak, "LDPC codes for the Gaussian wiretap channel," IEEE Trans Inf. Forens. Security, vol. 6, no. 3, pp. 532-540, Sep. 2011.
11. M. Baldi, M. Bianchi, and F. Chiaraluce, "Coding with scrambling, concatenation, HARQ for the AWGN wire-tap channel: A security gap analysis," IEEE Trans Inf. Forens. Security, vol. 7, no. 3, pp. 883-894, Jun. 2012.
12. S. K. Leung-Yan-Cheong and M. E. Hellman, "The Gaussian wire-tap channel," IEEE Trans Inf. Theory, vol. IT-24, no. 4, pp. 451-456, Jul. 1978.
13. Y. Liang, H. V. Poor, and S. Shamai, Information-Theoretic Security, ser. Foundations and Trends in Communications and Information Theory, vol. 5. Delft, The Netherlands: Now Publishers, 2009, no. 1-5.
14. M. Bloch and J. Barros, Physical Layer Security: From Information Theory to Security Engineering. Cambridge, U.K.: Cambridge Univ. Press, 2011.
15. U. Maurer, "The strong secret key rate of discrete random triples," in Communications and Cryptography: Two Sides of One Tapestry. Norwell, MA, USA: Kluwer, 1994, pp. 271-285.
16. M. Bellare, S. Tessaro, and A. Vardy, "Semantic security for the wiretap channel," in Advances in Cryptology-CRYPTO 2012, vol. 7417, R. Safavi-Naini and R. Canetti, Eds. Berlin, Germany: Springer-Verlag, 2012, pp. 294-311.
17. S. Goldwasser and S. Micali, "Probabilistic encryption," J. Comput. Syst. Sci., vol. 28, no. 2, pp. 270-299, 1984.
18. R. Bassily et al., "Cooperative security at the physical layer: A summary of recent advances," IEEE Signal Process. Mag., vol. 30, no. 5, pp. 16-28, Sep. 2013.
19. K. Yasui, T. Suko, and T. Matsushima, "An algorithm for computing the secrecy capacity of broadcast channels with confidential messages," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, 2007, pp. 936-940.
20. K. R. Gowtham and A. Thangaraj, "Computation of secrecy capacity for more-capable channel pairs," in Proc. IEEE Int. Symp. Inf. Theory, Toronto, ON, Canada, 2008, pp. 529-533.
21. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes, 2nd ed. Amsterdam, The Netherlands: North-Holland, 1978.
22. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge, U.K.: Cambridge Univ. Press, 2008.
23. E. Arikan, "Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels," IEEE Trans Inf. Theory, vol. 55, no. 7, pp. 3051-3073, Jul. 2009.
24. W. E. Ryan and S. Lin, Channel Codes. Classical and Modern. Cambridge, U.K.: Cambridge Univ. Press, 2009.
25. D. Divsalar, S. Dolinar, C. Jones, and K. Andrews, "Capacity-approaching protograph codes," IEEE J. Sel. Areas Commun., vol. 27, no. 6, pp. 876-888, Aug. 2009.
26. A. Pradhan, A. Subramanian, and A. Thangaraj, "Deterministic constructions for large girth protograph LDPC codes," in Proc. IEEE Int. Symp. Inf. Theory, Istanbul, Turkey, Jul. 2013, pp. 1680-1684.
27. X.-Y. Hu, E. Eleftheriou, and D. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
28. J. Thrope, "Low-density parity-check (LDPC) codes constructed from protographs," INP Progr. Rep., vol. 53, no. 8, pp. 42-154, Aug. 2005.
29. L. Lan et al., "Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: A finite field approach," IEEE Trans Inf. Theory, vol. 53, no. 7, pp. 2429-2458, Jul. 2007.
30. S. P. Vadhan, Pseudorandomness, ser. Foundations and Trends in Communications and Information Theory, vol. 7. Delft, The Netherlands: Now Publishers, 2012, no. 1-3.
31. Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, "Fuzzy extractors: How to generate strong keys from biometrics and other noisy data," SIAM J. Comput., vol. 38, no. 1, pp. 97-139, 2008.
32. S. Kudekar, T. Richardson, and R. Urbanke, "Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC," IEEE Trans Inf. Theory, vol. 57, no. 2, pp. 803-834, Feb. 2011.
33. A. Thangaraj, S. Dihidar, A. R. Calderbank, S. W. McLaughlin, and J.-M. Merolla, "Applications of LDPC codes to the wiretap channels," IEEE Trans Inf. Theory, vol. 53, no. 8, pp. 2933-2945, Aug. 2007.
34. L. H. Ozarow and A. D. Wyner, "Wiretap channel II," AT&T Bell Lab. Tech. J., vol. 63, no. 10, pp. 2135-2157, Dec. 1984.
35. R. Liu, Y. Liang, H. V. Poor, and P. Spasojević, "Secure nested codes for type II wiretap channels," in Proc. IEEE Inf. Theory Workshop, Lake Tahoe, CA, USA, Sep. 2007, pp. 337-342.
36. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. New York, NY, USA: Wiley-Interscience, 2006.
37. I. Csiszár, "Almost independence and secrecy capacity," Probl. Inf. Transm., vol. 32, no. 1, pp. 40-47, Jan.-Mar. 1996.
38. I. Devetak, "The private classical capacity and quantum capacity of a quantum channel," IEEE Trans Inf. Theory, vol. 51, no. 1, pp. 44-55, Jan. 2005.
39. M. Hayashi, "General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channels," IEEE Trans Inf. Theory, vol. 52, no. 4, pp. 1562-1575, Apr. 2006.
40. M. R. Bloch and J. N. Laneman, "Strong secrecy from channel resolvability," IEEE Trans Inf. Theory, vol. 59, no. 12, pp. 8077-8098, Dec. 2013.
41. J. Hou and G. Kramer, "Effective secrecy: Reliability, confusion and stealth," in Proc. IEEE Int. Symp. Inf. Theory, Honolulu, HI, USA, Jul. 2014, pp. 601-604.
42. T. S. Han, H. Endo, and M. Sasaki, "Reliability and secrecy functions of the wiretap channel under cost constraint," IEEE Trans Inf. Theory, vol. 60, no. 11, pp. 6819-6843, Nov. 2014.
43. A. Wyner, "The common information of two dependent random variables," IEEE Trans Inf. Theory, vol. IT-21, no. 2, pp. 163-179, Mar. 1975.
44. P. Cuff, "Distributed channel synthesis," IEEE Trans Inf. Theory, vol. 59, no. 11, pp. 7071-7096, Nov. 2013.
45. H. Mahdavifar and A. Vardy, "Achieving the secrecy capacity of wiretap channels using polar codes," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, USA, Jun. 2010, pp. 913-917.
46. E. Hof and S. Shamai, "Secrecy-achieving polar-coding," in Proc. IEEE Inf. Theory Workshop, Dublin, Ireland, Sep. 2010.
47. O. O. Koyluoglu and H. E. Gamal, "Polar coding for secure transmission and key agreement," in Proc. IEEE Int. Symp. Pers. Indoor Mobile Radio Commun., Istambul, Turkey, Sep. 2010, pp. 2698-2703.
48. M. Andersson, V. Rathi, R. Thobaben, J. Kliewer, and M. Skoglund, "Nested polar codes for wiretap and relay channels," IEEE Commun. Lett., vol. 14, no. 4, pp. 752-754, Jun. 2010.
49. V. Rathi, M. Andersson, R. Thobaben, J. Kliewer, and M. Skoglund, "Two edge type LDPC codes for the wiretap channel," in Proc. 43rd Asilomar Conf. Signals Syst. Comput., Monticello, IL, USA, 2009, pp. 834-838.
50. M. Andersson, V. Rathi, R. Thobaben, J. Kliewer, and M. A. Skoglund, "Equivocation of Eve using two edge type LDPC codes for the binary erasure wiretap channel," in Proc. 44th Asilomar Conf. Signals Syst. Comput., 2010, pp. 2045-2049.
51. A. J. Pierrot and M. R. Bloch, "LDPC-based coded cooperative jamming codes," in Proc. IEEE Inf. Theory Workshop, Lausanne, Switzerland, Sep. 2012, pp. 462-466.
52. H. Mahdavifar and A. Vardy, "Achieving the secrecy capacity of wiretap channels using polar codes," IEEE Trans Inf. Theory, vol. 57, no. 10, pp. 6428-6443, Oct. 2011.
53. J. Renes and R. Renner, "Noisy channel coding via privacy amplification and information reconciliation," IEEE Trans Inf. Theory, vol. 57, no. 11, pp. 7377-7385, Nov. 2011.
54. M. H. Yassaee, M. R. Aref, and A. Gohari, "Achievability proof via output statistics of random binning," in Proc. IEEE Int. Symp. Inf. Theory, Boston, MA, USA, Jul. 2012, pp. 1044-1048.
55. D. Slepian and J. K. Wolf, "Noiseless coding of correlated information sources," IEEE Trans Inf. Theory, vol. IT-19, no. 4, pp. 471-480, Jul. 1973.
56. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2011.
57. A. T. Suresh, A. Subramanian, A. Thangaraj, M. Bloch, and S. McLaughlin, "Strong secrecy for erasure wiretap channels," in Proc. IEEE Inf. Theory Workshop, Dublin, Ireland, Sep. 2010.
58. A. Orlitsky, K. Viswanathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans Inf. Theory, vol. 51, no. 3, pp. 929-953, Mar. 2005.
59. A. Subramanian, A. Thangaraj, M. Bloch, and S. McLaughlin, "Strong secrecy on the binary erasure wiretap channel using large-girth LDPC codes," IEEE Trans Inf. Forens. Security, vol. 6, no. 3, pp. 585-594, Sep. 2011.
60. E. Sasoglu and A. Vardy, "A new polar coding scheme for strong security on wiretap channels," in Proc. IEEE Int. Symp. Inf. Theory, Istanbul, Turkey, 2013, pp. 1117-1121.
61. M. R. Bloch, L. Luzzi, and J. Kliewer, "Strong coordination with polar codes," in Proc. 50th Allerton Conf. Commun. Control Comput., Monticello, IL, USA, Oct. 2012, pp. 565-571.
62. I. Tal and A. Vardy, "How to construct polar codes," IEEE Trans Inf. Theory, vol. 59, no. 10, pp. 6562-6582, Oct. 2013.
63. M. Hayashi and R. Matsumoto, "Secure multiplex coding with dependent and non-uniform multiple messages, 2012. [Online]. Available: http://arxiv.org/abs/1202.1332.
64. G. Van Assche, J. Cardinal, and N. J. Cerf, "Reconciliation of a quantum-distributed Gaussian key," IEEE Trans Inf. Theory, vol. 50, no. 2, pp. 394-400, Feb. 2004.
65. M. Hayashi and T. Tsurumaru, "More efficient privacy amplification with less random seeds via dual universal Hash function, 2013. [Online]. Available: http://arxiv.org/abs/1311.5322.
66. I. Tal and A. Vardy, "Channel upgrading for semantically-secure encryption on wiretap channels," in Proc. IEEE Int. Symp. Inf. Theory, Istanbul, Turkey, 2013, pp. 1561-1565.
67. M. Hayashi, "Exponential decreasing rate of leaked information in universal random privacy amplification," IEEE Trans Inf. Theory, vol. 57, no. 6, pp. 3989-4001, Jun. 2011.
68. D. Kobayashi, H. Yamamoto, and T. Ogawa, "Secure multiplex coding attaining channel capacity in wiretap channels," IEEE Trans Inf. Theory, vol. 59, no. 12, pp. 8131-8143, Dec. 2013.
69. T. Gulcu and A. Barg, "Achieving secrecy capacity of the wiretap channel and broadcast channel with a confidential component," 2014. [Online]. Available: http://arxiv.org/abs/1410.3422.
70. R. A. Chou and M. R. Bloch, "Polar coding for the broadcast channel with confidential messages and constrained randomization," IEEE Trans Inf. Theory, Oct. 2014. [Online]. Available: http://arxiv.org/abs/1411.0281.
71. J. Muramatsu and S. Miyake, "Construction of wiretap channel codes by using sparse matrices," in Proc. IEEE Inf. Theory Workshop, Taormina, Sicily, Oct. 2009, pp. 105-109.
72. J. Muramatsu, "Channel coding and lossy source coding using a generator of constrained random numbers," IEEE Trans Inf. Theory, vol. 60, no. 5, pp. 2667-2686, May 2014.
73. E. Arikan, "Source polarization," in Proc. IEEE Int. Symp. Inf. Theory, Austin, TX, USA, 2010, pp. 899-903.
74. R. A. Chou, M. R. Bloch, and E. Abbe, Polar coding for secret-key generation, 2013. [Online]. Available: http://arxiv.org/abs/1305.4746.
75. E. Tekin and A. Yener, "The general Gaussian multiple-access and two-way wiretap channels: Achievable rates and cooperative jamming," IEEE Trans Inf. Theory, vol. 54, no. 6, pp. 2735-2751, Jun. 2008.
76. X. He and A. Yener, "Secrecy when the eavesdropper controls its channel states," in Proc. IEEE Int. Symp. Inf. Theory, Saint Petersburg, Russia, 2011, pp. 618-622.
77. A. J. Pierrot and M. R. Bloch, "Strongly secure communications over the two-way wiretap channel," IEEE Trans Inf. Forens. Security, vol. 6, no. 3, pp. 595-605, Sep. 2011.
78. X. He and A. Yener, "Providing secrecy irrespective of eavesdropper's channel state," in Proc. IEEE Global Telecommun. Conf., Miami, FL, USA, 2010.
79. X. He and A. Yener, "Providing secrecy when the eavesdropper channel is arbitrarily varying: A case for multiple antennas," in Proc. 48th Annu. Allerton Conf. Commun. Control Comput., Monticello, IL, USA, 2010, pp. 1228-1235.
80. X. He and A. Yener, "MIMO wiretap channels with unknown and varying eavesdropper channel states," IEEE Trans Inf. Theory, vol. 60, no. 11, pp. 6844-6869, Nov. 2014.
81. E. yazoʇlu, "Polar codes for discrete alphabets," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, 2012, pp. 2137-2141.
82. C. Ling, L. Luzzi, J.-C. Belfiore, and D. Stehl, "Semantically secure lattice codes for the Gaussian wiretap channel, October 2012. [Online]. Available: http://arxiv.org/abs/1210.6673.
83. T. S. Han, "Folklore in source coding: Information-spectrum approach," IEEE Trans Inf. Theory, vol. 51, no. 2, pp. 747-753, Feb. 2005.
84. M. Hayashi, "Second-order asymptotics in fixed-length source coding and intrinsic randomness," IEEE Trans Inf. Theory, vol. 54, no. 10, pp. 4619-4637, Oct. 2008.
85. M. R. Bloch and J. Kliewer, "On secure communication with constrained randomization," in Proc. IEEE Int. Symp. Inf. Theory, Cambridge, MA, USA, Jul. 2012, pp. 1172-1176.
86. K. Zhang, M. Tomlinson, M. Ahmed, M. Ambroze, and M. Rodrigues, "Best binary equivocation code construction for syndrome coding," IET Commun., vol. 8, no. 10, pp. 1696-1704, Jul. 2014.
87. S. Watanabe and M. Hayashi, "Strong converse and second-order asymptotics of channel resolvability," in Proc. IEEE Int. Symp. Inf. Theory, Honolulu, HI, USA, 2014, pp. 1882-1886.