THRIVE: Threshold Homomorphic encryption based secure and privacy preserving bIometric VErification system

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

Finger Vein Template Protection with Directional Bloom Filter

Biometrics has become a widely accepted solution for secure user authentication. However, the use of biometric traits raises serious concerns about the protection of personal data and privacy. Traditional biometric systems are vulnerable to attacks due to the storage of original biometric data in the system. Because biometric data cannot be changed once it has been compromised, the use of a biometric system is limited by the security of its template. To protect biometric templates, this paper proposes the use of directional bloom filters as a cancellable biometric approach to transform the biometric data into a non-invertible template for user authentication purposes. Recently, Bloom filter has been used for template protection due to its efficiency with small template size, alignment invariance, and irreversibility. Directional Bloom Filter improves on the original bloom filter. It generates hash vectors with directional subblocks rather than only a single-column subblock in the original bloom filter. Besides, we make use of multiple fingers to generate a biometric template, which is termed multi-instance biometrics. It helps to improve the performance of the method by providing more information through the use of multiple fingers. The proposed method is tested on three public datasets and achieves an equal error rate (EER) as low as 5.28% in the stolen or constant key scenario. Analysis shows that the proposed method meets the four properties of biometric template protection. Doi: 10.28991/HIJ-2023-04-02-013 Full Text: PD

PVSNet: Palm Vein Authentication Siamese Network Trained using Triplet Loss and Adaptive Hard Mining by Learning Enforced Domain Specific Features

Designing an end-to-end deep learning network to match the biometric features with limited training samples is an extremely challenging task. To address this problem, we propose a new way to design an end-to-end deep CNN framework i.e., PVSNet that works in two major steps: first, an encoder-decoder network is used to learn generative domain-specific features followed by a Siamese network in which convolutional layers are pre-trained in an unsupervised fashion as an autoencoder. The proposed model is trained via triplet loss function that is adjusted for learning feature embeddings in a way that minimizes the distance between embedding-pairs from the same subject and maximizes the distance with those from different subjects, with a margin. In particular, a triplet Siamese matching network using an adaptive margin based hard negative mining has been suggested. The hyper-parameters associated with the training strategy, like the adaptive margin, have been tuned to make the learning more effective on biometric datasets. In extensive experimentation, the proposed network outperforms most of the existing deep learning solutions on three type of typical vein datasets which clearly demonstrates the effectiveness of our proposed method.Comment: Accepted in 5th IEEE International Conference on Identity, Security and Behavior Analysis (ISBA), 2019, Hyderabad, Indi

Review on Facial Recognition

Generally face recognition perform many operations in our daily life such as security purpose identification of people and verification purpose. The basic aim of my project is to design an effective and secure technique for authentication using face recognition that can search or recognize a human face among the thousands of persons and improve the performance of face recognition system in low light conditions and also evaluate the performance of the designed framework by comparing the performance of existing face recognition system. This study also provides a automatic system through which a given still image or video of a scene, identify one or more persons in this scene by using a stored database of facial images

Revocable and non-invertible multibiometric template protection based on matrix transformation

Biometric authentication refers to the use of measurable characteristics (or features) of the human body to provide secure, reliable and convenient access to a computer system or physical environment. These features (physiological or behavioural) are unique to individual subjects because they are usually obtained directly from their owner's body. Multibiometric authentication systems use a combination of two or more biometric modalities to provide improved performance accuracy without offering adequate protection against security and privacy attacks. This paper proposes a multibiometric matrix transformation based technique, which protects users of multibiometric systems from security and privacy attacks. The results of security and privacy analyses show that the approach provides high-level template security and user privacy compared to previous one-way transformation techniques

Indexing techniques for fingerprint and iris databases

This thesis addresses the problem of biometric indexing in the context of fingerprint and iris databases. In large scale authentication system, the goal is to determine the identity of a subject from a large set of identities. Indexing is a technique to reduce the number of candidate identities to be considered by the identification algorithm. The fingerprint indexing technique (for closed set identification) proposed in this thesis is based on a combination of minutiae and ridge features. Experiments conducted on the FVC2002 and FVC2004 databases indicate that the inclusion of ridge features aids in enhancing indexing performance. The thesis also proposes three techniques for iris indexing (for closed set identification). The first technique is based on iriscodes. The second technique utilizes local binary patterns in the iris texture. The third technique analyzes the iris texture based on a pixel-level difference histogram. The ability to perform indexing at the texture level avoids the computational complexity involved in encoding and is, therefore, more attractive for iris indexing. Experiments on the CASIA 3.0 database suggest the potential of these schemes to index large-scale iris databases

Image Robust Hashing for Malware Detection

This research is focused on a novel approach to detect malware based on static analysis of executable files. Specifically, we treat each executable file as a twodimensional image and use robust hashing techniques to identify whether a given executable belongs to a particular family or not. The hashing stage comprises two steps, namely, feature extraction, and compression. We compare our robust hashing approach to other machine learning-based techniques