The Secrecy Capacity of Cost-Constrained Wiretap Channels

Sreekumar, Sreejith; Bunin, Alexander; Goldfeld, Ziv; Permuter, Haim H.; Shamai, Shlomo

doi:10.1109/tit.2020.3039916

Cited by 9 publications

(10 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [25], superposition coding scheme was applied to the wiretap channel with input constraint. It is proved that an additional auxiliary random variable is necessary to achieve the secrecy capacity of the wiretap channel in some cases.…”

Section: B Superposition Stochastic-encoder Code Boundsmentioning

confidence: 99%

“…The advantage of applying superposition coding to the wiretap channel was investigated in [25]. In [25], it was proved that the superposition coding scheme can improve the capacity of ordinary wiretap channels in the presence of the input constraint. The argument also holds for the arbitrarily varying wiretap channel with input constraint and state constraint.…”

Section: B Superposition Stochastic-encoder Code Boundsmentioning

confidence: 99%

“…The argument also holds for the arbitrarily varying wiretap channel with input constraint and state constraint. In Section VI, we give an example that is an arbitrarily varying channel version of the example investigated in [25], which shows that the superposition coding scheme can also improve the achievable rate of the AVWC with input constraint and state constraint.…”

Section: B Superposition Stochastic-encoder Code Boundsmentioning

confidence: 99%

See 2 more Smart Citations

Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints

Chen

He²,

Ying

et al. 2022

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

The strong secrecy transmission problem of the arbitrarily varying wiretap channel (AVWC) with input and state constraints is investigated in this paper. First, a stochasticencoder code lower bound of the strong secrecy capacity is established by applying the type argument and Csiszár's almost independent coloring lemma. Then, a superposition stochasticencoder code lower bound of the secrecy capacity is provided. The superposition stochastic-encoder code lower bound can be larger than the ordinary stochastic-encoder code lower bound. Random code lower and upper bounds of the secrecy capacity of the AVWC with constraints are further provided.Based on these results, we further consider a special case of the model, namely severely less noisy AVWC, and give the stochastic-encoder code and random code capacities. It is proved that the stochastic-encoder code capacity of the AVWC with constraints is either equal to or strictly smaller than the corresponding random code capacity, which is consistent with the property of the ordinary AVC. Finally, some numerical examples are presented to better illustrate our capacity results. Compared to the soft covering lemma that requires the codewords to be generated i.i.d., our method has more relaxed requirements regarding codebooks. It is proved that the good codebooks for secure transmission can be generated by choosing codewords randomly from a given type set, which is critical when considering the AVWC with constraints.

show abstract

Section: B Superposition Stochastic-encoder Code Boundsmentioning

confidence: 99%

Section: B Superposition Stochastic-encoder Code Boundsmentioning

confidence: 99%

Section: B Superposition Stochastic-encoder Code Boundsmentioning

confidence: 99%

See 1 more Smart Citation

Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints

Chen

He²,

Ying

et al. 2022

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…In other words, the broadcast channel with confidential messages is a generalization of the wiretap channel. The requirement in ( 14) is referred to as strong secrecy (see e.g., [91]). Yet, this requirement is weaker than semantic security or indistinguishability.…”

Section: Confidential Coding With and Without Key Assistancementioning

confidence: 99%

Key Assistance, Key Agreement, and Layered Secrecy for Bosonic Broadcast Channels

Pereg¹,

Ferrara²,

Bloch³

2021

Preprint

View full text Add to dashboard Cite

Secret-sharing building blocks based on quantum broadcast communication are studied. The confidential capacity region of the pure-loss bosonic broadcast channel is determined, both with and without key assistance, and an achievable region is established for the lossy bosonic broadcast channel. If the main receiver has a transmissivity of η < 1 2 , then confidentiality solely relies on the key-assisted encryption of the one-time pad. We also address conference key agreement for the distillation of two keys, a public key and a secret key. A regularized formula is derived for the key-agreement capacity region in finite dimensions. In the bosonic case, the key-agreement region is included within the capacity region of the corresponding broadcast channel with confidential messages. We then consider a network with layered secrecy, where three users with different security ranks communicate over the same broadcast network. We derive an achievable layered-secrecy region for a pure-loss bosonic channel that is formed by the concatenation of two beam splitters.

show abstract

“…e secrecy capacity in fading channels was investigated in [14][15][16][17][18]. Later on, secrecy capacity topic has been further studied in the context of multi-access channels, multiple-input multiple-output (MIMO) communications [1,19,20], cooperative networks [21,22], cellular networks [14,23,24], and IoT networks [5,25,26].…”

Section: Introductionmentioning

confidence: 99%

Secrecy Capacity of Time Reversal Beamforming for Multi-User MIMO System under Spatial Correlation

Sun

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

In this paper, for strengthening the security of wireless transmission system, the time reversal (TR) beamforming method is proposed for the downlink of multi-user MIMO system with multiple users who potentially act as eavesdroppers. We develop a multi-input, single-output, multi-eavesdropper (MISOME) wiretap channel model in which Rayleigh fading and spatial correlation are taken into account. Using the proposed model, we further analyze the confidentiality provided by TR beamforming and we use achievable secrecy rates as our performance metrics. In particular, we derive novel closed-formed expressions for the average secrecy-SINR and the mean secrecy sum-rate in order to characterize the influences of propagation conditions on network secrecy metrics. These expressions provide deeper insights into the impact of network interference on communication confidentiality. We find that TR beamforming can deliver the maximum secrecy capacity potential in uncorrelated Rayleigh channels and achieve perfect confidential communication without any extra secrecy cost. On the other hand, even weak inter-user correlation may cause a significant loss of achievable secrecy sum-rate and therefore result in high secrecy cost. But benefiting more from larger signal bandwidth and rich-scattering environment, the TR beamforming technique is still an attractive and cost-effective solution for low-power indoor applications.

show abstract

The Secrecy Capacity of Cost-Constrained Wiretap Channels

Cited by 9 publications

References 46 publications

Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints

Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints

Key Assistance, Key Agreement, and Layered Secrecy for Bosonic Broadcast Channels

Secrecy Capacity of Time Reversal Beamforming for Multi-User MIMO System under Spatial Correlation

Contact Info

Product

Resources

About