skip to main content
10.1145/3529570.3529591acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicdspConference Proceedingsconference-collections
research-article

Iriscode Matching Comparator to Improve Decidability of Human Iris Recognition

Authors Info & Claims
Published:29 June 2022Publication History

ABSTRACT

Eye iris has been widely recognized as one of the strongest biometrics attributed to its high accuracy performance. However, any compromised event of iris data potentially leads to severe security and privacy issues because the human iris is permanently linked to individuals and not revocable. Excising protection schemes protect the iris data with the expense of decreased accuracy performance. This paper introduces a new protection scheme to generate a protected template from iris data that can be safely store in the database for future authentication. Experiment results showed that the proposed scheme enjoys a particular S-curve property required to offer strong system security while ensuring high system usability in terms of low false acceptance and false rejection rate.

References

  1. S. Nanavati, M.Thieme and R. Nanavati, Biometrics: IdentityVerification in a Networked World, Wiley, New York, 2002.Google ScholarGoogle Scholar
  2. J. Daugman, “How iris recognition works,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 14, no. 1, pp. 21-30, 2004.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. J. Daugman, “Probing the uniqueness and randomness of iris codes: results from 200 billion iris pair comparisons,” in Proceedings of the IEEE, 2006.Google ScholarGoogle Scholar
  4. J. Daugman, “Recognising persons by their iris patterns,” in Advances in Biometric Person Authentication, ser. Lecture Notes in Computer Science, S. Li, J. Lai, T. Tan, G. Feng, and Y. Wang, Eds., Springer Berlin / Heidelberg, 2005, vol. 3338, pp. 783–814., 2005.Google ScholarGoogle Scholar
  5. Chen, Y., Wo, Y., Xie, R., Wu, C., & Han, G, “Deep Secure Quantization: On secure biometric hashing against similarity-based attacks,” Signal Process., vol. 154, pp. 314-323, 2019.Google ScholarGoogle ScholarCross RefCross Ref
  6. Y. Lai, Z. Jin, K. Wong and M. Tistarelli, “Efficient Known-Sample Attack for Distance-Preserving Hashing Biometric Template Protection Schemes,” IEEE Transactions on Information Forensics and Security, vol. 16, pp. 3170-3185, 2021.Google ScholarGoogle ScholarCross RefCross Ref
  7. J. Daugman, Score Normalization Rules in Iris Recognition, Boston: In: Li S.Z., Jain A. (eds) Encyclopedia of Biometrics. Springer, MA. https://doi.org/10.1007/978-0-387-73003-5_169, 2009.Google ScholarGoogle ScholarCross RefCross Ref
  8. J. Galbally, A. Ross, M. Gomez-Barrero, J. Fi´errez, and J. Ortega-Garcia, “Iris image reconstruction from binary templates: An efficient probabilistic approach,” Computer Vision and Image Understanding, vol. 117, no. 10, p. 1512–1525, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. S. Venugopalan and M. Savvides, “How to generate spoofed irises from an iris code template,” IEEE Transactions on Information Forensics and Security, vol. 6, no. 2, p. 385–395, 2011.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. I. J. S. S. Techniques, “ISO/IEC 24745:2011,” Information Technology - Security Techniques - Biometric Information Protection, International Organization for Standardization, 2011., :2011.Google ScholarGoogle Scholar
  11. S.C. Chong, A.T.B. Jin and D.N.C. Ling, “High security iris verification system based on random secret integration,” Computer Vision and Image Understanding, vol. 102, no. 2, pp. 169-177, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  12. Andrew Teoh Beng Jin, David Ngo Chek Ling, Alwyn Goh,, “Biohashing: two factor authentication featuring fingerprint data and tokenised random number,” Pattern Recognition, vol. 3, no. 11, pp. Pages 2245-2255, 2004.Google ScholarGoogle Scholar
  13. J. Zuo, N.K. Ratha and J.H. Connel, “Cancelable iris biometric,” in Proceedings of 19th International Conference on Pattern Recognition (ICPR 2008), 2008.Google ScholarGoogle Scholar
  14. J.K. Pillai, V.M. Patel, R. Chellappa and N.K. Ratha, “Sectored random projections for cancelable iris biometrics,” in Proceeding IEEE International Conference on Acoustics Speech and Signal Processing, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  15. J. Hämmerle -Uhl, E. Pschernig and A. Uhl, “Cancelable iris biometrics using block re–mapping and image warping,” 2009.Google ScholarGoogle Scholar
  16. O. Ouda, N. Tsumura and T. Nakaguchi, “On the Security of BioEncoding Based Cancelable Biometrics,” On the Security of BioEncoding Based Cancelable Biometrics. IEICE Transaction on Information and Systems, Vols. E94-D, no. 9, pp. 1768-1777, 2011.Google ScholarGoogle Scholar
  17. O. Ouda, N. Tsumura and T. Nakaguchi, “Tokenless cancelable biometrics scheme for protecting iris codes,” in Proceedings of 20th International Conference on Pattern Recognition (ICPR10), 2010.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. R. Dwivedi and D. Somnath, “Cancelable iris template generation using look-up table mapping,” in Signal Processing and Integrated Networks (SPIN), 2015.Google ScholarGoogle ScholarCross RefCross Ref
  19. C. Rathgeb, F. Breitinger and C. Busch, “Alignment-free cancelable iris biometric templates based on adaptive bloom filters,” in In IEEE International Conference on Biometrics, 2013.Google ScholarGoogle ScholarCross RefCross Ref
  20. Yen-Lung Lai, Zhe Jin, Andrew Beng Jin Teoh, Bok-Min Goi, Wun-She Yap, Tong-Yuen Chai, Christian Rathgeb,, “Cancellable iris template generation based on Indexing-First-One hashing,” Pattern Recognition, vol. 64, pp. 105-117, 2017.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Sadhya, D.; Raman, B., “Generation of cancelable iris templates via randomized bit sampling.,” IEEE Transactions on Information Forensics and Security 2019, 14, 2972-2986., vol. 14, pp. 2972-2986., 2019, 14, 2972-2986..Google ScholarGoogle Scholar
  22. Rajaraman, A., and Ullman, J. D. , Mining of massive datasets, Cambridge University Press., 2011.Google ScholarGoogle Scholar
  23. A. Kong, K.H. Cheung, D. Zhang, M. Kamel and J. You, “An analysis of BioHashing and its variants,” Pattern Recognition, vol. 39, no. 7, pp. 1359-1368, 2006.Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. P. Lacharme, E. Cherrier, and C. Rosenberger, “Reconstruction attack on BioHashing,” in International Conference on Security and Cryptography (SECRYPT), 2013.Google ScholarGoogle Scholar
  25. S. Jenisch and A. Uhl, “Security analysis of a cancelable iris recognition system based on block remapping,” in Proceedings of IEEE International Conference on Image Processing, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  26. P. Lacharme, “Analysis of the iriscodes bioencoding scheme,” International Journal of Computer Science and Software Engineering (IJCSSE 2012), vol. 6, no. 5, pp. 315-321, 2012.Google ScholarGoogle Scholar
  27. J. Hermans, B. Mennink and R. Peeters, “When a Bloom filter is a Doom filter: Security assessment of a novel iris biometric template protection system,” in Proceedings of the Biometrics Special Interest Group. Lecture Notes in Informatics (LNI), 2014.Google ScholarGoogle Scholar
  28. J. Bringer, C. Morel and C. Rathgeb, “Security analysis of Bloom filter-based iris biometric template protection,” in 2015 International Conference on Biometrics (ICB), 2015.Google ScholarGoogle ScholarCross RefCross Ref

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    ICDSP '22: Proceedings of the 6th International Conference on Digital Signal Processing
    February 2022
    253 pages
    ISBN:9781450395809
    DOI:10.1145/3529570

    Copyright © 2022 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 29 June 2022

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited
  • Article Metrics

    • Downloads (Last 12 months)11
    • Downloads (Last 6 weeks)1

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format