# Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems

arXiv: https://arxiv.org/abs/1709.00275 · HTML: https://mlsanity.com/paper/1709.00275/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 1 Sep 2017.

## Built on by (most cited first, 2 of 2)

- [Secure Multi-Function Computation with Private Remote Sources](https://mlsanity.com/paper/2106.09485/) (2021)
- [Quality of Service Guarantees for Physical Unclonable Functions](https://mlsanity.com/paper/2107.05675/) (2021)

## Abstract (arXiv)

The two-terminal key agreement problem with biometric or physical identifiers is considered. Two linear code constructions based on Wyner-Ziv coding are developed. The first construction uses random linear codes and achieves all points of the key-leakage-storage regions of the generated-secret and chosen-secret models. The second construction uses nested polar codes for vector quantization during enrollment and for error correction during reconstruction. Simulations show that the nested polar codes achieve privacy-leakage and storage rates that improve on existing code designs. One proposed code achieves a rate tuple that cannot be achieved by existing methods.