Secret-key capacity regions for multiple enrollments with an SRAM-PUF

C.J. Kusters; F.M.J. Willems

doi:10.1109/TIFS.2019.2895552

Secret-key capacity regions for multiple enrollments with an SRAM-PUF

C.J. Kusters (Corresponding author), F.M.J. Willems

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

27 Citaten (Scopus)

201 Downloads (Pure)

Samenvatting

We introduce the multiple enrollment scheme for SRAM-PUFs. During each enrollment the binary power-on values of the SRAM are observed, and a corresponding key and helper data are generated. Each key can later be reconstructed from an additional observation and the helper data. The helper data do not reveal information about the keys to an attacker. It is our goal to use the additional enrollments to consecutively increase the entropy of the generated key material.

We analyze two alternative settings. First, we present a regular setting, where each additional key is independent of all previous keys. Secondly, we introduce a key-replacement setting, where instead of an additional independent key, a new key (of increased length) is generated that replaces the old key.
We characterize the capacity regions for both settings. We show that the total achievable secret-key rate is equal to the mutual information between all enrollment observations and a single (reconstruction) observation.

We derive our results based on a statistical model for SRAM-PUF that has been proposed in the literature. This model implies a \textit{permutation symmetry} property of SRAM-PUF which plays a key role in our proofs.

Originele taal-2	Engels
Artikelnummer	8626480
Pagina's (van-tot)	2276-2287
Aantal pagina's	12
Tijdschrift	IEEE Transactions on Information Forensics and Security
Volume	14
Nummer van het tijdschrift	9
DOI's	https://doi.org/10.1109/TIFS.2019.2895552
Status	Gepubliceerd - sep. 2019

Financiering

Manuscript received August 6, 2018; revised November 12, 2018 and January 11, 2019; accepted January 11, 2019. Date of publication January 25, 2019; date of current version May 24, 2019. This work was supported in part by the Eurostars-2 Joint Programme and in part by the EU Horizon 2020 Programme through the E! 9629 PATRIOT Project and the E! 11897 RESCURE Project. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Walid Saad. (Corresponding author: Lieneke Kusters.) The authors are with the Department of Electrical Engineering, Eindhoven University of Technology, 5600 MB Eindhoven, The Netherlands (e-mail: [email protected]; [email protected]). Digital Object Identifier 10.1109/TIFS.2019.2895552

Toegang tot document

10.1109/TIFS.2019.2895552

authorversionFinale auteursversie , 1,75 MB

Andere bestanden en links

Link to publication in Scopus

Retrofit Security for Critical infrastructures
Willems, F. M. J. (Project Manager), Kusters, C. J. (Projectmedewerker), Keijzers, A. (Projectadministrateur Decentraal), Sanders, R. (Project communicatie medewerker), Alvarado, A. (Project communicatie medewerker), Barreiro, A. (Project communicatie medewerker), Croes, S. (Projectadministrateur Centraal) & de Jonge, M. (Project communicatie medewerker)
1/02/18 → 31/01/20
Project: Onderzoek direct

Citeer dit

@article{4483cd3109bc43c68b367bea21e6911b,

title = "Secret-key capacity regions for multiple enrollments with an SRAM-PUF",

abstract = "We introduce the multiple enrollment scheme for SRAM-PUFs. During each enrollment the binary power-on values of the SRAM are observed, and a corresponding key and helper data are generated. Each key can later be reconstructed from an additional observation and the helper data. The helper data do not reveal information about the keys to an attacker. It is our goal to use the additional enrollments to consecutively increase the entropy of the generated key material.We analyze two alternative settings. First, we present a regular setting, where each additional key is independent of all previous keys. Secondly, we introduce a key-replacement setting, where instead of an additional independent key, a new key (of increased length) is generated that replaces the old key.We characterize the capacity regions for both settings. We show that the total achievable secret-key rate is equal to the mutual information between all enrollment observations and a single (reconstruction) observation.We derive our results based on a statistical model for SRAM-PUF that has been proposed in the literature. This model implies a \textit{permutation symmetry} property of SRAM-PUF which plays a key role in our proofs.",

keywords = "SRAM cell, Security, Internet of Things, Secret-key capacity, Slepian–Wolf coding",

author = "C.J. Kusters and F.M.J. Willems",

year = "2019",

month = sep,

doi = "10.1109/TIFS.2019.2895552",

language = "English",

volume = "14",

pages = "2276--2287",

journal = "IEEE Transactions on Information Forensics and Security",

issn = "1556-6013",

publisher = "Institute of Electrical and Electronics Engineers",

number = "9",

}

TY - JOUR

T1 - Secret-key capacity regions for multiple enrollments with an SRAM-PUF

AU - Kusters, C.J.

AU - Willems, F.M.J.

PY - 2019/9

Y1 - 2019/9

N2 - We introduce the multiple enrollment scheme for SRAM-PUFs. During each enrollment the binary power-on values of the SRAM are observed, and a corresponding key and helper data are generated. Each key can later be reconstructed from an additional observation and the helper data. The helper data do not reveal information about the keys to an attacker. It is our goal to use the additional enrollments to consecutively increase the entropy of the generated key material.We analyze two alternative settings. First, we present a regular setting, where each additional key is independent of all previous keys. Secondly, we introduce a key-replacement setting, where instead of an additional independent key, a new key (of increased length) is generated that replaces the old key.We characterize the capacity regions for both settings. We show that the total achievable secret-key rate is equal to the mutual information between all enrollment observations and a single (reconstruction) observation.We derive our results based on a statistical model for SRAM-PUF that has been proposed in the literature. This model implies a \textit{permutation symmetry} property of SRAM-PUF which plays a key role in our proofs.

AB - We introduce the multiple enrollment scheme for SRAM-PUFs. During each enrollment the binary power-on values of the SRAM are observed, and a corresponding key and helper data are generated. Each key can later be reconstructed from an additional observation and the helper data. The helper data do not reveal information about the keys to an attacker. It is our goal to use the additional enrollments to consecutively increase the entropy of the generated key material.We analyze two alternative settings. First, we present a regular setting, where each additional key is independent of all previous keys. Secondly, we introduce a key-replacement setting, where instead of an additional independent key, a new key (of increased length) is generated that replaces the old key.We characterize the capacity regions for both settings. We show that the total achievable secret-key rate is equal to the mutual information between all enrollment observations and a single (reconstruction) observation.We derive our results based on a statistical model for SRAM-PUF that has been proposed in the literature. This model implies a \textit{permutation symmetry} property of SRAM-PUF which plays a key role in our proofs.

KW - SRAM cell

KW - Security

KW - Internet of Things

KW - Secret-key capacity

KW - Slepian–Wolf coding

UR - http://www.scopus.com/inward/record.url?scp=85066466828&partnerID=8YFLogxK

U2 - 10.1109/TIFS.2019.2895552

DO - 10.1109/TIFS.2019.2895552

M3 - Article

AN - SCOPUS:85066466828

SN - 1556-6013

VL - 14

SP - 2276

EP - 2287

JO - IEEE Transactions on Information Forensics and Security

JF - IEEE Transactions on Information Forensics and Security

IS - 9

M1 - 8626480

ER -

Secret-key capacity regions for multiple enrollments with an SRAM-PUF

Samenvatting

Financiering

Toegang tot document

Andere bestanden en links

Vingerafdruk

Projecten

Retrofit Security for Critical infrastructures

Citeer dit