Modeling Attack Resistant Arbiter PUF with Time-Variant Obfuscation Scheme

Author(s):  
Zhengtai Chang ◽  
Shanshan Shi ◽  
Binwei Song ◽  
Wenbing Fan ◽  
Yao Wang
Keyword(s):  
Author(s):  
Meznah A. Alamro ◽  
Khalid T. Mursi ◽  
Yu Zhuang ◽  
Mohammed Saeed Alkatheiri ◽  
Ahmad O. Aseeri
Keyword(s):  

2022 ◽  
Vol 27 (3) ◽  
pp. 1-26
Author(s):  
Mahabub Hasan Mahalat ◽  
Suraj Mandal ◽  
Anindan Mondal ◽  
Bibhash Sen ◽  
Rajat Subhra Chakraborty

Secure authentication of any Internet-of-Things (IoT) device becomes the utmost necessity due to the lack of specifically designed IoT standards and intrinsic vulnerabilities with limited resources and heterogeneous technologies. Despite the suitability of arbiter physically unclonable function (APUF) among other PUF variants for the IoT applications, implementing it on field-programmable gate arrays (FPGAs) is challenging. This work presents the complete characterization of the path changing switch (PCS) 1 based APUF on two different families of FPGA, like Spartan-3E (90 nm CMOS) and Artix-7 (28 nm CMOS). A comprehensive study of the existing tuning concept for programmable delay logic (PDL) based APUF implemented on FPGA is presented, leading to establishment of its practical infeasibility. We investigate the entropy, randomness properties of the PCS based APUF suitable for practical applications, and the effect of temperature variation signifying the adequate tolerance against environmental variation. The XOR composition of PCS based APUF is introduced to boost performance and security. The robustness of the PCS based APUF against machine learning based modeling attack is evaluated, showing similar characteristics as the conventional APUF. Experimental results validate the efficacy of PCS based APUF with a little hardware footprint removing the paucity of lightweight security primitive for IoT.


Author(s):  
Venkata Sreekanth Balijabudda ◽  
Dhruv Thapar ◽  
Pranesh Santikellur ◽  
Rajat Subhra Chakraborty ◽  
Indrajit Chakrabarti

10.29007/7nl2 ◽  
2018 ◽  
Author(s):  
Nils Wisiol ◽  
Christoph Graebnitz ◽  
Marian Margraf ◽  
Manuel Oswald ◽  
Tudor Soroceanu ◽  
...  

In a novel analysis, we show that arbitrarily many Arbiter PUFs can be combined into a stable XOR Arbiter PUF. To the best of our knowledge, this design cannot be modeled by any known oracle access attack in polynomial time.Using majority vote of Arbiter Chain responses, our analysis shows that with a polynomial number of votes the XOR Arbiter PUF stability of almost all challenges can be boosted exponentially close to 1; that is, the stability gain through majority voting can exceed the stability loss introduced by large XORs for a feasible number of votes. Hence, our proposal enables the designer to increase the attacker's effort exponentially while still maintaining polynomial design effort for all known oracle access modeling attacks. This is the first result that relates PUF design to this traditional cryptographic design principle.


Author(s):  
Venkata P. Yanambaka ◽  
Saraju P. Mohanty ◽  
Elias Kougianos ◽  
Prabha Sundaravadivel ◽  
Jawar Singh
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document