The Gap Between Promise and Reality: On the Insecurity of XOR Arbiter PUFs

被引:169
作者
Becker, Georg T. [1 ]
机构
[1] Ruhr Univ Bochum, Horst Gortz Inst IT Secur, Bochum, Germany
来源
CRYPTOGRAPHIC HARDWARE AND EMBEDDED SYSTEMS - CHES 2015 | 2015年 / 9293卷
关键词
PUFs; Machine learning; Real-world attacks; XOR PUFs; PHYSICAL UNCLONABLE FUNCTIONS;
D O I
10.1007/978-3-662-48324-4_27
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we demonstrate the first real-world cloning attack on a commercial PUF-based RFID tag. The examined commercial PUFs can be attacked by measuring only 4 protocol executions, which takes less than 200 ms. Using a RFID smartcard emulator, it is then possible to impersonate, i.e., "clone" the PUF. While attacking the 4-way PUF used by these tags can be done using traditional machine learning attacks, we show that the tags can still be attacked if they are configured as presumably secure XOR PUFs. We achieved this by using a new reliability-based machine learning attack that uses a divide-and-conquer approach for attacking the XOR PUFs. This new divide-and-conquer approach results in only a linear increase in needed number of challenge and responses for increasing numbers of XORs. This is in stark contrast to the state-of-the-art machine learning attacks on XOR PUFs that are shown to have an exponential increase in challenge and responses. Hence, it is now possible to attack XOR PUF constructs that were previously believed to be secure against machine learning attacks. Since XOR Arbiter PUFs are one of the most popular and promising electrical strong PUF designs, our reliability-based machine learning attack raises doubts that secure and lightweight electrical strong PUFs can be realized in practice.
引用
收藏
页码:535 / 555
页数:21
相关论文
共 32 条
[1]   A Formal Foundation for the Security Features of Physical Functions [J].
Armknecht, Frederik ;
Maes, Roel ;
Sadeghi, Ahmad-Reza ;
Standaert, Francois-Xavier ;
Wachsmann, Christian .
2011 IEEE SYMPOSIUM ON SECURITY AND PRIVACY (SP 2011), 2011, :397-412
[2]  
Becker G. T., 2014, IACR Cryptol. ePrint Arch., P287
[3]  
Becker G.T, 2015, IEEE T COMPUT AID D, P1
[4]  
Brzuska C, 2011, LECT NOTES COMPUT SC, V6841, P51, DOI 10.1007/978-3-642-22792-9_4
[5]  
chameleon Project, 2015, CHAM MIN
[6]  
Delvaux J, 2013, 6 IEEE INT S HARDW O
[7]   Secure lightweight entity authentication with strong PUFs: Mission impossible? [J].
Delvaux, Jeroen ;
Gu, Dawu ;
Schellekens, Dries ;
Verbauwhede, Ingrid .
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8731 :451-475
[8]   Controlled Physical Random Functions [J].
Gassend, B ;
Clarke, D ;
van Dijk, M ;
Devadas, S .
18TH ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE, PROCEEDINGS, 2002, :149-160
[9]  
Guajardo J, 2007, LECT NOTES COMPUT SC, V4727, P63
[10]   Using Data Contention in Dual-ported Memories for Security Applications [J].
Gueneysu, Tim .
JOURNAL OF SIGNAL PROCESSING SYSTEMS FOR SIGNAL IMAGE AND VIDEO TECHNOLOGY, 2012, 67 (01) :15-29