Secure communication with side information and constrained encoding (original) (raw)

2014 6th International Symposium on Communications, Control and Signal Processing (ISCCSP), 2014

Abstract

Two main ingredients that enable wiretap codes to achieve information-theoretic secrecy are their binning structure and the randomization among multiple codewords. The presence of an infinite amount of randomness is an oversimplifying assumption which act as a hurdle that prevents the development of practical codes for wiretap channels. In this paper, we investigate the trade-off between the achievable secrecy rate and the randomness rate for wiretap channels with side information, non-causally known to the transmitter. Using the linear deterministic approach, we present insights into finding near-optimal codes under limited randomness.

Mustafa El-halabi hasn't uploaded this paper.

Let Mustafa know you want this paper to be uploaded.

Ask for this paper to be uploaded.