3 research outputs found
Lightweight and Practical Anonymous Authentication Protocol for RFID systems using physically unclonable functions
Radio frequency identification (RFID) has been considered one of the imperative requirements for implementation of Internet-of-Things applications. It helps to solve the identification issues of the things in a cost-effective manner, but RFID systems often suffer from various security and privacy issues. To solve those issues for RFID systems, many schemes have been recently proposed by using the cryptographic primitive, called physically uncloneable functions (PUFs), which can ensure a tamper-evident feature. However, to the best of our knowledge, none of them has succeeded to address the problem of privacy preservation with the resistance of DoS attacks in a practical way. For instance, existing schemes need to rely on exhaustive search operations to identify a tag, and also suffer from several security and privacy related issues. Furthermore, a tag needs to store some security credentials (e.g., secret shared keys), which may cause several issues such as loss of forward and backward secrecy and large storage costs. Therefore, in this paper, we first propose a lightweight privacy-preserving authentication protocol for the RFID system by considering the ideal PUF environment. Subsequently, we introduce an enhanced protocol which can support the noisy PUF environment. It is argued that both of our protocols can overcome the limitations of existing schemes, and further ensure more security properties. By analyzing the performance, we have shown that the proposed solutions are secure, efficient, practical, and effective for the resource-constraint RFID tag
Multi-factor Physical Layer Security Authentication in Short Blocklength Communication
Lightweight and low latency security schemes at the physical layer that have
recently attracted a lot of attention include: (i) physical unclonable
functions (PUFs), (ii) localization based authentication, and, (iii) secret key
generation (SKG) from wireless fading coefficients. In this paper, we focus on
short blocklengths and propose a fast, privacy preserving, multi-factor
authentication protocol that uniquely combines PUFs, proximity estimation and
SKG. We focus on delay constrained applications and demonstrate the performance
of the SKG scheme in the short blocklength by providing a numerical comparison
of three families of channel codes, including half rate low density parity
check codes (LDPC), Bose Chaudhuri Hocquenghem (BCH), and, Polar Slepian Wolf
codes for n=512, 1024. The SKG keys are incorporated in a zero-round-trip-time
resumption protocol for fast re-authentication. All schemes of the proposed
mutual authentication protocol are shown to be secure through formal proofs
using Burrows, Abadi and Needham (BAN) and Mao and Boyd (MB) logic as well as
the Tamarin-prover