Efficient Verifiable Computation of XOR for Biometric Authentication
Paper i proceeding, 2016

This work addresses the security and privacy issues in remote biometric authentication by proposing an efficient mechanism to verify the correctness of the outsourced computation in such protocols. In particular, we propose an efficient verifiable computation of XORing encrypted messages using an XOR linear message authentication code (MAC) and we employ the proposed scheme to build a biometric authentication protocol. The proposed authentication protocol is both secure and privacy-preserving against malicious (as opposed to honest-but-curious) adversaries. Specifically, the use of the verifiable computation scheme together with an homomorphic encryption protects the privacy of biometric templates against malicious adversaries. Furthermore, in order to achieve unlinkability of authentication attempts, while keeping a low communication overhead, we show how to apply Oblivious RAM and biohashing to our protocol. We also provide a proof of security for the proposed solution. Our simulation results show that the proposed authentication protocol is efficient.

Universal hash functions

Template privacy and security

Verifiable computation

Homomorphic encryption

Biometric authentication


Aysajan Abidin

KU Leuven

Abdelrahaman Aly

KU Leuven

Enrique Argones Rua

KU Leuven

Aikaterini Mitrokotsa

Chalmers, Data- och informationsteknik, Nätverk och system

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 10052 284-298
978-3-319-48964-3 (ISBN)


Informations- och kommunikationsteknik





Mer information

Senast uppdaterat