Performance Evaluation of Keyless Authentication Based on Noisy Channel

IEEE Trans. Dependable and Secure Comput.

Zhang

Cheng

et al. 2020

In this paper, we investigate physical (PHY) layer message authentication to combat adversaries with infinite computational capacity. Specifically, a PHY-layer authentication framework over a wiretap channel (W 1 ,W 2) is proposed to achieve information-theoretic security with the same key. We develop a theorem to reveal the requirements/conditions for the authentication framework to be information-theoretic secure for authenticating a polynomial number of messages in terms of n. Based on this theorem, we design an authentication protocol that can guarantee the security requirements, and prove its authentication rate can approach infinity when n goes to infinity. Furthermore, we design and implement a feasible and efficient message authentication protocol over binary symmetric wiretap channel (BSWC) by using Linear Feedback Shifting Register based (LFSR-based) hash functions and strong secure polar code. Through extensive simulations, it is demonstrated that the proposed protocol can achieve high authentication rate, with low time complexity and authentication error rate.

Section: B Phy-layer Message Authenticationmentioning

confidence: 99%

Section: B Phy-layer Message Authenticationmentioning

confidence: 99%

Physical Layer based Message Authentication with Secure Channel Codes

IEEE Trans. Dependable and Secure Comput.

Zhang

Cheng

et al. 2020

“…Recently, authentication over noise channel models drawn increasing attentions [29]- [34]. The authentication over noise source model with a (noiseless) public discussion channel was studied by Korzhik et al in [29] and Barni in [30]. After that, the authentication over MIMO fading wiretap channels was considered by Baracca et al in [31] and Ferrante et al in [32].…”

Section: B Phy-layer Message Authenticationmentioning

confidence: 99%

Multi-message Authentication over Noisy Channel with Polar Codes

2017 IEEE 14th International Conference on Mobile Ad Hoc and Sensor Systems (MASS)

Cheng

Zhang

et al. 2017

In this paper, we investigate multi-message authentication to combat adversaries with infinite computational capacity. An authentication framework over a wiretap channel (W 1 ,W 2 ) is proposed to achieve information-theoretic security with the same key. The proposed framework bridges the two research areas in physical (PHY) layer security: secure transmission and message authentication. Specifically, the sender Alice first transmits message M to the receiver Bob over (W 1 ,W 2 ) with an error correction code; then Alice employs a hash function (i.e., ε-AWU 2 hash functions) to generate a message tag S of message M using key K, and encodes S to a codeword X n by leveraging an existing strongly secure channel coding with exponentially small (in code length n) average probability of error; finally, Alice sends X n over (W 1 ,W 2 ) to Bob who authenticates the received messages. We develop a theorem regarding the requirements/conditions for the authentication framework to be information-theoretic secure for authenticating a polynomial number of messages in terms of n. Based on this theorem, we propose an authentication protocol that can guarantee the security requirements, and prove its authentication rate can approach infinity when n goes to infinity. Furthermore, we design and implement an efficient and feasible authentication protocol over binary symmetric wiretap channel (BSWC) by using Linear Feedback Shifting Register based (LFSRbased) hash functions and strong secure polar code. Through extensive experiments, it is demonstrated that the proposed protocol can achieve low time cost, high authentication rate, and low authentication error rate.

“…Even though secret sharing over noisy channels has been extensively studied, the attention to its sibling message authentication is far from enough. Korzhik et al [3] considered the authentication problem over a (noiseless) public discussion channel under the initialization from the noisy channels so that the sender, the receiver and the attacker hold some correlated data. So they essentially considered the authentication in the noiseless channel with a noisy initialization (or simply in the source model [8]).…”

Section: A Related Workmentioning

confidence: 99%

Message Authentication Code over a wiretap channel

2015 IEEE International Symposium on Information Theory (ISIT)

Jiang

Qin

2015

Abstract-Message Authentication Code (MAC) is a keyed function fK such that when Alice, who shares the secret K with Bob, sends fK (M ) to the latter, Bob will be assured of the integrity and authenticity of M . Traditionally, it is assumed that the channel is noiseless. However, Maurer showed that in this case an attacker can succeed with probability 2after authenticating ℓ messages. In this paper, we consider the setting where the channel is noisy. Specifically, Alice and Bob are connected by a discrete memoryless channel (DMC) W1 and a noiseless but insecure channel. In addition, an attacker Oscar is connected with Alice through DMC W2 and with Bob through a noiseless channel. In this setting, we study the framework that sends M over the noiseless channel and the traditional MAC fK (M ) over channel (W1, W2). We regard the noisy channel as an expensive resource and define the authentication rate ρ auth as the ratio of message length to the number n of channel W1 uses. The security of this framework depends on the channel coding scheme for fK (M ). A natural coding scheme is to use the secrecy capacity achieving code of Csiszár and Körner. Intuitively, this is also the optimal strategy. However, we propose a coding scheme that achieves a higher ρ auth . Our crucial point for this is that in the secrecy capacity setting, Bob needs to recover fK (M ) while in our coding scheme this is not necessary. How to detect the attack without recovering fK (M ) is the main contribution of this work. We achieve this through random coding techniques.