Capacity of a multiple enrollment system based on an SRAM-PUF: forgetful setting

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

1 Citation (Scopus)

Abstract

We use an SRAM Physical Unclonable Function (PUF) to generate secret keys for authentication purposes. During enrollment, an encoder generates a secret key and corresponding helper data based on an SRAM-PUF observation vector. Later, the device identity is verified by its ability to reconstruct the same key. We define the multiple enrollment forgetful setting. Here, during each consecutive enrollment the previous key is replaced by a new (larger) key based on a new observation of the SRAM-PUF. Furthermore, additional helper data is published after each enrollment. We show that all helper messages together do not reveal information about the relevant secret. Furthermore, the achievable secret-key rate increases with each enrollment, up to a limit that depends on the statistics of the source. For the SRAM-PUF this limit is given by the mutual information between the observation variable and the cell-state.

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Information Theory, ISIT 2018
Place of PublicationPiscataway
PublisherInstitute of Electrical and Electronics Engineers
Pages2624-2628
Number of pages5
ISBN (Electronic)978-1-5386-4781-3
ISBN (Print)978-1-5386-4102-6
DOIs
Publication statusPublished - 15 Aug 2018
Event2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States
Duration: 17 Jun 201822 Jun 2018

Conference

Conference2018 IEEE International Symposium on Information Theory, ISIT 2018
CountryUnited States
CityVail
Period17/06/1822/06/18

Fingerprint

Static random access storage
Authentication
Statistics
Encoder
Mutual Information
Hardware security
Consecutive
Cell
Observation

Cite this

Kusters, L., & Willems, F. M. J. (2018). Capacity of a multiple enrollment system based on an SRAM-PUF: forgetful setting. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (pp. 2624-2628). [8437662] Piscataway: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT.2018.8437662
Kusters, Lieneke ; Willems, Frans M.J. / Capacity of a multiple enrollment system based on an SRAM-PUF : forgetful setting. 2018 IEEE International Symposium on Information Theory, ISIT 2018. Piscataway : Institute of Electrical and Electronics Engineers, 2018. pp. 2624-2628
@inproceedings{e6ae558bf49e4481a04296017f353f0a,
title = "Capacity of a multiple enrollment system based on an SRAM-PUF: forgetful setting",
abstract = "We use an SRAM Physical Unclonable Function (PUF) to generate secret keys for authentication purposes. During enrollment, an encoder generates a secret key and corresponding helper data based on an SRAM-PUF observation vector. Later, the device identity is verified by its ability to reconstruct the same key. We define the multiple enrollment forgetful setting. Here, during each consecutive enrollment the previous key is replaced by a new (larger) key based on a new observation of the SRAM-PUF. Furthermore, additional helper data is published after each enrollment. We show that all helper messages together do not reveal information about the relevant secret. Furthermore, the achievable secret-key rate increases with each enrollment, up to a limit that depends on the statistics of the source. For the SRAM-PUF this limit is given by the mutual information between the observation variable and the cell-state.",
author = "Lieneke Kusters and Willems, {Frans M.J.}",
year = "2018",
month = "8",
day = "15",
doi = "10.1109/ISIT.2018.8437662",
language = "English",
isbn = "978-1-5386-4102-6",
pages = "2624--2628",
booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",
publisher = "Institute of Electrical and Electronics Engineers",
address = "United States",

}

Kusters, L & Willems, FMJ 2018, Capacity of a multiple enrollment system based on an SRAM-PUF: forgetful setting. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437662, Institute of Electrical and Electronics Engineers, Piscataway, pp. 2624-2628, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17/06/18. https://doi.org/10.1109/ISIT.2018.8437662

Capacity of a multiple enrollment system based on an SRAM-PUF : forgetful setting. / Kusters, Lieneke; Willems, Frans M.J.

2018 IEEE International Symposium on Information Theory, ISIT 2018. Piscataway : Institute of Electrical and Electronics Engineers, 2018. p. 2624-2628 8437662.

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Capacity of a multiple enrollment system based on an SRAM-PUF

T2 - forgetful setting

AU - Kusters, Lieneke

AU - Willems, Frans M.J.

PY - 2018/8/15

Y1 - 2018/8/15

N2 - We use an SRAM Physical Unclonable Function (PUF) to generate secret keys for authentication purposes. During enrollment, an encoder generates a secret key and corresponding helper data based on an SRAM-PUF observation vector. Later, the device identity is verified by its ability to reconstruct the same key. We define the multiple enrollment forgetful setting. Here, during each consecutive enrollment the previous key is replaced by a new (larger) key based on a new observation of the SRAM-PUF. Furthermore, additional helper data is published after each enrollment. We show that all helper messages together do not reveal information about the relevant secret. Furthermore, the achievable secret-key rate increases with each enrollment, up to a limit that depends on the statistics of the source. For the SRAM-PUF this limit is given by the mutual information between the observation variable and the cell-state.

AB - We use an SRAM Physical Unclonable Function (PUF) to generate secret keys for authentication purposes. During enrollment, an encoder generates a secret key and corresponding helper data based on an SRAM-PUF observation vector. Later, the device identity is verified by its ability to reconstruct the same key. We define the multiple enrollment forgetful setting. Here, during each consecutive enrollment the previous key is replaced by a new (larger) key based on a new observation of the SRAM-PUF. Furthermore, additional helper data is published after each enrollment. We show that all helper messages together do not reveal information about the relevant secret. Furthermore, the achievable secret-key rate increases with each enrollment, up to a limit that depends on the statistics of the source. For the SRAM-PUF this limit is given by the mutual information between the observation variable and the cell-state.

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

U2 - 10.1109/ISIT.2018.8437662

DO - 10.1109/ISIT.2018.8437662

M3 - Conference contribution

AN - SCOPUS:85052463255

SN - 978-1-5386-4102-6

SP - 2624

EP - 2628

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers

CY - Piscataway

ER -

Kusters L, Willems FMJ. Capacity of a multiple enrollment system based on an SRAM-PUF: forgetful setting. In 2018 IEEE International Symposium on Information Theory, ISIT 2018. Piscataway: Institute of Electrical and Electronics Engineers. 2018. p. 2624-2628. 8437662 https://doi.org/10.1109/ISIT.2018.8437662