Automatic Alignment of Fingerprint Features for Fuzzy Fingerprint Vault

Chung, Yongwha; Moon, Daesung; Lee, Sung-Ju; Jung, Seunghwan; Kim, Taehae; Ahn, Do-Seob

doi:10.1007/11599548_31

Cited by 86 publications

(86 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As in [2], we selected the number of the chaff minutiae as 200. The average number of minutiae extracted by our feature extractor is about 30, so the average number of points in the vault is about 230.…”

Section: Resultsmentioning

confidence: 99%

“…Given the fingerprint image to be verified, we first extract minutiae from the image, and a verification table [2] is generated according to the geometric characteristic of the minutiae. Then, the verification table is compared with the enrollment hash table, and an unlocking set U is finally selected.…”

Section: Verification Proceduresmentioning

confidence: 99%

“…Based on the fuzzy vault, some implementation results for fingerprint have been reported [2,3,4,5]. However, all the previous results adopted the brute-force search [1] to reconstruct the polynomial or skipped the procedure for polynomial reconstruction because of its difficulty [3,6].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A fast algorithm for polynomial reconstruction of fuzzy fingerprint vault

Choi¹,

Lee

Moon³

et al. 2008

IEICE Electron. Express

Self Cite

View full text Add to dashboard Cite

Abstract:In recent years, a cryptographic construct, called fuzzy vault, has been proposed, which aims to secure critical data (e.g., secret encryption key) with the fingerprint data in a way that only the authorized user can access the secret by providing the valid fingerprint, and some implementation results have been reported. However, all the previous results adopted the brute-force search to reconstruct the polynomial or skipped the procedure for the polynomial reconstruction. In this paper, we propose a fast polynomial reconstruction algorithm for the fuzzy fingerprint vault which can improve the execution time of the brute-force search by a factor of 300∼1,500.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Verification Proceduresmentioning

confidence: 99%

See 1 more Smart Citation

A fast algorithm for polynomial reconstruction of fuzzy fingerprint vault

Choi¹,

Lee

Moon³

et al. 2008

IEICE Electron. Express

Self Cite

View full text Add to dashboard Cite

show abstract

“…In order to solve this fingerprint alignment problem, the method to apply a geometric hashing technique to the fuzzy fingerprint vault system has been proposed [4,5,6]. The geometric hashing technique is the algorithm that searches and saves the information of transformed object to a database by extracting the information of the object through an object recognition algorithm and by performing the geometric transformation [7].…”

Section: Introductionmentioning

confidence: 99%

VLSI implementation of the fuzzy fingerprint vault system

Lim

Chae

Pan

2010

IEICE Electron. Express

View full text Add to dashboard Cite

Abstract:Biometrics-based user authentication has several advantages over traditional password-based systems for standalone authentication applications. The fingerprint is evaluated as the most realistic alternative up to the present time in the perspectives of availability, accuracy and economy. However, serious problems may cause if fingerprint information stored for user authentication is used illegally by a different person since it cannot be changed freely as a password due to a limited number of fingers. Recently, research in fuzzy fingerprint vault system has been carried out actively to safely protect fingerprint information in a fingerprint authentication system. In this paper, we propose the FPGA-based fuzzy fingerprint vault system for real-time processing. Based on the experimental results, we confirmed that the proposed system takes 0.53 second with 36 real minutiae and 400 chaff minutiae.

show abstract

“…Yang and Verbauwhede assumed this to be the case, but this assumption is not true in practice. Further, Chung et al [2] proposed to use geometric hash tables (which code the transformation of genuine and chaff points with respect to a single reference minutia) for alignment. The authors did not provide any experimental results on alignment performance, further, the resulting hash tables can be prohibitively large.…”

Section: Introductionmentioning

confidence: 99%