3rd International Workshop on Biometrics and Forensics (IWBF 2015) 2015
DOI: 10.1109/iwbf.2015.7110225
|View full text |Cite
|
Sign up to set email alerts
|

Towards cancelable multi-biometrics based on bloom filters: a case study on feature level fusion of face and iris

Abstract: In this work we propose a generic framework for generating an irreversible representation of multiple biometric templates based on adaptive Bloom filters. The presented technique enables a feature level fusion of different biometrics (face and iris) to a single protected template, improving privacy protection compared to the corresponding systems based on a single biometric trait. At the same time, a significant gain in biometric performance is achieved, confirming the soundness of the proposed technique.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
33
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
4
1

Relationship

1
8

Authors

Journals

citations
Cited by 49 publications
(33 citation statements)
references
References 23 publications
0
33
0
Order By: Relevance
“…Rathgeb et al [20] work proposes a Bloom filter-based transforms to protect templates in face and iris samples. It builds two matrices arranged in two-dimensional binary code, divided into blocks of equal size consisting of w F (w I ) bits.…”
Section: B Biometric Security and Privacy Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Rathgeb et al [20] work proposes a Bloom filter-based transforms to protect templates in face and iris samples. It builds two matrices arranged in two-dimensional binary code, divided into blocks of equal size consisting of w F (w I ) bits.…”
Section: B Biometric Security and Privacy Workmentioning
confidence: 99%
“…Lai et al [16] YES NO YES NO Lai et al [17] YES NO YES NO Nagar et al [15] YES NO YES NO Nassir and Perumal [14] YES YES NO NO Rathgeb et al [20] YES NO YES NO Kumar and Kumar [12] YES NO YES NO Li et al [13] YES NO YES NO Kaur and Sofat [35] YES NO NO NO Zhou and Ren [11] YES NO YES NO Toli and Preneel [10] YES YES NO NO Kaur and Khanna [18] YES NO YES NO Our proposed scheme YES YES YES YES complete the purpose task. Also, it allows us to use the IDN algorithm created, ensuring the anonymity of the records.…”
Section: Interoperabilitymentioning
confidence: 99%
“…The performance of proposed approach goes lower to higher w.r.t high dimension bitmaps as the number of the available bits increased. Experiment-2 : Inspired from the earlier works [17], [21], we propose to concatenate the deep feature vectors of major knuckle, minor knuckle and nail to quantitatively evaluate the performance of cancelable finger dorsal biometrics. This test has been performed on PolyU FKI database with the same testing strategy.…”
Section: Algorithm 1: Verification Algorithmmentioning
confidence: 99%
“…Rathgeb et al [35] proposed an alignment free iris keybinding scheme with concealable transforms. They adopted Indexing-First-One (IFO) hashing to achieve non-invertible and cancelable transformation for biometrics and the cryptographic key-binding.…”
Section: A Vulnerabilities Attacks Of Biometric Template In the Datamentioning
confidence: 99%