Index-of-Max 해싱을 이용한 폐기가능한 홍채 템플릿
Cancelable Iris Templates Using Index-of-Max Hashing
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
최근에 생체인증은 다양한 분야에 사용되고 있다. 생체정보는 변경이 불가능하고 다른 개인정보와 달리 폐기할 수없기 때문에 생체정보 유출에 대한 우려가 커지고 있다. 최근 Jin et al.은 지문 템플릿을 보호하기 위해IoM(Index-of-Max) 해싱이라는 폐기가능한 생체인증 방법을 제안했다. Jin et al.은 Gaussian randomprojection 기반과 Uniformly random permutation 기반의 두 가지 방법을 구현하였다. 제안된 방법은 높은 매칭 정확도를 제공하고 프라이버시 공격에 강력함을 보여주며 폐기가능한 생체인증의 요건을 만족함을 보여주었다. 그러나 Jin et al.은 다른 생체정보에 대한 인증(예: 정맥, 홍채 등)에 대한 실험 결과를 제공하지는 않았다. 본 논문에서는 Jin et al.의 방법을 적용하여 홍채 템플릿을 보호하는 방법을 제안한다. 실험 결과는 이전의 폐기가능한 홍채인증 방법과 비교했을 때 더 높은 정확도를 보여주며 보안 및 프라이버시 공격에 강력함을 보여준다.
Abstract
In recent years, biometric authentication has been used for various applications. Since biometric features are unchangeableand cannot be revoked unlike other personal information, there is increasing concern about leakage of biometric information. Recently, Jin et al. proposed a new cancelable biometric scheme, called “Index-of-Max” (IoM) to protect fingerprinttemplate. The authors presented two realizations, namely, Gaussian random projection-based and uniformly randompermutation-based hashing schemes. They also showed that their schemes can provide high accuracy, guarantee the securityagainst recently presented privacy attacks, and satisfy some criteria of cancelable biometrics. However, the authors did notprovide experimental results for other biometric features (e.g. finger-vein, iris). In this paper, we present the results ofapplying Jin et al.'s scheme to iris data. To do this, we propose a new method for processing iris data into a suitable formapplicable to the Jin et al.'s scheme. Our experimental results show that it can guarantee favorable accuracy performancecompared to the previous schemes. We also show that our scheme satisfies cancelable biometrics criteria and robustness tosecurity and privacy attacks demonstrated in the Jin et al.’s work.
참고문헌 (30)
- F. Hao, "Combining crypto with biometrics effectively", IEEE transactions on computers, 55(9), pp.1081~1088 (2006)
- N. Ratha, "Enhancing security and privacy in biometrics-based authentication systems", IBM systems Journal, 40(3), pp.614~634 (2001)
- C. Rathgeb, "A survey on biometric cryptosystems and cancelable biometrics", EURASIP Journal on Information Security, 2011(3), pp.1~25 (2011)
- R. M. Bolle, "Biometric perils and patches", Pattern Recognition, 35(12), pp.2727~2738 (2002)
- J. Zuo, "Cancelable iris biometric", 19th International Conference on Pattern Recognition, pp.1~4 (2008)
- V. M. Patel, "Cancelable biometrics : A review", IEEE Signal Processing Magazine, 32(5), pp.54~65 (2015)
- C. S. Chin, "High security iris verification system based on random secret integration", Computer Vision and Image Understanding, 102(2), pp.169~177 (2006)
- J. K. Pillai, "Sectored random projections for cancelable iris biometrics", IEEE International Conference on Acoustics, Speech and Signal Processing, pp.1838~1841 (2010)
- A. Kong, "An analysis of BioHashing and its variants", Pattern recognition, 39(7), pp.1359~1368 (2006)
- A. K. Jain, "Biometric template security", EURASIP Journal on advances in signal processing, (113) (2008)
- J. Hämmerle-Uhl, "Cancelable iris biometrics using block re-mapping and image warping", International Conference on Information Security, 5735, pp.135~142 (2009), Springer
- S. Jenisch, "Security analysis of a cancelable iris recognition system based on block remapping", 18th IEEE International Conference on Image Processing, pp.3213~3216 (2011)
- O. Ouda, "On the security of bioencoding based cancelable biometrics", IEICE TRANSACTIONS on Information and Systems, 94(9), pp.1768~1777 (2011)
- O. Ouda, "Tokenless cancelable biometrics scheme for protecting iris codes", 20th International Conference on Pattern Recognition, pp.882~885 (2010), IEEE
- P. Lacharme, "Analysis of the iris codes bioencoding scheme", Int. J. Comput. Sci. Softw. Eng. (IJCSSE 2012), 6(5), pp.315~321 (2012)
- C. Rathgeb, "Alignment-free cancelable iris biometric templates based on adaptive bloom filters", International Conference on biometrics (ICB), pp.1~8 (2013), IEEE
- C. Rathgeb, "On application of bloom filters to iris biometrics", IET Biometrics, 3(4), pp.207~218 (2014)
- C. Rathgeb, "Cancelable multi-biometrics : Mixing iris-codes based on adaptive bloom filters", Computers & Security, 42, pp.1~12 (2014)
- J. Hermans, "When a bloom filter is a doom filter : security assessment of a novel iris biometric template protection system", International conference of the biometrics special interest group (BIOSIG), pp.1~6 (2014), IEEE
- J. Bringer, "Security analysis of bloom filterbased iris biometric template protection", International conference on biometrics (ICB), pp.527~534 (2015), IEEE
- M. Gomez-Barrero, "Unlinkable and irreversible biometric template protection based on bloom filters", Information Sciences, 370, pp.18~32 (2016)
- R. Dwivedi, "A privacy-preserving cancelable iris template generation scheme using decimal encoding and look-up table mapping", Computers &Security, 65, pp.373~386 (2017)
- Y. L. Lai, "Cancellable iris template generation based on Indexing-First-One hashing", Pattern Recognition, 64, pp.105~117 (2017)
- Z. Jin, "Ranking-based locality sensitive hashing-enabled cancelable biometrics : Index-of-max hashing", IEEE Transactions on Information Forensics and Security, 13(2), pp.393~407 (2018)
- M. S. Charikar, "Similarity estimation techniques from rounding algorithms", Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pp.380~388 (2002)
- "Random maxout features" (2015)[URL]
- J. Yanik, "The power of comparative reasoning", International Conference on Computer Vision, pp.2431~2438 (2011), IEEE
- R. Cappelli, "Minutia cylinder-code : A new representation and matching technique for fingerprint recognition", IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(12), pp.2128~2141 (2010)
- M. Ferrara, "Noninvertible minutia cylinder-code representation", IEEE Transactions on Information Forensics and Security, 7(6), pp.1727~1737 (2012)
- J. Daugman, "How iris recognition works", Proc. International Conference on Image Processing, 1 (2002), IEEE