On the Key Generation Rate of Physically Unclonable Functions
Yitao Chen, Muryong Kim, and Sriram Vishwanath

TL;DR
This paper establishes the optimal key generation rate for PUFs using an algebraic binning coding scheme and introduces a polar code-based method for efficient encoding and decoding.
Contribution
It presents the first optimal rate characterization for PUF key generation under the GS model and provides a practical polar coding scheme to achieve this rate.
Findings
Achieves the optimal key generation rate for PUFs.
Proposes a polynomial-time polar coding scheme.
Demonstrates the scheme's effectiveness in key generation.
Abstract
In this paper, an algebraic binning based coding scheme and its associated achievable rate for key generation using physically unclonable functions (PUFs) is determined. This achievable rate is shown to be optimal under the generated-secret (GS) model for PUFs. Furthermore, a polar code based polynomial-time encoding and decoding scheme that achieves this rate is also presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPhysical Unclonable Functions (PUFs) and Hardware Security · Chaos-based Image/Signal Encryption · Biometric Identification and Security
