Abstract
The Physical Unclonable Function (PUF) is a hardware block which exploits the inherent process variations introduced during manufacturing to assign a unique fingerprint for each physical entity. This feature enables a low-cost authentication mechanism for connected devices, which is easy to evaluate but hard to predict. In this paper, we develop a low-cost PUF-based authentication mechanism called DC-PUF for resource-constrained IoT devices which can resist against machine-learning attacks. A new strategy known as the dependency chain (DC) is employed by which the response in each clock is dependent not only on the current challenge but also on the previous responses. This mechanism which takes advantage of both randomization and dependency chain hardens the ability to clone or predict the PUF instance by obfuscating the correlation between challenge-response pairs. Moreover, we propose a CNN-based attack scenario by which the existing PUF structures cannot resist while yielding more than 95% of prediction accuracy. The experimental results signify that unlike the existing PUFs, more than 58% of prediction accuracy cannot be reached when a sophisticated CNN-based attack is conducted to the DC-PUF, even with a large data-set. Also, the False-Negative rate is about 1%, in average, for three-bit mismatches in the receiving response in the presence of channel variations, whereas the False-Positive rate remains zero. Moreover, the proposed DC-PUF incurs lower hardware complexity and reasonable reliability and randomness compared to the existing PUF structures.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.