The Wiretap Channel With Generalized Feedback: Secure Communication and Key Generation

Bassi, Germán; Piantanida, Pablo; Shamai, Shlomo

doi:10.1109/tit.2018.2883299

Cited by 19 publications

(4 citation statements)

References 37 publications

(94 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The results and tools introduced in this work have connections to ones in a previous work of ours [ 28 ], where we studied both the secrecy capacity and the secret key capacity of the wiretap channel with generalized feedback. In [ 28 ], we determined some capacity regions for the problem dealt here as a secondary result of the main problem. It is not surprising that, by being the main focus of the present work, the capacity results shown here are more general than those in [ 28 ].…”

Section: Introductionmentioning

confidence: 84%

“…The outer bound is derived by following similar steps to those in ([ 28 ], Theorem 4) which assumes

. It is reproduced here for completeness.…”

Section: Remarkmentioning

confidence: 99%

“…In [ 28 ], we determined some capacity regions for the problem dealt here as a secondary result of the main problem. It is not surprising that, by being the main focus of the present work, the capacity results shown here are more general than those in [ 28 ]. Furthermore, we go deeper into the analysis of secret key agreement schemes and we show, in Section 4 , the suboptimality of a previously published achievable scheme.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources

Bassi

Piantanida

Shamai

2019

Entropy

Self Cite

View full text Add to dashboard Cite

This paper investigates the problem of secret key generation over a wiretap channel when the terminals observe correlated sources. These sources are independent of the main channel and the users overhear them before the transmission takes place. A novel outer bound is proposed and, employing a previously reported inner bound, the secret key capacity is derived under certain less-noisy conditions on the channel or source components. This result improves upon the existing literature where the more stringent condition of degradedness is required. Furthermore, numerical evaluation of the achievable scheme and previously reported results for a binary model are presented; a comparison of the numerical bounds provides insights on the benefit of the chosen scheme.Entropy 2019, 21, 732 2 of 16 any relevant information about it to the eavesdropper (for further discussion, the reader is referred to [4,5]).In this work, we study the problem of secret key generation over a wiretap channel with correlated sources at each terminal. These sources are assumed to be independent of the main channel and there is no additional public broadcast channel of finite or infinite rate, as seen in Figure 1. It is assumed that each node acquires the n-sequence observation of its corresponding source before the communication begins.

show abstract

Section: Introductionmentioning

confidence: 84%

“…The outer bound is derived by following similar steps to those in ([ 28 ], Theorem 4) which assumes

. It is reproduced here for completeness.…”

Section: Remarkmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources

Bassi

Piantanida

Shamai

2019

Entropy

Self Cite

View full text Add to dashboard Cite

show abstract

“…Although the perfect output feedback is explicitly used in our achievability proofs, some of our converse results hold for generalized feedback. Furthermore, the fundamental insights gained from our results can be used to tackle generalized feedback scenarios, for which identifying closed-form characterizations becomes challenging; see, e.g., [18]. We next define the strong secrecy-distortion region for the problem of interest.…”

Section: Problem Definitionmentioning

confidence: 99%

Secure Joint Communication and Sensing

Günlü

Bloch

Schaefer

et al. 2022

2022 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

This work considers the problem of mitigating information leakage between communication and sensing in systems jointly performing both operations. Specifically, a discrete memoryless state-dependent broadcast channel model is studied in which (i) the presence of feedback enables a transmitter to convey information, while simultaneously performing channel state estimation; (ii) one of the receivers is treated as an eavesdropper whose state should be estimated but which should remain oblivious to part of the transmitted information. The model abstracts the challenges behind security for joint communication and sensing if one views the channel state as a key attribute, e.g., location. For independent and identically distributed states, perfect output feedback, and when part of the transmitted message should be kept secret, a partial characterization of the secrecy-distortion region is developed. The characterization is exact when the broadcast channel is either physically-degraded or reversely-physically-degraded. The partial characterization is also extended to the situation in which the entire transmitted message should be kept secret. The benefits of a joint approach compared to separation-based secure communication and statesensing methods are illustrated with binary joint communication and sensing models.

show abstract

Secure polar coding for a joint source-channel model

Wang

Tao

et al. 2021

Sci. China Inf. Sci.

View full text Add to dashboard Cite

The Wiretap Channel With Generalized Feedback: Secure Communication and Key Generation

Cited by 19 publications

References 37 publications

The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources

The Secret Key Capacity of a Class of Noisy Channels with Correlated Sources

Secure Joint Communication and Sensing

Secure polar coding for a joint source-channel model

Contact Info

Product

Resources

About