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 International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

Secure Identification Under Jamming Attacks

Holger Boche, Christian Deppe

Published Jun 1, 2018• 4 citations
Publisher

Abstract

In this survey we contrast the classical transmission theory of Shannon and the identification theory of Ahlswede and Dueck. We show that it may be useful to take a closer look at the recipient's goals. In identification theory, the recipient's goal is changed, thereby significantly increasing the channel capacity. Furthermore, there are further gains in the secure transmission of data. In this work we review the results for robust and secure discrete memoryless channels and jamming attacks. We analyze the capacity functions for various channels. It turns out that there may be discontiuity points of these functions. It is very important to use this result in practical implementations.

DOI
10.1109/spawc.2018.8445932

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

Secure Identification Under Passive Eavesdroppers and Active Jamming Attacks

Holger Boche, Christian Deppe

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.

IEEE Transactions on Information Forensics and Security•Jul 10, 2018•46 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

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

Robust and secure identification

Holger Boche, Christian Deppe

We determine the identification capacity of compound channels with and without wiretapper. It turned out, that the secure capacity formula fulfill a dichotomy theorem. It is positive if its secure capacity is positive and equals the transmission capacity of the channel. Otherwise the capacity is zero. We analyze the (dis-)continuity and (super-)additivity of the capacities, which we determined. Alon gave in [6] a conjecture about maximal violation for the additivity for capacity functions. We show that this maximal violation holds for the secure identification capacity. This is the first example of a capacity function, which has this behavior.

IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2017•8 citations

Secure Communication Under Channel Uncertainty and Adversarial Attacks

Rafael F. Schaefer, Holger Boche, H. Vincent Poor

Information theoretic approaches to security have been examined as a promising complement to current cryptographic techniques. Such information theoretic approaches establish reliable communication and data confidentiality directly at the physical layer of a communication network by taking the properties of the noisy channel into account leading to unconditional security regardless of the computational capabilities of eavesdroppers. The provision of accurate channel state information is a major challenge particularly in wireless communication systems, especially information about the channels to eavesdroppers. In addition, there might be malevolent adversaries who jam or influence the channel of the legitimate users. This paper surveys different models for secure communication under channel uncertainty and adversarial attacks and reviews the corresponding secrecy capacity results, which characterize the maximum rate at which information can be sent to legitimate receivers while being kept perfectly security from eavesdroppers.

Proceedings of the IEEE•Aug 21, 2015•75 citations
In this survey we contrast the classical transmission theory of Shannon and the identification theory of Ahlswede and Dueck. We show that it may be useful to take a closer look at the recipient's goals. In identification theory, the recipient's goal is changed, thereby significantly increasing the channel capacity. Furthermore, there are further gains in the secure transmission of data. In this work we review the results for robust and secure discrete memoryless channels and jamming attacks. We analyze the capacity functions for various channels. It turns out that there may be discontiuity points of these functions. It is very important to use this result in practical implementations.
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.
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.
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.
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.
We determine the identification capacity of compound channels with and without wiretapper. It turned out, that the secure capacity formula fulfill a dichotomy theorem. It is positive if its secure capacity is positive and equals the transmission capacity of the channel. Otherwise the capacity is zero. We analyze the (dis-)continuity and (super-)additivity of the capacities, which we determined. Alon gave in [6] a conjecture about maximal violation for the additivity for capacity functions. We show that this maximal violation holds for the secure identification capacity. This is the first example of a capacity function, which has this behavior.
Information theoretic approaches to security have been examined as a promising complement to current cryptographic techniques. Such information theoretic approaches establish reliable communication and data confidentiality directly at the physical layer of a communication network by taking the properties of the noisy channel into account leading to unconditional security regardless of the computational capabilities of eavesdroppers. The provision of accurate channel state information is a major challenge particularly in wireless communication systems, especially information about the channels to eavesdroppers. In addition, there might be malevolent adversaries who jam or influence the channel of the legitimate users. This paper surveys different models for secure communication under channel uncertainty and adversarial attacks and reviews the corresponding secrecy capacity results, which characterize the maximum rate at which information can be sent to legitimate receivers while being kept perfectly security from eavesdroppers.