Biometric template protection based on Bloom filters and honey templates

Martiri, Edlira; Gomez‐Barrero, Marta; Yang, Bian; Busch, Christoph

doi:10.1049/iet-bmt.2015.0111

Cited by 16 publications

(5 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This technique permutes the rows of a feature block according to a keyed random permutation to diffuse the statistical properties of a biometric feature vector and at the same time to preserve the biometric performance. Later, [34] uses the same technique with a minor addition, that is, after a row‐wise permutation there is a circular shift within each column. However, this circular shifting does not contribute to the dissipation of the biometric information but rather might lead to some accuracy loss since different columns after shifting might result in the same column.…”

Section: Theoretical Comparisonmentioning

confidence: 99%

Hybrid biometric template protection: Resolving the agony of choice between bloom filters and homomorphic encryption

et al. 2022

View full text Add to dashboard Cite

Bloom filters (BFs) and homomorphic encryption (HE) are prominent techniques used to design biometric template protection (BTP) schemes that aim to protect sensitive biometric information during storage and biometric comparison. However, the pros and cons of BF-and HE-based BTPs are not well studied in literature. We investigate the strengths and weaknesses of these two approaches since both seem promising from a theoretical viewpoint. Our key insight is to extend our theoretical investigation to cover the practical case of iris recognition on the ground that iris (1) benefits from the alignment-free property of BFs and (2) induces huge computational burdens when implemented in the HE-encrypted domain. BF-based BTPs can be implemented to be either fast with high recognition accuracy while missing the important privacy property of 'unlinkability', or to be fast with unlinkability-property while missing the high accuracy. HE-based BTPs, on the other hand, are highly secure, achieve good accuracy, and meet the unlinkability-property, but they are much slower than BF-based approaches. As a synthesis, we propose a hybrid BTP scheme that combines the good properties of BFs and HE, ensuring unlinkability and high recognition accuracy, while being about seven times faster than the traditional HE-based approach. | INTRODUCTIONA biometric template is a compact representation of a physiological or a behavioural biometric characteristic such as face, iris, voice, etc. The biometric characteristic itself is not a secret as, in human-to-human interaction, humans recognise each other from their actual characteristics. However, in a human-tomachine interaction, a biometric template becomes a numerical equivalent of the human characteristic understandable by a machine. Thus, a biometric template reflects the identity of an individual that allows him/her to be recognized by the system. Given the fact that systems are subject to various types of security threats, a biometric template must be well protected.References [2, 3] define biometric template protection (BTP) schemes as the branch of biometrics that tackles the problem of persevering biometric templates while maintaining the recognition performance. There exist different approaches to design BTP schemes that try to satisfy the privacy requirements of the international standard ISO/IEC 24,745 [4]: irreversibility, unlinkability, and confidentiality. Among those approaches, Bloom filter (BF)-based BTPs, process the template in a transformed domain, while homomorphic encryption (HE)-based BTPs, process the template in an encrypted domain. Both approaches have common and exclusive interesting properties that deal with the BTP challenges and the tradeoffs. Several surveys investigate either Bloom filters [5,6] This paper is an extension of [1] published at BIOSIG 2021.

show abstract

Section: Theoretical Comparisonmentioning

confidence: 99%

Hybrid biometric template protection: Resolving the agony of choice between bloom filters and homomorphic encryption

et al. 2022

View full text Add to dashboard Cite

show abstract

“…This technique permutes the rows of a feature block according to a keyed random permutation to diffuse the statistical properties of a biometric feature vector and at the same time to preserve the biometric performance. Later, [31] uses the same technique with a minor addition, that is, after a row-wise permutation there is a circular shift within each column. However, this circular shifting does not contribute to the dissipation of the biometric information but rather might lead to some accuracy loss since different columns after shifting might result in the same column.…”

Section: Bloom Filter Based Btp Schemesmentioning

confidence: 99%

“…[25]- [27] [30], [31] [38], [39], [45] [36], [37], [40], [44] [33], [35] Irreversibility Unlinkability…”

mentioning

confidence: 99%

Bloom Filter vs Homomorphic Encryption: Which approach protects the biometric data and satisfies ISO/IEC 24745?

Bassit

Hahn

Zeinstra

et al. 2021

2021 International Conference of the Biometrics Special Interest Group (BIOSIG)

View full text Add to dashboard Cite

Bloom filter (BF) and homomorphic encryption (HE) are popular modern techniques used to design biometric template protection (BTP) schemes that aim to protect the sensitive biometric information during storage and the comparison process. However, in practice, many BTP schemes based on BF or HE violate at least one of the privacy requirements of the international standard ISO/IEC 24745: irreversibility, unlinkability and confidentiality. In this paper, we investigate the state-of-the-art BTP schemes based on these two approaches and assess their relative strengths and weaknesses with respect to the three requirements of ISO/IEC 24745. The results of our investigation showed that the choice between BF and HE depends on the setting where the BTP scheme will be deployed and the level of trustworthiness of the parties involved in processing the protected template. As a result, HE enhanced by verifiable computation techniques can satisfy the privacy requirements of ISO/IEC 24745 in a trustless setting.

show abstract

“…Yang and Martiri [37] proposed honey template-based template protection scheme to detect the biometric template database leakage. In the protection scheme, machine learning based classification algorithms is utilized to produce the sugar and honey templates applied in face [38].…”

Section: A Vulnerabilities Attacks Of Biometric Template In the Datamentioning

confidence: 99%

Developing an Algorithm for Securing the Biometric Data Template in the Database

Habibu¹,

Luhanga²,

Sam³

2019

IJACSA

View full text Add to dashboard Cite

In the current technology advancement, biometric template provides a dependable solution to the problem of user verification in an identity control system. The template is saved in the database during the enrollment and compared with query information in the verification stage. Serious security and privacy concerns can arise, if raw, unprotected data template is saved in the database. An attacker can hack the template information in the database to gain illicit access. A novel approach of encryption-decryption algorithm utilizing a design pattern of Model View Template (MVT) is developed to secure the biometric data template. The model manages information logically, the view shows the visualization of the data, and the template addresses the data migration into pattern object. The established algorithm is based on the cryptographic module of the Fernet key instance. The Fernet keys are combined to generate a multiFernet key to produce two encrypted files (byte and text file). These files are incorporated with Twilio message and securely preserved in the database. In the event where an attacker tries to access the biometric data template in the database, the system alerts the user and stops the attacker from unauthorized access, and cross-verify the impersonator based on the validation of the ownership. Thus, helps inform the users and the authority of, how secure the individual biometric data template is, and provided a high level of the security pertaining the individual data privacy.

show abstract

Biometric template protection based on Bloom filters and honey templates

Cited by 16 publications

References 37 publications

Hybrid biometric template protection: Resolving the agony of choice between bloom filters and homomorphic encryption

Hybrid biometric template protection: Resolving the agony of choice between bloom filters and homomorphic encryption

Bloom Filter vs Homomorphic Encryption: Which approach protects the biometric data and satisfies ISO/IEC 24745?

Developing an Algorithm for Securing the Biometric Data Template in the Database

Contact Info

Product

Resources

About