DMOS-PUF: Dynamic Multi-key-selection Obfuscation for Strong PUFs against Machine Learning Attacks
share
Strong physical unclonable function (PUF) is a promising solution for device authentication in resource-constrained applications but vulnerable to machine learning attacks. In order to resist such attack, many defenses have been proposed in recent years. However, these defenses incur high hardware overhead, degenerate reliability and are inefficient against advanced machine learning attacks. In order to address these issues, we propose a dynamic multi-key-selection obfuscation for strong PUFs (DMOS-PUF) to resist machine learning attacks. The basic idea is that several stable responses are derived from the PUF itself and pre-stored as the obfuscation keys in the testing phase, and then a true random number generator is used to select any two keys to obfuscate challenges and responses with simple XOR operations. When the number of challenge-response pairs (CRPs) collected by the attacker exceeds the given threshold, the obfuscation keys will be updated immediately. In this way, machine learning attacks can be prevented with extremely low hardware overhead. Experimental results show that for a 64x64 Arbiter PUF, when 32 obfuscation keys are used and even if 1 million CRPs are collected by attackers, the prediction accuracies of Logistic regression, support vector machines, artificial neural network, convolutional neural network and covariance matrix adaptive evolutionary strategy are about 50 guessing.
READ FULL TEXT
