2018 26th European Signal Processing Conference (EUSIPCO) 2018
DOI: 10.23919/eusipco.2018.8553053
|View full text |Cite
|
Sign up to set email alerts
|

Privacy-Preserving Indexing of Iris-Codes with Cancelable Bloom Filter-based Search Structures

Abstract: Protecting the privacy of the enrolled subjects is an important requirement expected from biometric systems. In recent years, numerous template protection schemes have been proposed, but so far none of them have been shown to be suitable for indexing (workload reduction) in the computationally expensive identification mode. This paper presents a, best to the authors' knowledge, first method in the scientific literature for indexing protected iris templates. It is based on applying random permutations to Iris-C… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(8 citation statements)
references
References 23 publications
0
8
0
Order By: Relevance
“…A method for archiving protected iris templates, which essentially seeks to minimize tasks in computationally intensive verification mode, is proposed [24]. It also focused on using arbitrary permutations in iris code rows and corresponding indexing employing bloom filters and binary search trees.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…A method for archiving protected iris templates, which essentially seeks to minimize tasks in computationally intensive verification mode, is proposed [24]. It also focused on using arbitrary permutations in iris code rows and corresponding indexing employing bloom filters and binary search trees.…”
Section: Related Workmentioning
confidence: 99%
“…It also focused on using arbitrary permutations in iris code rows and corresponding indexing employing bloom filters and binary search trees. e inconsistency, irreversibility, and renewability have been experimentally demonstrated [24]. e issue of unavoidable biometric error rates using a unique cuckoo filtering solution is overcome that combines both steady bits and discriminatory bits at the same time to obtain a bigger and more powerful template protection system [25].…”
Section: Related Workmentioning
confidence: 99%
“…More recently, Rathgeb et al [18], [19] proposed the Bloom filter approach for alignment-free template cancelability and irreversibility. This approach was later adapted by Gomez-Barrero et al [9], [20] to ensure template nonlinkability, and by Drozdowski et al [21] for higher computational efficiency. Raja et al [22] proposed a highly efficient method using neighborhood-preserving manifolds and hashing for biometric template protection in smartphones.…”
Section: Background and Related Workmentioning
confidence: 99%
“…Some early proof-of-concept works and trade-off analyses have been carried out e.g. in [193][194][195].…”
Section: Data Securitymentioning
confidence: 99%