IEEE International Symposium on Information Theory (ISIT)

Secrecy capacity of the first-order autoregressive moving average Gaussian channel with feedback

Chong Li, Yingbin Liang

Published Jun 1, 2017• 3 citations

Abstract

In this paper, we consider the first-order autoregressive moving average Gaussian channel with perfect causal feedback where an eavesdropper receives noisy observations of the channel inputs and outputs. We show that the secrecy capacity is equal to the feedback capacity without the presence of eavesdropper. Furthermore, we explicitly construct the secrecy capacity-achieving feedback code, which is deterministic and simple to implement.

DOI: 10.1109/isit.2017.8006872

Related papers

Secrecy Capacity of Colored Gaussian Noise Channels with Feedback

Chong Li, Yingbin Liang, H. Vincent Poor +1 more

In this paper, the k-th order autoregressive moving average (ARMA(k)) Gaussian wiretap channel with noiseless causal feedback is considered, in which an eavesdropper receives noisy observations of the signals in both forward and feedback channels. It is shown that a variant of the generalized Schalkwijk-Kailath scheme, a capacity-achieving coding scheme for the feedback Gaussian channel, achieves the same maximum rate for the same channel with the presence of an eavesdropper. Therefore, the secrecy capacity is equal to the feedback capacity without the presence of an eavesdropper for the feedback channel. Furthermore, the results are extended to the additive white Gaussian noise (AWGN) channel with quantized feedback. It is shown that the proposed coding scheme achieves a positive secrecy rate. As the amplitude of the quantization noise decreases to zero, the secrecy rate converges to the capacity of the AWGN channel.

arXiv:1801.06702Jan 20, 20180 citations

Secrecy Capacity of Colored Gaussian Noise Channels With Feedback

Chong Li, Yingbin Liang, H. Vincent Poor +1 more

In this paper, the finite-order autoregressive moving average (ARMA) Gaussian wiretap channel with noiseless causal feedback is considered, in which an eavesdropper receives noisy observations of signals in both forward and feedback channels. It is shown that the generalized Schalkwijk-Kailath scheme, a capacity-achieving coding scheme for the Gaussian feedback channel, achieves the same maximum rate for the same channel even with the presence of an eavesdropper. Therefore, the secrecy capacity is equal to the feedback capacity without the presence of an eavesdropper for the Gaussian feedback channel. Furthermore, the results are extended to the additive white Gaussian noise (AWGN) channel with quantized feedback. It is shown that the proposed coding scheme achieves a positive secrecy rate. Our result implies that as the amplitude of the quantization noise decreases to zero, the secrecy rate converges to the capacity of the AWGN channel.

IEEE Transactions on Information TheoryMar 13, 201926 citations

A Coding Scheme for Colored Gaussian Wiretap Channels with Feedback

Chong Li, Yingbin Liang, H. Vincent Poor +1 more

In this paper, the finite-order autoregressive moving average (ARMA) Gaussian wiretap channel with noiseless causal feedback is considered, in which an eavesdropper receives noisy observations of the signals in both forward and feedback channels. It is shown that the generalized Schalkwijk-Kailath scheme, a capacity-achieving coding scheme for the feedback Gaussian channel, achieves the same maximum rate for the same channel with the presence of an eavesdropper. Therefore, the secrecy capacity is equal to the feedback capacity without the presence of an eavesdropper for the feedback channel. Furthermore, the results are extended to the additive white Gaussian noise (AWGN) channel with quantized feedback. It is shown that the proposed coding scheme achieves a positive secrecy rate. As the amplitude of the quantization noise decreases to zero, the secrecy rate converges to the capacity of the AWGN channel.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20187 citations

The Secrecy Capacity Region of the Gaussian MIMO Multi-Receiver Wiretap Channel

Ersen Ekrem, Şennur Ulukuş

In this paper, we consider the Gaussian multiple-input multiple-output (MIMO) multi-receiver wiretap channel in which a transmitter wants to have confidential communication with an arbitrary number of users in the presence of an external eavesdropper. We derive the secrecy capacity region of this channel for the most general case. We first show that even for the single-input single-output (SISO) case, existing converse techniques for the Gaussian scalar broadcast channel cannot be extended to this secrecy context, to emphasize the need for a new proof technique. Our new proof technique makes use of the relationships between the minimum-mean-square-error and the mutual information, and equivalently, the relationships between the Fisher information and the differential entropy. Using the intuition gained from the converse proof of the SISO channel, we first prove the secrecy capacity region of the degraded MIMO channel, in which all receivers have the same number of antennas, and the noise covariance matrices can be arranged according to a positive semi-definite order. We then generalize this result to the aligned case, in which all receivers have the same number of antennas; however, there is no order among the noise covariance matrices. We accomplish this task by using the channel enhancement technique. Finally, we find the secrecy capacity region of the general MIMO channel by using some limiting arguments on the secrecy capacity region of the aligned MIMO channel. We show that the capacity achieving coding scheme is a variant of dirty-paper coding with Gaussian signals.

arXiv:0903.3096IEEE Transactions on Information TheoryMar 15, 2011243 citations

Secret communication with feedback

Denız Gündüz, D. Richard Brown, H. Vincent Poor

Secure communication with feedback is studied. An achievability scheme in which the backward channel is used to generate a shared secret key is proposed. The scenario of binary symmetric forward and backward channels is considered, and a combination of the proposed scheme and Maurer's coding scheme is shown to achieve improved secrecy rates. The scenario of a Gaussian channel with perfect output feedback is also analyzed and the Schalkwijk-Kailath coding scheme is shown to achieve the secrecy capacity for this channel.

arXiv:0812.1713International Symposium on Information Theory and its ApplicationsDec 1, 200863 citations

Secret Communication with Feedback

D. Richard, Donald R. Brown, H. Vincent Poor

Secure communication with feedback is studied. An achievability scheme in which the backward channel is used to generate a shared secret key is proposed. The scenario of binary symmetric forward and back-ward channels is considered, and a combination of the proposed scheme and Maurer’s coding scheme is shown to achieve improved secrecy rates. The scenario of a Gaussian channel with perfect output feedback is also analyzed and the Schalkwijk-Kailath coding scheme is shown to achieve the secrecy capacity for this channel. 1.

Apr 2, 201572 citations