X-Lock

A Secure XOR-Based Fuzzy Extractor for Resource Constrained Devices

Conference Paper (2024)
Author(s)

Edoardo Liberati (Sapienza University of Rome)

Alessandro Visintin (University of Padua)

Riccardo Lazzeretti (Sapienza University of Rome)

Mauro Conti (TU Delft - Cyber Security, Università degli Studi di Padova)

Selcuk Uluagac (Florida International University)

Research Group
Cyber Security
DOI related publication
https://doi.org/10.1007/978-3-031-54770-6_8
More Info
expand_more
Publication Year
2024
Language
English
Research Group
Cyber Security
Bibliographical Note
Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public. @en
Pages (from-to)
183-210
ISBN (print)
978-3-031-54769-0
ISBN (electronic)
978-3-031-54770-6
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

The Internet of Things rapid growth poses privacy and security challenges for the traditional key storage methods. Physical Unclonable Functions offer a potential solution but require secure fuzzy extractors to ensure reliable replication. This paper introduces X-Lock, a novel and secure computational fuzzy extractor that addresses the limitations faced by traditional solutions in resource-constrained IoT devices. X-Lock offers a reusable and robust solution, effectively mitigating the impacts of bias and correlation through its design. Leveraging the preferred state of a noisy source, X-Lock encrypts a random string of bits that can be later used as seed to generate multiple secret keys. To prove our claims, we provide a comprehensive theoretical analysis, addressing security considerations, and implement the proposed model. To evaluate the effectiveness and superiority of our proposal, we also provide practical experiments and compare the results with existing approaches. The experimental findings demonstrate the efficacy of our algorithm, showing comparable memory cost (≈2.4 KB for storing 5 keys of 128 bits) while being 3 orders of magnitude faster with respect to the state-of-the-art solution (0.086 ms against 15.51 s).

Files

978-3-031-54770-6_8.pdf
(pdf | 1.07 Mb)
- Embargo expired in 01-09-2024
License info not available