PUF-RLA: A PUF-based Reliable and Lightweight Authentication Protocol employing Binary String Shuffling
Mahmood Azhar Qureshi, Arslan Munir

TL;DR
This paper introduces PUF-RLA, a lightweight, reliable authentication protocol using binary string shuffling that enhances PUF security and efficiency for resource-constrained devices.
Contribution
It proposes a novel PUF-based authentication scheme with binary string shuffling, error correction on the server, and secure stream authentication to prevent attacks.
Findings
Achieves approximately 99% authentication reliability.
Reduces FPGA LUTs by 63% and register count by 74%.
Robust against brute force, replay, and modeling attacks.
Abstract
Physically unclonable functions (PUFs) can be employed for device identification, authentication, secret key storage, and other security tasks. However, PUFs are susceptible to modeling attacks if a number of PUFs' challenge-response pairs (CRPs) are exposed to the adversary. Furthermore, many of the embedded devices requiring authentication have stringent resource constraints and thus require a lightweight authentication mechanism. We propose PUF-RLA, a PUF-based lightweight, highly reliable authentication scheme employing binary string shuffling. The proposed scheme enhances the reliability of PUF as well as alleviates the resource constraints by employing error correction in the server instead of the device without compromising the security. The proposed PUF-RLA is robust against brute force, replay, and modeling attacks. In PUF-RLA, we introduce an inexpensive yet secure stream…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPhysical Unclonable Functions (PUFs) and Hardware Security · Advanced Memory and Neural Computing · Neuroscience and Neural Engineering
