2008
DOI: 10.1117/12.766861
|View full text |Cite
|
Sign up to set email alerts
|

Realization of correlation attack against the fuzzy vault scheme

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
77
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 81 publications
(77 citation statements)
references
References 16 publications
0
77
0
Order By: Relevance
“…In addition, if the set contains more chaff points, more time is needed to reconstruct the polynomial. The correlation attack (Kholmatov & Yanikoglu, 2008) is known to be an efficient method that constitutes the minutia set using multiple vaults enrolled for different applications. On the other hand, when multiple vaults cannot be obtained and no information about the minutiae is available, the attacker should select the real minutiae from among the entire points including many chaff points.…”
Section: Attack Methods For Fuzzy Fingerprint Vaultmentioning
confidence: 99%
See 1 more Smart Citation
“…In addition, if the set contains more chaff points, more time is needed to reconstruct the polynomial. The correlation attack (Kholmatov & Yanikoglu, 2008) is known to be an efficient method that constitutes the minutia set using multiple vaults enrolled for different applications. On the other hand, when multiple vaults cannot be obtained and no information about the minutiae is available, the attacker should select the real minutiae from among the entire points including many chaff points.…”
Section: Attack Methods For Fuzzy Fingerprint Vaultmentioning
confidence: 99%
“…In addition, even if the number of the real minutiae is larger than the degree of the polynomial, it would be computationally infeasible to reconstruct the polynomial when there are too many chaff minutiae in the matching minutiae with respect to the real minutiae. (Kholmatov & Yanikoglu, 2008). Fig.…”
Section: Correlation Attackmentioning
confidence: 99%
“…Adler [12] discussed the vulnerability of the method in [11] to the hill climbing attack and the experimental results showed that an estimate of the enrolled biometric image could be regenerated and hence the stored secret could be released assuming that the system leaks information on the matching score. Kholmatov and Yanikoglu [13] realized the correlation attack against the fuzzy vault scheme using fingerprints, and the obtained results proved that the fuzzy vault scheme is indeed vulnerable to correlation attacks. Nagar et al [14] analyzed the security of two well-known cancelable biometrics techniques, namely, distorting transforms for fingerprints [6] and BioHashing [7], and their analysis showed that both techniques are susceptible to invertibility attacks.…”
Section: Introductionmentioning
confidence: 93%
“…As described in [10], given two or more fuzzy vaults generated using the same biometric data and different chaff points, it is possible to recover the true biometric data by correlating the compromised vaults since the only thing in common in these vaults will be the genuine data. Using only two vaults created from the same fingerprint minutiae for 200 different fingers, the correlation attack is realized against fuzzy fingerprint vault in [13] and the experimental results showed that 59% of vaults could be reconstructed successfully. Biometric encryption might be also susceptible to correlation based attacks.…”
Section: Correlation Attacksmentioning
confidence: 99%
“…Unfortunately, no assessment on the linkability is given in the cited fuzzy vault paper [NJP07]. The feasibility of linkage attack was proved by Kholmatov et al in [KY08]. The databases and implementation used in their fuzzy vault scheme are not exactly the same as in [NJP07].…”
Section: Comparison Of Unlinkabilitymentioning
confidence: 99%