Efficient DCT-based secret key generation for the Internet of Things

被引:28
作者
Margelis, George [1 ]
Fafoutis, Xenofon [1 ,2 ]
Oikonomou, George [1 ]
Piechocki, Robert [1 ]
Tryfonas, Theo [1 ]
Thomas, Paul [1 ]
机构
[1] Univ Bristol, Fac Engn, Bristol, Avon, England
[2] Tech Univ Denmark, DTU Compute, Lyngby, Denmark
基金
英国工程与自然科学研究理事会;
关键词
Secret key generation; Physical layer security; IoT Security; Internet of Things (IoT); IEEE; 802.15.4; AGREEMENT;
D O I
10.1016/j.adhoc.2018.08.014
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cryptography is one of the most widely employed means to ensure confidentiality in the Internet of Things (IoT). Establishing cryptographically secure links between IoT devices requires the prior consensus to a secret encryption key. Yet, IoT devices are resource-constrained and cannot employ traditional key distribution schemes. As a result, there is a growing interest in generating secret random keys locally, using the shared randomness of the communicating channel. This article presents a secret key generation scheme, named SKYGlow, which is targeted at resource-constrained IoT platforms and tested on devices that employ IEEE 802.15.4 radios. We first examine the practical upper bounds of the number of secret bits that can be extracted from a message exchange. We contrast these upper bounds with the current state-of-the-art, and elaborate on the workings of the proposed scheme. SKYGlow applies the Discrete Cosine Transform (DCT) on channel observations of exchanged messages to reduce mismatches and increase correlation between the generated secret bits. We validate the performance of SKYGlow in both indoor and outdoor scenarios, at 2.4 GHz and 868 MHz respectively. The results suggest that SKYGlow can create secret 128-bit keys of 0.9978 bits entropy with just 65 packet exchanges, outperforming the state-of-the-art in terms of energy efficiency. (C) 2018 The Authors. Published by Elsevier B.V.
引用
收藏
页数:11
相关论文
共 41 条
[1]  
Abomhara M., 2014, P IEEE INT C PRIV SE, P1, DOI [10.1109/PRISMS.2014.6970594, DOI 10.1109/PRISMS.2014.6970594]
[2]   Common randomness in information theory and cryptography - Part II: CR capacity [J].
Ahlswede, R ;
Csiszar, I .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (01) :225-240
[3]  
Ahlswede R., 1993, IEEE T INF THEORY, V39
[4]  
Ali S. T, 2012, P 5 ACM C SEC PRIV W, P39
[5]   Wireless information-theoretic security [J].
Bloch, Matthieu ;
Barros, Joao ;
Rodrigues, Miguel R. D. ;
McLaughlin, Steven W. .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) :2515-2534
[6]  
Brassard G., 1994, SECRET KEY RECONCILI, P410
[8]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[9]   Theory of multipath shape factors for small-scale fading wireless channels [J].
Durgin, GD ;
Rappaport, TS .
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, 2000, 48 (05) :682-693
[10]  
Eberz Simon, 2012, Computer Security - ESORICS 2012. Proceedings 17th European Symposium on Research in Computer Security, P235, DOI 10.1007/978-3-642-33167-1_14