Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Secret Communication with Feedback

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

Published Apr 2, 2015• 72 citations
OpenAlex

Abstract

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.

Related papers

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.1713•International Symposium on Information Theory and its Applications•Dec 1, 2008•63 citations

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.06702•Jan 20, 2018•0 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 Theory•Mar 13, 2019•26 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, 2018•7 citations

Some New Results on the Gaussian Wiretap Feedback Channel

Chenxu Wei, Linman Yu, Bin Dai

In this paper, the Gaussian wiretap feedback channel is revisited, and some new results on its secrecy capacity are obtained. To be specific, first, we show that the Schalkwijk–Kailath (SK) feedback scheme, which achieves the secrecy capacity of the degraded Gaussian wiretap feedback channel, also achieves the secrecy capacity of the non-degraded Gaussian wiretap feedback channel. Second, applying the existing secret key-based feedback schemes to Gaussian wiretap feedback channels, we derive some new lower bounds on the secrecy capacities of these models. Finally, we compare the performances of the above feedback schemes in the degraded and non-degraded Gaussian wiretap feedback channels and show which feedback scheme performs better for these channel models.

Entropy•Aug 21, 2019•6 citations

Secret key capacity for multipleaccess channel with public feedback

Himanshu Tyagi, Shun Watanabe

We consider the generation of a secret key (SK) by the inputs and the output of a secure multipleaccess channel (MAC) that additionally have access to a noiseless public communication channel. Under specific restrictions on the protocols, we derive various upper bounds on the rate of such SKs. Specifically, if the public communication consists of only the feedback from the output terminal, then the rate of SKs that can be generated is bounded above by the maximum symmetric rate R*fin the capacity region of the MAC with feedback. On the other hand, if the public communication is allowed only before and after the transmission over the MAC, then the rate of SKs is bounded above by the maximum symmetric rate R* in the capacity region of the MAC without feedback. Furthermore, for a symmetric MAC, we present a scheme that generates an SK of rate R*f, improving the best previously known achievable rate R*. An application of our results establishes the SK capacity for adder MAC, without any restriction on the protocols.

Allerton Conference on Communication, Control, and Computing•Oct 1, 2013•9 citations
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.
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.
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.
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.
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.
In this paper, the Gaussian wiretap feedback channel is revisited, and some new results on its secrecy capacity are obtained. To be specific, first, we show that the Schalkwijk–Kailath (SK) feedback scheme, which achieves the secrecy capacity of the degraded Gaussian wiretap feedback channel, also achieves the secrecy capacity of the non-degraded Gaussian wiretap feedback channel. Second, applying the existing secret key-based feedback schemes to Gaussian wiretap feedback channels, we derive some new lower bounds on the secrecy capacities of these models. Finally, we compare the performances of the above feedback schemes in the degraded and non-degraded Gaussian wiretap feedback channels and show which feedback scheme performs better for these channel models.
We consider the generation of a secret key (SK) by the inputs and the output of a secure multipleaccess channel (MAC) that additionally have access to a noiseless public communication channel. Under specific restrictions on the protocols, we derive various upper bounds on the rate of such SKs. Specifically, if the public communication consists of only the feedback from the output terminal, then the rate of SKs that can be generated is bounded above by the maximum symmetric rate R*fin the capacity region of the MAC with feedback. On the other hand, if the public communication is allowed only before and after the transmission over the MAC, then the rate of SKs is bounded above by the maximum symmetric rate R* in the capacity region of the MAC without feedback. Furthermore, for a symmetric MAC, we present a scheme that generates an SK of rate R*f, improving the best previously known achievable rate R*. An application of our results establishes the SK capacity for adder MAC, without any restriction on the protocols.