Skip to content

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

Research output: Contribution to journalArticle

Original languageEnglish
Number of pages11
JournalAd Hoc Networks
Early online date28 Aug 2018
DOIs
DateAccepted/In press - 18 Aug 2018
DateE-pub ahead of print (current) - 28 Aug 2018

Abstract

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.

    Research areas

  • IEEE 802.15.4, Internet of Things (IoT), IoT Security, Physical layer security, Secret key generation

Download statistics

No data available

Documents

Documents

  • Full-text PDF (final published version)

    Rights statement: This is the final published version of the article (version of record). It first appeared online via Elsevier at https://doi.org/10.1016/j.adhoc.2018.08.014 . Please refer to any applicable terms of use of the publisher.

    Proof, 2 MB, PDF document

    Licence: CC BY

DOI

View research connections

Related faculties, schools or groups