Secret Key Generation Over Biased Physical Unclonable Functions With Polar Codes

被引:29
作者
Chen, Bin [1 ,2 ]
Willems, Frans M. J. [2 ]
机构
[1] Hefei Univ Technol, Sch Comp & Informat, Hefei, Anhui, Peoples R China
[2] Eindhoven Univ Technol, Dept Elect Engn, NL-5600 MB Eindhoven, Netherlands
基金
欧盟地平线“2020”; 中国国家自然科学基金;
关键词
Error correction codes; key generation; physical unclonable functions (PUFs); polar codes; SECURE; PERFORMANCE; ALGORITHM; PUFS;
D O I
10.1109/JIOT.2018.2864594
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Internet-of-Things (IoT) devices are usually small, low cost, and have limited resources, which makes them vulnerable to physical and cloning attacks. To secure IoT devices, physical unclonable functions (PUFs) are relatively new security primitives used for device authentication and device-specific secret-key generation. In this paper, we focus on designing a robust construction to derive secret keys from static random-access memory (SRAM)-PUFs, which enjoy the uniqueness and randomness properties stemming from the manufacturing variations of SRAM memory cells. We make use of a polar code construction. Based on the fact that SRAM memory can often be found in today's IoT devices, and since polar codes have been selected as error-correction technique in the fifth generation standard, this makes the proposed scheme a promising candidate for reducing the extra cost and securing resource-constrained IoT devices. In this paper, we propose a novel construction method to eliminate the effect of noise and bias in SRAM-PUFs. We shall prove that the secrecy leakage of the helper data about the secret-key can be made negligible due to polarization and proper code construction design. Results show that the proposed scheme provides a significant improvement of the reliability (achieve a failure probability below 10(-6)) and of the realizable secret-key rate, which is also evaluated by the theoretical analysis. In addition, the proposed scheme provides the possibility to tradeoff complexity, secrecy, and reliability with the same code construction for different IoT applications.
引用
收藏
页码:435 / 445
页数:11
相关论文
共 40 条
[1]  
[Anonymous], 2008, P 3 BEN WORKSH INF S
[2]  
[Anonymous], 2016, IEEE 24 INT C PROGR
[3]  
[Anonymous], ABS170900275 CORR
[4]  
[Anonymous], ABS180107733 CORR
[5]   A performance comparison of polar codes and reed-muller codes [J].
Arikan, Erdal .
IEEE COMMUNICATIONS LETTERS, 2008, 12 (06) :447-449
[6]   Source Polarization [J].
Arikan, Erdal .
2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, :899-903
[7]   Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels [J].
Arikan, Erdal .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) :3051-3073
[8]  
Bai Y, 2017, PROGNOST SYST HEALT, P307
[9]  
Bösch C, 2008, LECT NOTES COMPUT SC, V5154, P181, DOI 10.1007/978-3-540-85053-3_12
[10]  
Chen B., 2017, PROC IEEE GLOB COMMU, P1