z-logo
open-access-imgOpen Access
Predicting the vulnerability of biometric systems to attacks based on morphed biometric information
Author(s) -
GomezBarrero Marta,
Rathgeb Christian,
Scherhag Ulrich,
Busch Christoph
Publication year - 2018
Publication title -
iet biometrics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.434
H-Index - 28
eISSN - 2047-4946
pISSN - 2047-4938
DOI - 10.1049/iet-bmt.2017.0144
Subject(s) - biometrics , computer science , vulnerability (computing) , computer security , biometric data
Morphing techniques can be used to create artificial biometric samples or templates, which resemble the biometric information of two or more individuals in signal and feature domain. If morphed biometric samples or templates are infiltrated to a biometric recognition system, the subjects contributing to the morphed sample can be both successfully verified against a single enrolled template. Hence, the unique link between individuals and their biometric reference data is not warranted. This leads to serious security gaps in biometric applications, in particular, the issuance and verification process of electronic travel documents. Recently, different biometric systems have been attacked using morphed biometric samples. However, so far a systematic approach to predict the vulnerability of the system to such attacks has not been proposed. In this work, the authors present a framework to evaluate the vulnerability of biometric systems to attacks using morphed biometric information. Based on a biometric system's mated/non‐mated score distribution and its decision threshold, a theoretical vulnerability assessment is proposed. In an experimental evaluation, the vulnerability of a face and an iris recognition system is quantified based on the presented framework. Obtained results are verified against real attacks based on morphed face images and morphed iris‐based templates.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here