Blind-Match: Efficient Homomorphic Encryption-Based 1:N Matching for Privacy-Preserving Biometric Identification

• URL: http://arxiv.org/abs/2408.06167v2
• Date: Sun, 13 Oct 2024 15:08:27 GMT
• Title: Blind-Match: Efficient Homomorphic Encryption-Based 1:N Matching for Privacy-Preserving Biometric Identification
• Authors: Hyunmin Choi, Jiwon Kim, Chiyoung Song, Simon S. Woo, Hyoungshick Kim,
• Abstract summary: Blind-Match is a novel biometric identification system that leverages homomorphic encryption (HE) for efficient and privacy-preserving 1:N matching. Blind-Match achieves superior performance compared to state-of-the-art methods across various biometric datasets.
• Score: 31.48009609210313
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present Blind-Match, a novel biometric identification system that leverages homomorphic encryption (HE) for efficient and privacy-preserving 1:N matching. Blind-Match introduces a HE-optimized cosine similarity computation method, where the key idea is to divide the feature vector into smaller parts for processing rather than computing the entire vector at once. By optimizing the number of these parts, Blind-Match minimizes execution time while ensuring data privacy through HE. Blind-Match achieves superior performance compared to state-of-the-art methods across various biometric datasets. On the LFW face dataset, Blind-Match attains a 99.63% Rank-1 accuracy with a 128-dimensional feature vector, demonstrating its robustness in face recognition tasks. For fingerprint identification, Blind-Match achieves a remarkable 99.55% Rank-1 accuracy on the PolyU dataset, even with a compact 16-dimensional feature vector, significantly outperforming the state-of-the-art method, Blind-Touch, which achieves only 59.17%. Furthermore, Blind-Match showcases practical efficiency in large-scale biometric identification scenarios, such as Naver Cloud's FaceSign, by processing 6,144 biometric samples in 0.74 seconds using a 128-dimensional feature vector.

Related papers

• Efficient and Effective Retrieval of Dense-Sparse Hybrid Vectors using Graph-based Approximate Nearest Neighbor Search [14.821492155733555]
  We propose a graph-based ANNS algorithm for dense-sparse hybrid vectors. We show that our algorithm achieves 8.9x$sim$11.7x throughput at equal accuracy compared to existing hybrid vector search algorithms.
  arXiv  Detail & Related papers  (2024-10-27T09:12:51Z)
• IdentiFace : A VGG Based Multimodal Facial Biometric System [0.0]
  "IdentiFace" is a multimodal facial biometric system that combines the core of facial recognition with some of the most important soft biometric traits such as gender, face shape, and emotion. For the recognition problem, we acquired a 99.2% test accuracy for five classes with high intra-class variations using data collected from the FERET database. We were also able to achieve a testing accuracy of 88.03% in the face-shape problem using the celebrity face-shape dataset.
  arXiv  Detail & Related papers  (2024-01-02T14:36:28Z)
• SimMatchV2: Semi-Supervised Learning with Graph Consistency [53.31681712576555]
  We introduce a new semi-supervised learning algorithm - SimMatchV2. It formulates various consistency regularizations between labeled and unlabeled data from the graph perspective. SimMatchV2 has been validated on multiple semi-supervised learning benchmarks.
  arXiv  Detail & Related papers  (2023-08-13T05:56:36Z)
• Transaction Fraud Detection via an Adaptive Graph Neural Network [64.9428588496749]
  We propose an Adaptive Sampling and Aggregation-based Graph Neural Network (ASA-GNN) that learns discriminative representations to improve the performance of transaction fraud detection. A neighbor sampling strategy is performed to filter noisy nodes and supplement information for fraudulent nodes. Experiments on three real financial datasets demonstrate that the proposed method ASA-GNN outperforms state-of-the-art ones.
  arXiv  Detail & Related papers  (2023-07-11T07:48:39Z)
• Optimal Transport-based Identity Matching for Identity-invariant Facial Expression Recognition [33.072870202596725]
  Identity-invariant facial expression recognition (FER) has been one of the challenging computer vision tasks. This paper proposes to quantify the inter-identity variation by utilizing pairs of similar expressions explored through a specific matching process. The proposed matching method is not only easy to plug in to other models, but also requires only acceptable computational overhead.
  arXiv  Detail & Related papers  (2022-09-25T07:30:44Z)
• HEFT: Homomorphically Encrypted Fusion of Biometric Templates [20.10175446213924]
  We propose a non-interactive solution for secure fusion and matching of biometric templates using fully homomorphic encryption (FHE) Our method, dubbed HEFT, is custom-designed to overcome the unique constraint imposed FHE, namely the lack of computation support for non-arithmetic operations. Experimental evaluation for template fusion shows that HEFT (i) improves biometric verification performance by 11.07% and 9.58% AUROC compared to the respective unibiometric representations.
  arXiv  Detail & Related papers  (2022-08-15T14:55:08Z)
• Rapid Person Re-Identification via Sub-space Consistency Regularization [51.76876061721556]
  Person Re-Identification (ReID) matches pedestrians across disjoint cameras. Existing ReID methods adopting real-value feature descriptors have achieved high accuracy, but they are low in efficiency due to the slow Euclidean distance computation. We propose a novel Sub-space Consistency Regularization (SCR) algorithm that can speed up the ReID procedure by 0.25$ times.
  arXiv  Detail & Related papers  (2022-07-13T02:44:05Z)
• Spotting adversarial samples for speaker verification by neural vocoders [102.1486475058963]
  We adopt neural vocoders to spot adversarial samples for automatic speaker verification (ASV) We find that the difference between the ASV scores for the original and re-synthesize audio is a good indicator for discrimination between genuine and adversarial samples. Our codes will be made open-source for future works to do comparison.
  arXiv  Detail & Related papers  (2021-07-01T08:58:16Z)
• End-to-end User Recognition using Touchscreen Biometrics [11.394909061094463]
  The goal was to create an end-to-end system that can transparently identify users using raw data from mobile devices. In the proposed system data from the touchscreen goes directly to the input of a deep neural network, which is able to decide on the identity of the user.
  arXiv  Detail & Related papers  (2020-06-09T16:38:09Z)
• Learning Attentive Pairwise Interaction for Fine-Grained Classification [53.66543841939087]
  We propose a simple but effective Attentive Pairwise Interaction Network (API-Net) for fine-grained classification. API-Net first learns a mutual feature vector to capture semantic differences in the input pair. It then compares this mutual vector with individual vectors to generate gates for each input image. We conduct extensive experiments on five popular benchmarks in fine-grained classification.
  arXiv  Detail & Related papers  (2020-02-24T12:17:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.