Secret Key Agreement with Physical Unclonable Functions: An Optimality Summary
We address security and privacy problems for digital devices and biometrics from an information-theoretic optimality perspective, where a secret key is generated for authentication, identification, message encryption/decryption, or secure computations. A physical unclonable function (PUF) is a promising solution for local security in digital devices and this review gives the most relevant summary for information theorists, coding theorists, and signal processing community members who are interested in optimal PUF constructions. Low-complexity signal processing methods such as transform coding that are developed to make the information-theoretic analysis tractable are discussed. The optimal trade-offs between the secret-key, privacy-leakage, and storage rates for multiple PUF measurements are given. Proposed optimal code constructions that jointly design the vector quantizer and error-correction code parameters are listed. These constructions include modern and algebraic codes such as polar codes and convolutional codes, both of which can achieve small block-error probabilities at short block lengths, corresponding to a small number of PUF circuits. Open problems in the PUF literature from a signal processing, information theory, coding theory, and hardware complexity perspectives and their combinations are listed to stimulate further advancements in the research on local privacy and security.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Quality of Service Guarantees for Physical Unclonable Functions
We consider a secret key agreement problem in which noisy physical unclonable function (PUF) outputs facilitate reliable, secure, and private key agreement with the help of public, noiseless, and authenticated storage. P…
Efficient Bound for Conditional Min-Entropy of Physical Unclonable Functions Beyond IID
The remaining min-entropy of a secret generated by fuzzy extraction from a Physical Unclonable Function is typically estimated under the assumption of independent and identically distributed PUF responses, but this assum…
Side Channel AnalysisComparison of Short Blocklength Slepian-Wolf Coding for Key Reconciliation
We focus Slepian-Wolf (SW) coding in the short blocklength for reconciliation in secret key generation and physical unclonable functions. In the problem formulation, two legitimate parties wish to generate a common secre…
Optical identification using physical unclonable functions
In this work, the concept of optical identification (OI) based on physical unclonable functions is introduced for the first time, to our knowledge, in optical communication systems and networks. The OI assigns an optical…
Physically Unclonable Functions and AI: Two Decades of Marriage
The current chapter aims at establishing a relationship between artificial intelligence (AI) and hardware security. Such a connection between AI and software security has been confirmed and well-reviewed in the relevant …
Vocal Bursts Valence Prediction