HEFT: Homomorphically Encrypted Fusion of Biometric Templates
Luke Sperling, Nalini Ratha, Arun Ross, Vishnu Naresh Boddeti

TL;DR
HEFT introduces a fully homomorphic encryption-based method for secure biometric template fusion and matching, enabling privacy-preserving biometric verification with improved accuracy and efficiency.
Contribution
The paper presents HEFT, a novel FHE-compatible biometric fusion and matching framework with custom operations, efficient data packing, and an FHE-aware training algorithm.
Findings
Improves biometric verification AUROC by over 9-11%.
Compresses feature vectors by a factor of 16.
Performs encrypted match scoring in under 900 ms.
Abstract
This paper proposes a non-interactive end-to-end solution for secure fusion and matching of biometric templates using fully homomorphic encryption (FHE). Given a pair of encrypted feature vectors, we perform the following ciphertext operations, i) feature concatenation, ii) fusion and dimensionality reduction through a learned linear projection, iii) scale normalization to unit -norm, and iv) match score computation. Our method, dubbed HEFT (Homomorphically Encrypted Fusion of biometric Templates), is custom-designed to overcome the unique constraint imposed by FHE, namely the lack of support for non-arithmetic operations. From an inference perspective, we systematically explore different data packing schemes for computationally efficient linear projection and introduce a polynomial approximation for scale normalization. From a training perspective, we introduce an FHE-aware…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBiometric Identification and Security · Face recognition and analysis · Face and Expression Recognition
