Topic: Computationally Efficient Homomorphic Encryption for Iris Codes
by Jascha Kolberg
D19/2.03a, January 25, 2018 (Thursday), 12.00 noon
Keywords — Biometric Template Protection, Homomorphic Encryption
In spite of the many advantages offered by biometric recognition systems, biometric data are considered sensitive data. This has raised some privacy issues, and therefore secure systems providing template protection are required. Using homomorphic encryption, permanent protection can be ensured, since templates are stored and compared in the encrypted domain. In addition, the unprotected system’s accuracy is preserved. To solve the problem of the computational overload linked to the encryption scheme, an early decision making strategy for iris codes is presented. In order to improve the recognition accuracy, the most consistent bits of the iris code are moved to the beginning of the template. This allows an accurate block-wise comparison, thereby reducing the execution time. Hence, the resulting system grants template protection in a computationally efficient way.