Polar Codes for Biometric Identification and Authentication

In this work, we present a polar code design that offers a provably optimal solution for biometric identification systems allowing authentication under noisy enrollment with secrecy and privacy constraints. Binary symmetric memoryless source and channels are considered. It is shown that the proposed polar code design achieves the fundamental limits and satisfies more stringent secrecy constraints than previously in the literature. The proposed polar code design provides the first example of a code design that achieves the fundamental limits involving both identification and authentication.