NDLI: Applications of LDPC Codes to the Wiretap Channel

Content Provider	IEEE Xplore Digital Library
Author	Thangaraj, A. Dihidar, S. Calderbank, A.R. McLaughlin, S.W. Merolla, J-M.
Copyright Year	1963
Abstract	With the advent of quantum key distribution (QKD) systems, perfect (i.e., information-theoretic) security can now be achieved for distribution of a cryptographic key. QKD systems and similar protocols use classical error-correcting codes for both error correction (for the honest parties to correct errors) and privacy amplification (to make an eavesdropper fully ignorant). From a coding perspective, a good model that corresponds to such a setting is the wire tap channel introduced by Wyner in 1975. In this correspondence, we study fundamental limits and coding methods for wire tap channels. We provide an alternative view of the proof for secrecy capacity of wire tap channels and show how capacity achieving codes can be used to achieve the secrecy capacity for any wiretap channel. We also consider binary erasure channel and binary symmetric channel special cases for the wiretap channel and propose specific practical codes. In some cases our designs achieve the secrecy capacity and in others the codes provide security at rates below secrecy capacity. For the special case of a noiseless main channel and binary erasure channel, we consider encoder and decoder design for codes achieving secrecy on the wiretap channel; we show that it is possible to construct linear-time decodable secrecy codes based on low-density parity-check (LDPC) codes that achieve secrecy.
Sponsorship	IEEE Information Theory Society
Starting Page	2933
Ending Page	2945
Page Count	13
File Size	523876
File Format	PDF
ISSN	00189448
Volume Number	53
Issue Number	8
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-08-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Parity check codes Information security Wire Error correction codes Decoding Communication system security Cryptography Cryptographic protocols Privacy Mutual information wire tap channels Binary erasure channels low-density parity-check (LDPC) codes secrecy capacity secrecy codes
Content Type	Text
Resource Type	Article
Subject	Library and Information Sciences Information Systems Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes

New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Generalized and Doubly Generalized LDPC Codes With Random Component Codes for the Binary Erasure Channel

Wireless Information-Theoretic Security

Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel

Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints

Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel

Performance of low-density parity-check codes with linear minimum distance

Applications of LDPC Codes to the Wiretap Channel

Similar Documents

Strong Secrecy on the Binary Erasure Wiretap Channel Using Large-Girth LDPC Codes

New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Generalized and Doubly Generalized LDPC Codes With Random Component Codes for the Binary Erasure Channel

Wireless Information-Theoretic Security

Bounds on the Number of Iterations for Turbo-Like Ensembles Over the Binary Erasure Channel

Generalized Low-Density Parity-Check Codes Based on Hadamard Constraints

Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel

Performance of low-density parity-check codes with linear minimum distance

Applications of LDPC Codes to the Wiretap Channel