Controlled physical random functions and applications

被引:79
作者
Gassend, Blaise [1 ]
Van Dijk, Marten [1 ]
Clarke, Dwaine [1 ]
Torlak, Emina [1 ]
Devadas, Srinivas [1 ]
Tuyls, Pim [2 ]
机构
[1] MIT, Cambridge, MA 02139 USA
[2] Philips Res Labs, Eindhoven, Netherlands
关键词
security; theory; certified execution; physical security; physical random function; physical unclonable function; trusted computing;
D O I
10.1145/1284680.1284683
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The cryptographic protocols that we use in everyday life rely on the secure storage of keys in consumer devices. Protecting these keys from invasive attackers, who open a device to steal its key, is a challenging problem. We propose controlled physical random functions ( CPUFs) as an alternative to storing keys and describe the core protocols that are needed to use CPUFs. A physical random functions (PUF) is a physical system with an input and output. The functional relationship between input and output looks like that of a random function. The particular relationship is unique to a specific instance of a PUF, hence, one needs access to a particular PUF instance to evaluate the function it embodies. The cryptographic applications of a PUF are quite limited unless the PUF is combined with an algorithm that limits the ways in which the PUF can be evaluated; this is a CPUF. A major difficulty in using CPUFs is that you can only know a small set of outputs of the PUF - the unknown outputs being unrelated to the known ones. We present protocols that get around this difficulty and allow a chain of trust to be established between the CPUF manufacturer and a party that wishes to interact securely with the PUF device. We also present some elementary applications, such as certified execution.
引用
收藏
页数:22
相关论文
共 31 条
[1]  
Alves T., 2004, Information Quarterly
[2]  
Anderson R, 1996, PROCEEDINGS OF THE SECOND USENIX WORKSHOP ON ELECTRONIC COMMERCE, P1
[3]  
ANDERSON R, 1997, LNCS
[4]  
Anderson Ross., 2001, SECURITY ENG GUIDE B
[5]  
[Anonymous], 2001, THESIS MIT
[6]  
[Anonymous], 2003, THESIS MIT
[7]  
[Anonymous], 2002, P 18 ANN COMP SEC AP
[8]  
[Anonymous], 1994, THESIS CARNEGIE MELL
[9]  
CARROLI A, 2002, MICROSOFT CONTENT SE
[10]  
Chinnery D., 2002, CLOSING GAP ASIC CUS