Strong secrecy on the binary erasure wiretap channel using large-girth LDPC codes

IEEE Transactions on Information Forensics and Security

Volumn 6, Issue 3 PART 1, 2011, Pages 585-594

  Subramanian, Arunkumar ^a   Thangaraj, Andrew ^b   Bloch, Matthieu ^c   McLaughlin, Steven W ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^c GEORGIA TECH LORRAINE   (France)

Author keywords

Binary erasure channels; density evolution; information theoretic security; large girth; low density parity check (LDPC) codes; secrecy capacity; strong secrecy; wiretap channels

Indexed keywords

BINARY ERASURE CHANNEL; DENSITY EVOLUTION; INFORMATION-THEORETIC SECURITY; LARGE GIRTH; LOW-DENSITY PARITY-CHECK CODES; SECRECY CAPACITY; STRONG SECRECY; WIRETAP CHANNEL;

CODING ERRORS; ERROR CORRECTION; INFORMATION THEORY; PROBABILITY;

CHANNEL CODING;

EID: 80051775152     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2011.2148715     Document Type: Article

References (38)

1. C. Shannon, "Communication theory of secrecy systems", Bell Syst. Tech. J., vol. 28, pp. 656-715, Oct. 1949.
2. A. D. Wyner, "The wire-tap channel", Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355-1367, Oct. 1975.
3. 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.
4. U. M. Maurer and S. Wolf, "Information-theoretic key agreement: From weak to strong secrecy for free", in Advances in Cryptology-Eurocrypt 2000, ser. Lecture Notes in Computer Science, B. Preneel, Ed. Berlin, Heidelberg, Germany: Springer, 2000, vol. 1807, pp. 351-368.
5. I. Csiszár, "Almost independence and secrecy capacity", Problems of Information Transmission, vol. 32, no. 1, pp. 40-47, Jan.-Mar. 1996.
6. R. Liu, Y. Liang, H. V. Poor, and P. Spasojevic, "Secure nested codes for type II wiretap channels", in Proc. IEEE Information Theory Workshop, Lake Tahoe, CA, Sep. 2007, pp. 337-342.
7. L. H. Ozarow and A. D. Wyner, "Wire-tap channel II", Bell Labs Tech. J., vol. 63, no. 10, pp. 2135-2157, Dec. 1984.
8. V. Rathi, M. Andersson, R. Thobaben, J. Kliewer, and M. Skoglund, "Two edge type LDPC codes for the wiretap channel", in Proc. 2009 Conf. Record of the Forty-Third Asilomar Conf. Signals, Systems and Computers, 2009, pp. 834-838.
9. V. Rathi, M. Andersson, R. Thobaben, J. Kliewer, and M. Skoglund, "Performance analysis and design of two edge type LDPC codes for the BEC wiretap channel", IEEE Trans. Inf. Theory, 2010, submitted for publication.
10. M. Bloch and J. Barros, Physical-Layer Security: From Information Theory to Security Engineering. Cambridge, U. K.: Cambridge Univ. Press, 2011.
11. 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.
12. A. Thangaraj, S. Dihidar, A. Calderbank, S. McLaughlin, and J.-M. Merolla, "Applications of LDPC codes to the wiretap channel", IEEE Trans. Inf. Theory, vol. 53, no. 8, pp. 2933-2945, Aug. 2007. (Pubitemid 47249863)
13. A. T. Suresh, A. Subramanian, A. Thangaraj, M. Bloch, and S. W. McLaughlin, "Strong secrecy for erasure wiretap channels", in Proc. IEEE Information Theory Workshop, 2010 (ITW 2010), Aug. 2010 [Online]. Available: http://arxiv.org/abs/1004.5540
14. 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. (Pubitemid 40377559)
15. A. Lubotzky, R. Phillips, and P. Sarnak, "Ramanujan graphs", Combinatorica, vol. 8, no. 3, pp. 261-277, 1988.
16. H. Mahdavifar and A. Vardy, "Achieving the secrecy capacity of wiretap channels using polar codes", in Proc. 2010 IEEE Int. Symp. Information Theory Proceedings (ISIT), Jun. 2010, pp. 913-917.
17. E. Hof and S. Shamai, "Secrecy-achieving polar-coding", in Proc. IEEE Information Theory Workshop, 2010 (ITW 2010), 2010 [Online]. Available: http://arxiv.org/abs/1005.2759
18. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms (MIT Electrical Engineering and Computer Science). Cambridge, MA: MIT Press, 1990.
19. T. Richardson and R. Urbanke, Modern Coding Theory. Cambridge, U. K.: Cambridge Univ. Press, 2008.
20. M. Lentmaier, D. Truhachev, K. Zigangirov, and D. Costello, "An analysis of the block error probability performance of iterative decoding", IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3834-3855, Nov. 2005. (Pubitemid 41622584)
21. S. B. Korada and R. L. Urbanke, "Exchange of limits: Why iterative decoding works", IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2169-2187, Apr. 2011.
22. P. Wong, "Cages-A survey", J. Graph Theory, vol. 6, no. 1, pp. 1-22, 1982.
23. P. Erdos and H. Sachs, "Reguläre graphen gegebener taillenweite mit minimaler knotenzahl (Regular graphs with given girth and minimal number of nodes)", Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math. Natur. Reihe, vol. 12, pp. 251-257, 1963.
24. N. Sauer, "Extremaleigenschaften regulärer graphen gegebener taillenweite (Extremal regular graphs of a given girth), I and II, sitzungsberichteosterreich", Acad. Wiss. Math. Natur. Kl., SB II, vol. 176, pp. 9-25, 1967.
25. B. Bollobas, Extremal Graph Theory. New York: Dover, 2004.
26. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
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. (Pubitemid 40151893)
28. L. S. Chandran, "A high girth graph construction", SIAM J. Discret. Math., vol. 16, no. 3, pp. 366-370, 2003.
29. K. M. Krishnan, R. Singh, L. S. Chandran, and P. Shankar, "A combinatorial family of near regular LDPC codes", in IEEE Int. Symp. Information Theory, 2007 (ISIT 2007), Jun. 2007, pp. 761-765.
30. F. Lazebnik and V. A. Ustimenko, "Explicit construction of graphs with an arbitrary large girth and of large size", Discrete Appl. Math., vol. 60, no. 1-3, pp. 275-284, 1995.
31. F. Lazebnik, V. Ustimenko, and A. Woldar, "A new series of dense graphs of high girth", Amer. Math. Soc., vol. 32, no. 1, 1995.
32. J.-L. Kim, U. Peled, I. Perepelitsa, V. Pless, and S. Friedland, "Explicit construction of families of LDPC codes with no 4-cycles", IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2378-2388, Oct. 2004.
33. G. Margulis, "Explicit constructions of graphs without short cycles and low density codes", Combinatorica, vol. 2, no. 1, pp. 71-78, 1982.
34. J. Rosenthal and P. Vontobel, "Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis", in Proc. 2001 IEEE Int. Symp. Information Theory, 2001, pp. 4-4.
35. G. Davidoff, P. Sarnak, and A. Valette, Elementary Number Theory, Group Theory and Ramanujan Graphs (London Mathematical Society Student Texts). Cambridge, U. K.: Cambridge Univ. Press, 2003.
36. T. M. Apostol, Introduction to Analytic Number Theory (Undergraduate Texts in Mathematics). New York: Springer, 1976.
37. P. Oswald and A. Shokrollahi, "Capacity-achieving sequences for the erasure channel", IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
38. R. Urbanke and A. Amraoui, LDPCOPT-A Fast and Accurate Degree Distribution Optimizer for LDPC Code Ensembles Jun. 2010 [Online]. Available: http://ipgdemos.epfl.ch/ldpcopt/