Lightweight Continuous Authentication via Intelligently Arranged Pseudo-Random Access in 5G-and-Beyond
He Fang, Xianbin Wang, Nan Zhao, Naofal Al‐Dhahir
Abstract
Conventional authentication techniques based on cryptography and computational hardness are facing growing challenges for deployment in resource-constrained Internet-of-Things (IoT) devices. The dramatically increased security overhead and latency from the inherent computational processing make these conventional static security techniques undesirable for emerging machine communications. In this paper, we propose a novel lightweight continuous authentication scheme for identifying multiple resource-constrained IoT devices via their pre-arranged pseudo-random access time sequences. A transmitter will be authenticated as legitimate if and only if its access time sequential order is matched with a pre-agreed unique pseudo-random binary sequence (PRBS) between itself and the base station. The seed for generating the PRBS between each transceiver pair is acquired by exploiting the channel reciprocity, which is time-varying and difficult for a third party to predict. Hence, the proposed scheme provides seamless protection for legitimate communications by refreshing the seeds adaptively without incurring long latency, complex computation, and high communication overhead. Our results show that the proposed scheme achieves high entropy and low bit mismatch rate. Finally, we demonstrate the superiority of our scheme over the existing schemes in quantization performance, authentication performance, and computation cost.