Efficient power and timing side channels for physical unclonable functions

被引:89
作者
Rührmair, Ulrich [1 ]
Xu, Xiaolin [1 ]
Sölter, Jan [3 ]
Mahmoud, Ahmed [1 ]
Majzoobi, Mehrdad [4 ]
Koushanfar, Farinaz [4 ]
Burleson, Wayne [2 ]
机构
[1] Technische Universität München, München
[2] University of Massachusetts Amherst, Amherst, 01003, MA
[3] Freie Universität Berlin, Berlin
[4] Rice University, Houston, 77005, TX
来源
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2014年 / 8731卷
关键词
Hardware security; Machine learning; Modeling attacks; Physical unclonable functions (PUFs); Power side channel; Side-channel attacks; Timing side channel;
D O I
10.1007/978-3-662-44709-3_26
中图分类号
学科分类号
摘要
One part of the original PUF promise was their improved resilience against physical attack methods, such as cloning, invasive techniques, and arguably also side channels. In recent years, however, a number of effective physical attacks on PUFs have been developed [17,18,20,8,2]. This paper continues this line of research, and introduces the first power and timing side channels (SCs) on PUFs, more specifically on Arbiter PUF variants. Concretely, we attack socalled XOR Arbiter PUFs and Lightweight PUFs, which prior to our work were considered the most secure members of the Arbiter PUF family [28,30].We show that both architectures can be tackled with polynomial complexity by a combined SC and machine learning approach.; Our strategy is demonstrated in silicon on FPGAs, where we attack the above two architectures for up to 16 XORs and 512 bits. For comparison, in earlier works XOR-based Arbiter PUF designs with only up to 5 or 6 XORs and 64 or 128 bits had been tackled successfully. Designs with 8 XORs and 512 bits had been explicitly recommended as secure for practical use [28,30].; Together with recent modeling attacks [28,30], our work shows that unless suitable design countermeasures are put in place, no remaining member of the Arbiter PUF family resists all currently known attacks. Our work thus motivates research on countermeasures in Arbiter PUFs, or on the development of entirely new Strong PUF designs with improved resilience. © 2014 International Association for Cryptologic Research.
引用
收藏
页码:476 / 492
页数:16
相关论文
共 31 条
[1]  
Bishop C.M., Nasrabadi N.M., Pattern recognition and machine learning, (2006)
[2]  
Delvaux J., Verbauwhede I., Side channel modeling attacks on 65nm arbiter PUFs exploiting CMOS device noise, HOST, (2013)
[3]  
Delvaux J., Verbauwhede I., Attacking PUF-Based Pattern Matching Key Generators via Helper Data Manipulation, IACR Cryptology ePrint Archive, (2013)
[4]  
Delvaux J., Verbauwhede I., Key-recovery Attacks on Various RO PUF Constructions via Helper Data Manipulation, IACR Cryptology ePrint Archive, (2013)
[5]  
Delvaux J., Verbauwhede I., Fault Injection Modeling Attacks on 65nm Arbiter and RO Sum PUFs via Environmental Changes, IACR Cryptology ePrint Archive, (2013)
[6]  
Devadas S., Physical unclonable functions and secure processors, CHES 2009. LNCS, 5747, (2009)
[7]  
Gassend B., Clarke D., Van Dijk M., Devadas S., Silicon physical random functions, ACM Conference on Computer and Communications Security, pp. 148–160, (2002)
[8]  
Helfmeier C., Nedospasov D., Boit C., Seifert J.-P., Cloning Physically Unclonable Functions, HOST 2013, (2013)
[9]  
Lim D., Extracting Secret Keys from Integrated Circuits, (2004)
[10]  
Majzoobi M., Koushanfar F., Devadas S., FPGA PUF using programmable delay lines, IEEEWorkshop Information Forensics and Security, WIFS, (2010)