Code Constructions for Physical Unclonable Functions and Biometric Secrecy Systems

TL;DR

This paper introduces two novel linear code constructions based on Wyner-Ziv coding for physical unclonable functions and biometric systems, demonstrating improved privacy and storage rates through simulations.

Contribution

It presents new code constructions using random linear codes and nested polar codes that outperform existing designs in biometric and PUF-based key agreement.

Findings

Nested polar codes improve privacy-leakage and storage rates

One code achieves a rate tuple not possible with previous methods

Simulations confirm the effectiveness of the proposed codes

Abstract

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.