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

IEEE Transactions on Information Forensics and Security

Secure Identification Under Passive Eavesdroppers and Active Jamming Attacks

Holger Boche, Christian Deppe

Published Jul 10, 2018• 46 citations
Publisher

Abstract

In next-generation connectivity systems, which rely on robust and low-latency information exchange, there exists communication tasks in which the Ahlswede/Dueck identification scheme is much more efficient than Shannon's transmission scheme. We concentrate on the arbitrarily varying wiretap channel (AVWC) that models jamming attacks. We provide a coding scheme for secure identification and determine the secrecy capacity of the AVWC. Furthermore, we analyze important properties of this capacity function, e.g., continuity and super-additivity. These properties are important for the design of robust secure communication design and for the optimization of the medium access control.

DOI
10.1109/tifs.2018.2854729

Related papers

Secure identification under jamming attacks

Holger Boche, Christian Deppe

In next generation connectivity systems, relying on robust and low-latency information exchange, there exists communication tasks in which the Ahlswede/Dueck identification scheme is much more efficient than Shannon's transmission scheme. We concentrate on the arbitrarily varying wiretap channel (AVWC) modeling jamming attacks. We provide a coding scheme for secure identification and determine the secrecy capacity of the AVWC. Furthermore, we analyze important properties of this capacity function, e.g. continuity and super-additivity.

IEEE International Workshop on Information Forensics and Security•Dec 1, 2017•6 citations

Secrecy Capacity Under List Decoding For A Channel with A Passive Eavesdropper and an Active Jammer

Ahmed S. Mansour, Holger Boche, Rafael F. Schaefer

We investigate secure communication over a channel that undergoes two different classes of attacks at the same time: passive eavesdropping and active jamming. This scenario is perfectly modeled by the concept of arbitrarily varying wiretap channels (AVWCs). We derive a full characterization of the secrecy capacity of AVWCs under list decoding. We show that the list secrecy capacity is either equivalent to the correlated random secrecy capacity or zero depending on the order of symmetrizability of the legitimate AVC. Differently from correlated random codes, our coding scheme does not assume any restrictions on the communication between the eavesdropper and the jammer.

IEEE International Conference on Acoustics Speech and Signal Processing•Apr 1, 2018•2 citations

Secure Identification for Gaussian Channels

Wafa Labidi, Christian Deppe, Holger Boche

New applications in modern communications are demanding robust and ultra-reliable low latency information exchange such as machine-to-machine and human-to-machine communications. For many of these applications, the identification approach of Ahlswede and Dueck is much more efficient than the classical transmission scheme proposed by Shannon. Previous studies concentrate mainly on identification over discrete channels. We focus on Gaussian channels for their known practical relevance. We deal with secure identification over Gaussian channels. In particular, we provide a suitable coding scheme for the Gaussian wiretap channel (GWC) and determine the corresponding secure identification capacity.

IEEE International Conference on Acoustics Speech and Signal Processing•Apr 9, 2020•26 citations

Stabilizing the secrecy capacity of the arbitrarily varying wiretap channel and transceiver synchronization using list decoding

Ahmed S. Mansour, Holger Boche, Rafael F. Schaefer

We investigate secure communication over a channel under two different classes of attacks at the same time: a passive eavesdropper and an active jammer. This scenario is perfectly modeled by the concept of arbitrarily varying wiretap channels (AVWCs). It has been shown that uncorrelated codes are not always capable of overcoming the various jamming attacks. On the other hand, correlated random codes that can always neutralize the role of the jammer require the existence of a shared common randomness between the legitimate nodes. These constraints lead to the instability of the secrecy capacity of AVWCs. In this paper, we provide a new coding scheme that combines the principle of list decoding and the techniques of correlated random codes. Our coding scheme does not only stabilize the secrecy capacity of the AVWC, but it can also be used to provide some additional features required for practical scenarios such as transceiver synchronization and channel estimation.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jul 1, 2017•4 citations

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

Ahmed S. Mansour, Holger Boche, Rafael F. Schaefer

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.

Advances in Mathematics of Communications•Dec 19, 2018•2 citations

Secure Identification for Gaussian Channels and Identification for Multi-Antenna Gaussian Channels

Wafa Labidi, Christian Deppe, Holger Boche

New applications in modern communications are demanding robust and ultra-reliable low latency information exchange such as machine-to-machine and human-to-machine communications. For many of these applications, the identification approach of Ahlswede and Dueck is much more efficient than the classical message transmission scheme proposed by Shannon. Previous studies concentrate mainly on identification over discrete channels. For discrete channels, it was proved that identification is robust under channels uncertainty. Furthermore, optimal identification schemes that are secure and robust against jamming attacks have been considered. However, no results for continuous channels have yet been established. That is why we focus on the continuous case: the Gaussian channel for its known practical relevance. We deal with secure identification over Gaussian channels. Provable secure communication is of a high interest for future communication systems. A key technique for implementing secure communication is the physical layer security based on information theoretic security. We model this with the wiretap channel. In particular, we provide a suitable coding scheme for the Gaussian wiretap channel (GWC) and determine the corresponding secure identification capacity. We also consider Multiple-Input Multiple-Output (MIMO) Gaussian channels and provide an efficient signal-processing scheme. This scheme allows a separation of signal-processing and Gaussian coding.

arXiv:2011.06443•Nov 12, 2020•3 citations
In next-generation connectivity systems, which rely on robust and low-latency information exchange, there exists communication tasks in which the Ahlswede/Dueck identification scheme is much more efficient than Shannon's transmission scheme. We concentrate on the arbitrarily varying wiretap channel (AVWC) that models jamming attacks. We provide a coding scheme for secure identification and determine the secrecy capacity of the AVWC. Furthermore, we analyze important properties of this capacity function, e.g., continuity and super-additivity. These properties are important for the design of robust secure communication design and for the optimization of the medium access control.
In next generation connectivity systems, relying on robust and low-latency information exchange, there exists communication tasks in which the Ahlswede/Dueck identification scheme is much more efficient than Shannon's transmission scheme. We concentrate on the arbitrarily varying wiretap channel (AVWC) modeling jamming attacks. We provide a coding scheme for secure identification and determine the secrecy capacity of the AVWC. Furthermore, we analyze important properties of this capacity function, e.g. continuity and super-additivity.
We investigate secure communication over a channel that undergoes two different classes of attacks at the same time: passive eavesdropping and active jamming. This scenario is perfectly modeled by the concept of arbitrarily varying wiretap channels (AVWCs). We derive a full characterization of the secrecy capacity of AVWCs under list decoding. We show that the list secrecy capacity is either equivalent to the correlated random secrecy capacity or zero depending on the order of symmetrizability of the legitimate AVC. Differently from correlated random codes, our coding scheme does not assume any restrictions on the communication between the eavesdropper and the jammer.
New applications in modern communications are demanding robust and ultra-reliable low latency information exchange such as machine-to-machine and human-to-machine communications. For many of these applications, the identification approach of Ahlswede and Dueck is much more efficient than the classical transmission scheme proposed by Shannon. Previous studies concentrate mainly on identification over discrete channels. We focus on Gaussian channels for their known practical relevance. We deal with secure identification over Gaussian channels. In particular, we provide a suitable coding scheme for the Gaussian wiretap channel (GWC) and determine the corresponding secure identification capacity.
We investigate secure communication over a channel under two different classes of attacks at the same time: a passive eavesdropper and an active jammer. This scenario is perfectly modeled by the concept of arbitrarily varying wiretap channels (AVWCs). It has been shown that uncorrelated codes are not always capable of overcoming the various jamming attacks. On the other hand, correlated random codes that can always neutralize the role of the jammer require the existence of a shared common randomness between the legitimate nodes. These constraints lead to the instability of the secrecy capacity of AVWCs. In this paper, we provide a new coding scheme that combines the principle of list decoding and the techniques of correlated random codes. Our coding scheme does not only stabilize the secrecy capacity of the AVWC, but it can also be used to provide some additional features required for practical scenarios such as transceiver synchronization and channel estimation.
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.
New applications in modern communications are demanding robust and ultra-reliable low latency information exchange such as machine-to-machine and human-to-machine communications. For many of these applications, the identification approach of Ahlswede and Dueck is much more efficient than the classical message transmission scheme proposed by Shannon. Previous studies concentrate mainly on identification over discrete channels. For discrete channels, it was proved that identification is robust under channels uncertainty. Furthermore, optimal identification schemes that are secure and robust against jamming attacks have been considered. However, no results for continuous channels have yet been established. That is why we focus on the continuous case: the Gaussian channel for its known practical relevance. We deal with secure identification over Gaussian channels. Provable secure communication is of a high interest for future communication systems. A key technique for implementing secure communication is the physical layer security based on information theoretic security. We model this with the wiretap channel. In particular, we provide a suitable coding scheme for the Gaussian wiretap channel (GWC) and determine the corresponding secure identification capacity. We also consider Multiple-Input Multiple-Output (MIMO) Gaussian channels and provide an efficient signal-processing scheme. This scheme allows a separation of signal-processing and Gaussian coding.