Toggle Main Menu Toggle Search

Open Access padlockePrints

The Newcastle University research output collection, currently available on ePrints, will shortly be moving to a new open repository platform, Figshare. To prepare for the data migration we have paused adding new content to ePrints, and will resume once the new repository is launched. During this time you will continue to have access to ePrints (but no new content will appear). We will share updates here when available.

Lightweight PUF-based Continuous Authentication Protocol

Lookup NU author(s): Konstantinos GoutsosORCiD, Dr Alex Bystrov

Downloads


Licence

This is the authors' accepted manuscript of a conference proceedings (inc. abstract) that has been published in its final definitive form by IEEE, 2019.

For re-use rights please refer to the publisher's terms and conditions.


Abstract

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.


Publication metadata

Author(s): Goutsos K, Bystrov A

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 2019 International Conference on Computing, Electronics & Communications Engineering (iCCECE)

Year of Conference: 2019

Pages: 229-234

Online publication date: 26/12/2019

Acceptance date: 02/04/2018

Date deposited: 07/01/2022

Publisher: IEEE

URL: https://doi.org/10.1109/iCCECE46942.2019.8941608

DOI: 10.1109/iCCECE46942.2019.8941608

Library holdings: Search Newcastle University Library for this item

ISBN: 9781728121383


Share