Abstract

In this paper, we propose a new biometric verification and template protection system which we call the THRIVE system. The system includes novel enrollment and authentication protocols based on threshold homomorphic cryptosystem where the private key is shared between a user and the verifier. In the THRIVE system, only encrypted binary biometric templates are stored in the database and verification is performed via homomorphically randomized templates, thus, original templates are never revealed during the authentication stage. The THRIVE system is designed for the malicious model where the cheating party may arbitrarily deviate from the protocol specification. Since threshold homomorphic encryption scheme is used, a malicious database owner cannot perform decryption on encrypted templates of the users in the database. Therefore, security of the THRIVE system is enhanced using a two-factor authentication scheme involving the user's private key and the biometric data. We prove security and privacy preservation capability of the proposed system in the simulation-based model with no assumption. The proposed system is suitable for applications where the user does not want to reveal her biometrics to the verifier in plain form but she needs to proof her physical presence by using biometrics. The system can be used with any biometric modality and biometric feature extraction scheme whose output templates can be binarized. The overall connection time for the proposed THRIVE system is estimated to be 336 ms on average for 256-bit biohash vectors on a desktop PC running with quad-core 3.2 GHz CPUs at 10 Mbit/s up/down link connection speed. Consequently, the proposed system can be efficiently used in real life applications.

Highlights

  • In recent times, public and commercial organizations invest on secure electronic authentication systems to reliably verify identity of individuals

  • By taking possible attacks into consideration, we propose a new biometric authentication system based on threshold homomorphic encryption

  • We believe the system we propose can be used in a broad class of verification systems with minor modification in the system to binarize the templates and use Hamming distance for distance calculation, which will result in minimal loss of security properties in the system (such as equal error rate (EER) etc.)

Read more

Summary

Introduction

Public and commercial organizations invest on secure electronic authentication (eauthentication) systems to reliably verify identity of individuals. 2.2.3 Modern cryptography for biometrics In recent years, a number of papers have been published on systems in which biometrics and homomorphic encryption work together for either authentication or identification purposes These systems have cryptographic protocols based on secure multiparty computation and most of them especially use superior properties of homomorphic encryption schemes (e.g., allow computation on encrypted data) in order to overcome security and privacy threats to the biometric data. The values stored on the enrollment server are the XORed values of the biometric template vector with the corresponding user’s key, the user first extracts and sends her biometric features to the trusted enrollment server This system uses a trusted enrollment server and fails to provide security and privacy objectives against a malicious database manager. It cannot guarantee biometric database security since biometric templates are stored in plain form in the database

Preliminaries
Threshold XOR-Homomorphic Goldwasser-Micali encryption scheme
Quantization
Step 1
Step 2
Step 4: V verifies the signature
Security proof of the proposed authentication protocol
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call