Strong Secrecy for Wireless Channels (Invited Talk)
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Improving wireless security through network diversity
ACM SIGCOMM Computer Communication Review
Dialog codes for secure wireless communications
IPSN '09 Proceedings of the 2009 International Conference on Information Processing in Sensor Networks
Information Theoretic Security
Foundations and Trends in Communications and Information Theory
On the throughput of secure hybrid-ARQ protocols for Gaussian block-fading channels
IEEE Transactions on Information Theory
Invertible extractors and wiretap protocols
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Tandem coding and cryptography on wiretap channels: EXIT chart analysis
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Wiretap channel type II with an active eavesdropper
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Secure communication with a Byzantine relay
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Secrecy throughput of MANETs with malicious nodes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Physical-layer security: combining error control coding and cryptography
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Two edge type LDPC codes for the wiretap channel
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
On multiuser secrecy rate in flat fading channel
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Lattice codes for the Gaussian wiretap channel
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
On the (in)security of two Joint Encryption and Error Correction schemes
International Journal of Security and Networks
Capacity-based random codes cannot achieve strong secrecy over symmetric wiretap channels
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Achievable secrecy rates for wiretap OFDM with QAM constellations
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
BUPLE: securing passive RFID communication through physical layer enhancements
RFIDSec'11 Proceedings of the 7th international conference on RFID Security and Privacy
Security and privacy issues for the network of the future
Security and Communication Networks
New Codes with Finite Length for a Wiretap Channel
Wireless Personal Communications: An International Journal
Hi-index | 754.90 |
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.