Lightweight PUF-based Continuous Authentication Protocol

被引:0
作者
Goutsos, Konstantinos [1 ]
Bystrov, Alex [1 ]
机构
[1] Newcastle Univ, Sch Engn, Syst Grp, Newcastle Upon Tyne, Tyne & Wear, England
来源
2019 INTERNATIONAL CONFERENCE ON COMPUTING, ELECTRONICS & COMMUNICATIONS ENGINEERING (ICCECE) | 2019年
关键词
authentication; physical unclonable functions; security protocols; unclonability; internet of things; KEY; SECURITY;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Given the recent rise of the Internet-of-Things (IoT), networked devices are becoming deeply embedded into everyday objects, leading to a need for novel security methods. Physical Unclonable Functions (PUFs) enable the differentiation between instances of the same device and have the potential to replace costly cryptographic operations while providing higher security guarantees, due to their inherent unclonability. We present a pairwise, continuous authentication protocol based on Physical Unclonable Functions (PUFs) and supporting mutual authentication on resource constrained nodes. The unclonability provided by the PUFs is an integral part of the authentication process to continuously prove the existence of the PUF secrets and the proposed protocol is executed periodically to enable the establishment of trust between the participants. This is achieved by refreshing the authentication information in every protocol round, leading to a 'CRP Ratchet' mechanism of renewing the authenticating PUF challenge response pairs (CRPs). We also discuss the security and performance of the protocol in IoT applications with a large number of devices. Since the only operations used in the periodic protocol phase are hashing and exclusive OR, low computation, complexity, and energy consumption overhead is achieved.
引用
收藏
页码:229 / 234
页数:6
相关论文
共 21 条
[1]  
Abdalla M, 2000, LECT NOTES COMPUT SC, V1976, P546
[2]  
Aman M., 2016, Proc. Int'l Workshop on IoT Privacy, Trust, P10, DOI [10.1145/2899007.2899013, DOI 10.1145/2899007.2899013]
[3]   A PUF-based hardware mutual authentication protocol [J].
Barbareschi, Mario ;
De Benedictis, Alessandra ;
Mazzocca, Nicola .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2018, 119 :107-120
[4]   Fuzzy extractors: How to generate strong keys from biometrics and other noisy data [J].
Dodis, Yevgeniy ;
Ostrovsky, Rafail ;
Reyzin, Leonid ;
Smith, Adam .
SIAM JOURNAL ON COMPUTING, 2008, 38 (01) :97-139
[5]   ON THE SECURITY OF PUBLIC KEY PROTOCOLS [J].
DOLEV, D ;
YAO, AC .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (02) :198-208
[6]  
Goutsos K., 2019, TECH REP
[7]   Anti-counterfeiting, key distribution, and key storage in an ambient world via physical unclonable functions [J].
Guajardo, Jorge ;
Skoric, Boris ;
Tuyls, Pim ;
Kumar, Sandeep S. ;
Bel, Thijs ;
Blom, Antoon H. M. ;
Schrijen, Geert-Jan .
INFORMATION SYSTEMS FRONTIERS, 2009, 11 (01) :19-41
[8]   Barrel Shifter Physical Unclonable Function Based Encryption [J].
Guo, Yunxi ;
Dee, Timothy ;
Tyagi, Akhilesh .
CRYPTOGRAPHY, 2018, 2 (03) :1-19
[9]  
Herder C., 2017, IACR CRYPTOLOGY EPRI
[10]  
Horstman T, 2010, NEW SCIENCE OF LEARNING: COGNITION, COMPUTERS AND COLLABORATION IN EDUCATION, P183, DOI 10.1007/978-1-4419-5716-0_9