CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Efficient Verifiable Computation of XOR for Biometric Authentication

Aysajan Abidin ; Abdelrahaman Aly ; Enrique Argones Rua ; Aikaterini Mitrokotsa (Institutionen för data- och informationsteknik, Nätverk och system (Chalmers) )
Proceedings of the 15th International Conference on Cryptology and Network Security (CANS 2016) Vol. 10052 (2016), p. 284-298.
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Verifiable computation, Universal hash functions, Homomorphic encryption, Biometric authentication, Template privacy and security



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2016-11-22. Senast ändrad 2016-11-24.
CPL Pubid: 245547

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)