OTB-morph: One-Time Biometrics via Morphing
- URL: http://arxiv.org/abs/2302.09053v1
- Date: Fri, 17 Feb 2023 18:39:40 GMT
- Title: OTB-morph: One-Time Biometrics via Morphing
- Authors: Mahdi Ghafourian, Julian Fierrez, Ruben Vera-Rodriguez, Aythami
Morales and Ignacio Serna
- Abstract summary: This paper introduces a new idea to exploit as a transformation function for cancelable biometrics.
An experimental implementation of the proposed scheme is given for face biometrics.
- Score: 16.23764869038004
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Cancelable biometrics are a group of techniques to transform the input
biometric to an irreversible feature intentionally using a transformation
function and usually a key in order to provide security and privacy in
biometric recognition systems. This transformation is repeatable enabling
subsequent biometric comparisons. This paper is introducing a new idea to
exploit as a transformation function for cancelable biometrics aimed at
protecting the templates against iterative optimization attacks. Our proposed
scheme is based on time-varying keys (random biometrics in our case) and
morphing transformations. An experimental implementation of the proposed scheme
is given for face biometrics. The results confirm that the proposed approach is
able to withstand against leakage attacks while improving the recognition
performance.
Related papers
- A secure and private ensemble matcher using multi-vault obfuscated templates [1.3518297878940662]
Generative AI has revolutionized modern machine learning by providing unprecedented realism, diversity, and efficiency in data generation.
Biometric template security and secure matching are among the most sought-after features of modern biometric systems.
This paper proposes a novel obfuscation method using Generative AI to enhance biometric template security.
arXiv Detail & Related papers (2024-04-08T05:18:39Z) - Privacy-preserving Multi-biometric Indexing based on Frequent Binary
Patterns [7.092869001331781]
We propose an efficient privacy-preserving multi-biometric identification system that retrieves protected deep cancelable templates.
A multi-biometric binning scheme is designed to exploit the low intra-class variation properties contained in the frequent binary patterns extracted from different types of biometric characteristics.
arXiv Detail & Related papers (2023-10-04T18:18:24Z) - Facial Soft Biometrics for Recognition in the Wild: Recent Works,
Annotation, and COTS Evaluation [63.05890836038913]
We study the role of soft biometrics to enhance person recognition systems in unconstrained scenarios.
We consider two assumptions: 1) manual estimation of soft biometrics and 2) automatic estimation from two commercial off-the-shelf systems.
Experiments are carried out fusing soft biometrics with two state-of-the-art face recognition systems based on deep learning.
arXiv Detail & Related papers (2022-10-24T11:29:57Z) - Versatile Weight Attack via Flipping Limited Bits [68.45224286690932]
We study a novel attack paradigm, which modifies model parameters in the deployment stage.
Considering the effectiveness and stealthiness goals, we provide a general formulation to perform the bit-flip based weight attack.
We present two cases of the general formulation with different malicious purposes, i.e., single sample attack (SSA) and triggered samples attack (TSA)
arXiv Detail & Related papers (2022-07-25T03:24:58Z) - Super-Resolution for Selfie Biometrics: Introduction and Application to
Face and Iris [67.74999528342273]
Lack of resolution has a negative impact on the performance of image-based biometrics.
Super-resolution techniques have to be adapted for the particularities of images from a specific biometric modality.
This chapter presents an overview of recent advances in super-resolution reconstruction of face and iris images.
arXiv Detail & Related papers (2022-04-12T10:28:31Z) - E-detectors: a nonparametric framework for sequential change detection [86.15115654324488]
We develop a fundamentally new and general framework for sequential change detection.
Our procedures come with clean, nonasymptotic bounds on the average run length.
We show how to design their mixtures in order to achieve both statistical and computational efficiency.
arXiv Detail & Related papers (2022-03-07T17:25:02Z) - OTB-morph: One-Time Biometrics via Morphing applied to Face Templates [8.623680649444212]
This paper introduces a new scheme for cancelable biometrics aimed at protecting the templates against potential attacks.
An experimental implementation of the proposed scheme is given for face biometrics.
arXiv Detail & Related papers (2021-11-25T18:35:34Z) - Benchmarking Quality-Dependent and Cost-Sensitive Score-Level Multimodal
Biometric Fusion Algorithms [58.156733807470395]
This paper reports a benchmarking study carried out within the framework of the BioSecure DS2 (Access Control) evaluation campaign.
The campaign targeted the application of physical access control in a medium-size establishment with some 500 persons.
To the best of our knowledge, this is the first attempt to benchmark quality-based multimodal fusion algorithms.
arXiv Detail & Related papers (2021-11-17T13:39:48Z) - Authentication Attacks on Projection-based Cancelable Biometric Schemes [0.6499759302108924]
Cancelable biometric schemes aim at generating secure biometric templates by combining user specific tokens, such as password, stored secret or salt, along with biometric data.
The security requirements of cancelable biometric schemes concern the irreversibility, unlinkability and revocability of templates, without losing in accuracy of comparison.
In this paper, we formalize these attacks for a traditional cancelable scheme with the help of integer linear programming (ILP) and quadratically constrained quadratic programming (QCQP)
arXiv Detail & Related papers (2021-10-28T14:39:35Z) - Random Hash Code Generation for Cancelable Fingerprint Templates using
Vector Permutation and Shift-order Process [3.172761915061083]
We propose a non-invertible distance preserving scheme based on vector permutation and shift-order process.
A shift-order process is then applied to the generated features in order to achieve non-invertibility and combat similarity-based attacks.
The generated hash codes are resilient to different security and privacy attacks whilst fulfilling the major revocability and unlinkability requirements.
arXiv Detail & Related papers (2021-05-21T09:37:54Z) - Targeted Attack against Deep Neural Networks via Flipping Limited Weight
Bits [55.740716446995805]
We study a novel attack paradigm, which modifies model parameters in the deployment stage for malicious purposes.
Our goal is to misclassify a specific sample into a target class without any sample modification.
By utilizing the latest technique in integer programming, we equivalently reformulate this BIP problem as a continuous optimization problem.
arXiv Detail & Related papers (2021-02-21T03:13:27Z)
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.