12.07.2015 Views

Cancelable Templates for Sequence-Based Biometrics with ... - ATVS

Cancelable Templates for Sequence-Based Biometrics with ... - ATVS

Cancelable Templates for Sequence-Based Biometrics with ... - ATVS

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

MAIORANA et al.: CANCELABLE TEMPLATES FOR SEQUENCE-BASED BIOMETRICS 527A detailed discussion regarding the requirements of a properlydefined cancelable biometrics can also be found in [19].Designing a template protection scheme that is able to properlysatisfy each of the a<strong>for</strong>ementioned properties is not a trivialtask, mainly due to the unavoidable intrauser variability shownby every biometric trait. Different solutions have already beenproposed <strong>for</strong> the generation of secure and renewable templates.A recent survey of published methods has been presented in[20], where the authors have classified the existing approachesinto two categories: biometric cryptosystems and feature trans<strong>for</strong>mationapproaches.A. Biometric Cryptosystems <strong>for</strong> Template ProtectionBiometric cryptosystems combine cryptographic keys <strong>with</strong>trans<strong>for</strong>med versions of the input biometrics to generate thesecured templates [21]. In this process, some public in<strong>for</strong>mation,namely, helper data, is generated. Biometric cryptosystemscan be further divided into key binding systems, wherethe helper data are obtained by combining the key <strong>with</strong> thebiometric template, and key generation systems, where boththe helper data and the key are directly generated from thebiometric template. Two of the most well-known examples ofkey binding approaches are the fuzzy commitment [22] and thefuzzy vault [23], which represent general schemes that can beapplied to different biometrics such as fingerprints or face [24],[25]. Typically, these approaches are able to manage the intrauservariations in biometric data by exploiting the capabilitiesof error correcting codes. However, it is generally not possibleto use sophisticated and dedicated matchers, thus reducing thesystem matching accuracy. Moreover, it has been proven thatthe fuzzy vault is vulnerable to the record multiplicity attack[26]: If an adversary has access to two different vaults obtainedfrom the same data, he can easily identify the genuine points inthe two vaults. On the other hand, the proposed key generationbiometric cryptosystems have been more difficult to implementin practice [27].B. Feature Trans<strong>for</strong>mations <strong>for</strong> Template ProtectionIn a feature trans<strong>for</strong>mation approach, a function that is dependenton some parameters, which can be used as a key, isapplied to the input biometric to generate the protected templates.The employed function can be either invertible, resultingin a salting approach, whose security is based on the protectionof the function parameters, or noninvertible, when a one-wayfunction is applied to the template and it is computationallyhard to invert the function even if the trans<strong>for</strong>mation parametersare known. The use of the methods belonging to the first categorytypically results in low false acceptance rates; however, if auser-specific key is compromised, the user template is no longersecure due to the invertibility of the trans<strong>for</strong>mation. Examplescan be found in [28] and [29].On the contrary, when noninvertible trans<strong>for</strong>ms are used,even if the key is known by an adversary, no significantin<strong>for</strong>mation can be acquired on the template, thus obtainingbetter security than when using a salting approach, which relieson the key security. Moreover, in contrast <strong>with</strong> cryptosystemapproaches, the trans<strong>for</strong>med templates can remain in the samefeature space of the original ones, being then possible to employstandard matchers to per<strong>for</strong>m authentication in the trans<strong>for</strong>meddomain. This guarantees per<strong>for</strong>mances that are similar to thoseof an unprotected approach. In addition to the per<strong>for</strong>mancebenefits of using standard matchers in the trans<strong>for</strong>med domain,these methods typically result in matching scores which canbe fused in multibiometric approaches. There<strong>for</strong>e, the use oftrans<strong>for</strong>m-based approaches <strong>for</strong> template protection in multibiometricssystems allows using either score-level fusion techniques[30] or decision-level fusion techniques [31], whereasonly the latter, which is less effective than the <strong>for</strong>mer, canbe employed when biometric cryptosystems are considered.Un<strong>for</strong>tunately, it seems to be difficult to design trans<strong>for</strong>mationfunctions which can satisfy both the discriminability and thenoninvertibility properties simultaneously.The concept of achieving template security through the applicationof noninvertible trans<strong>for</strong>mations has been first presentedin [16], where it has been referred to as cancelablebiometrics as that in [32], although this expression has beenlater conceived in a more general sense. One of the first publishedworks including experimental evidence on the feasibilityof noninvertible trans<strong>for</strong>ms <strong>for</strong> biometric template protectionis [33], where a geometric trans<strong>for</strong>m has been employed toprotect minutia templates. However, the protection scheme in[33] introduces a significant per<strong>for</strong>mance degradation, and thematching score between fingerprints trans<strong>for</strong>med <strong>with</strong> differentkeys is relatively high, thus greatly reducing the useful keyspace. More general geometric trans<strong>for</strong>ms (Cartesian, polar,and functional) have been later studied in [34], where betterper<strong>for</strong>mances have been achieved. However, <strong>with</strong> reference tothe best approach presented in [34], only a small fraction of thedata, namely, 8%, is noninvertible in practice [35]. Moreover,all the approaches <strong>for</strong> template protection in [33] and [34] arevulnerable to a record multiplicity attack: Having access to twoor more different trans<strong>for</strong>med versions of the same minutiapattern, it is possible to identify the original positions of theconsidered minutiae [36].A registration-free construction of cancelable fingerprinttemplates has also been proposed in [37]. From each detectedminutia, a square patch is extracted and trans<strong>for</strong>med usingan orthogonal trans<strong>for</strong>mation matrix. The approach presentedin [37], being able to <strong>with</strong>stand also a record multiplicityattack, is more robust than the one proposed in [34], but itexhibits lower verification per<strong>for</strong>mances than the one obtainedin [34].Voice-based cancelable templates were proposed in [38],where a noninvertible trans<strong>for</strong>med version of the originallyacquired voiceprint is generated. The original biometrics cannotbe obtained from the template stored in the server duringenrollment, even if the keys employed <strong>for</strong> trans<strong>for</strong>mations aredisclosed.III. GENERATING CANCELABLE SEQUENCE-BASEDBIOMETRIC TEMPLATESThe proposed BioConvolving approach provides protectionto templates characterized by a set of discrete finite sequencesAuthorized licensed use limited to: Univ Autonoma de Madrid. Downloaded on May 06,2010 at 15:31:46 UTC from IEEE Xplore. Restrictions apply.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!