
Parameter
Mehr zum Buch
This thesis addresses security and privacy problems for digital devices and biometrics, where a secret key is generated for authentication, identification, or secure computations. A physical unclonable function (PUF) is a promising solution for local security in digital devices. A low-complexity transform-coding algorithm is developed to make the information-theoretic analysis tractable and motivate a noisy (hidden) PUF source model. The optimal trade-offs between the secret-key, privacy-leakage, and storage rates for multiple measurements of hidden PUFs are characterized. The first optimal and low-complexity code constructions are proposed. Polar codes are designed to achieve the best known rate tuples. The gains from cost-constrained controllable PUF measurements are illustrated to motivate extensions.
Buchkauf
Key agreement with physical unclonable functions and biometric identifiers, Onur Günlü
- Sprache
- Erscheinungsdatum
- 2019
Lieferung
Zahlungsmethoden
Feedback senden
- Titel
- Key agreement with physical unclonable functions and biometric identifiers
- Sprache
- Englisch
- Autor*innen
- Onur Günlü
- Verlag
- Verlag Dr. Hut
- Erscheinungsdatum
- 2019
- ISBN10
- 3843939128
- ISBN13
- 9783843939126
- Reihe
- Informationstechnik
- Kategorie
- Skripten & Universitätslehrbücher
- Beschreibung
- This thesis addresses security and privacy problems for digital devices and biometrics, where a secret key is generated for authentication, identification, or secure computations. A physical unclonable function (PUF) is a promising solution for local security in digital devices. A low-complexity transform-coding algorithm is developed to make the information-theoretic analysis tractable and motivate a noisy (hidden) PUF source model. The optimal trade-offs between the secret-key, privacy-leakage, and storage rates for multiple measurements of hidden PUFs are characterized. The first optimal and low-complexity code constructions are proposed. Polar codes are designed to achieve the best known rate tuples. The gains from cost-constrained controllable PUF measurements are illustrated to motivate extensions.