Channel scrambling for secrecy

Authors:
Matthieu Bloch
Affiliations:
Department of Electrical Engineering, University of Notre Dame, Notre Dame, IN
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 4
Cited 0

MIMO Gaussian broadcast channels with confidential messages

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Information-theoretic key agreement: from weak to strong secrecy for free

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
The General Gaussian Multiple-Access and Two-Way Wiretap Channels: Achievable Rates and Cooperative Jamming

IEEE Transactions on Information Theory
The Wiretap Channel With Feedback: Encryption Over the Channel

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

We investigate the fundamental limits of secure communication over a wiretap channel in which the legitimate receiver is able to scramble the state of the channel. We provide simple single-letter bounds for secrecy capacity, which are useful in several instances. For the full-duplex Gaussian case, we show that jamming with Gaussian noise yields rates within at most 0.5 bits per channel use of secrecy capacity. For the half-duplex binary symmetric channel, we show that jamming is strictly suboptimal in certain regimes.