ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 A Fast Algorithm for Polynomial Reconstruction of Fuzzy Fingerprint Vault
Cited 6 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
최우용, 이성주, 문대성, 정용화, 문기영
발행일
200809
출처
IEICE Electronics Express, v.5 no.18, pp.725-731
ISSN
1349-2543
출판사
일본, 전자정보통신학회 (IEICE)
DOI
https://dx.doi.org/10.1587/elex.5.725
협약과제
08MS2800, 프라이버시 보호형 바이오인식 시스템 개발, 문기영
초록
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. © IEICE 2008.
KSP 제안 키워드
Critical Data, Fuzzy fingerprint vault, Fuzzy vault, Polynomial reconstruction, brute-force search, encryption Key, execution time, fast algorithm, reconstruction algorithm