# American Institute of Mathematical Sciences

February  2019, 13(1): 11-39. doi: 10.3934/amc.2019002

## The secrecy capacity of the arbitrarily varying wiretap channel under list decoding

 1 Lehrstuhl für Theoretische Informationstechnik, Technische Universität München, 80290 München, Germany 2 Information Theory and Applications Chair, Technische Universität Berlin, 10587 Berlin, Germany

This work was presented in part at IEEE-CNS, Philadelphia, USA, October 2016 [19] and at IEEE-SPAWC, Sapporo, Japan, July 2017 [20]

Received  April 2017 Published  December 2018

We consider a communication scenario in which the channel undergoes two different classes of attacks at the same time: a passive eavesdropper and an active jammer. This scenario is modelled by the concept of arbitrarily varying wiretap channels (AVWCs). In this paper, we derive a full characterization of the list secrecy capacity of the AVWC, showing that the list secrecy capacity is equivalent to the correlated random secrecy capacity if the list size L is greater than the order of symmetrizability of the AVC between the transmitter and the legitimate receiver. Otherwise, it is zero. Our result indicates that for a sufficiently large list size L, list codes can overcome the drawbacks of correlated and uncorrelated codes and provide a stable secrecy capacity for AVWCs. Furthermore, we investigate the effect of relaxing the reliability and secrecy constraints by allowing a non-vanishing error probability and information leakage on the list size L. We found that we can construct a list code whose rate is close to the correlated secrecy capacity using a finite list size L that only depends on the average error probability requested. Finally, we point out that our capacity characterization is an important step in investigating the analytical properties of the capacity function such as: the continuity behavior, Turing computability and super-activation of parallel AVWCs.

Citation: Ahmed S. Mansour, Holger Boche, Rafael F. Schaefer. The secrecy capacity of the arbitrarily varying wiretap channel under list decoding. Advances in Mathematics of Communications, 2019, 13 (1) : 11-39. doi: 10.3934/amc.2019002
##### References:

show all references

##### References:
Discrete memoryless arbitrarily varying wiretap channel $(\mathfrak{W},\mathfrak{V})$

2020 Impact Factor: 0.935

## Metrics

• HTML views (299)
• Cited by (0)

## Other articlesby authors

• on AIMS
• on Google Scholar