Nothing Special   »   [go: up one dir, main page]

Skip to main content

Iris Cancellable Template Generation Based on Indexing-First-One Hashing

  • Conference paper
  • First Online:
Network and System Security (NSS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9955))

Included in the following conference series:

Abstract

Iris recognition system has demonstrated its strong capability in performing personal verification and identification with promising recognition accuracy. However, the conventional iris recognition system stores the unprotected iris templates in a database, which is potentially being compromised. Even though biometric template protection provides a feasible solution to secure biometric template, a trade-off between security and recognition accuracy is incurred. That is, the higher security level always trades with poor recognition accuracy and vice versa. In this paper, a new iris template protection scheme is proposed, namely “Indexing-First-One” (IFO) hashing. IFO hashing transforms the binary feature into index value with Jacaard distance preservation. The resultant template offers a good indication of inheriting similarity from the IrisCode and strong concealment of IrisCode against inversion attack as well as other major security and privacy attacks. Experiments on CASIA-v3 data set substantiate that the proposed scheme can achieve as low as 0.54 % equal error rate and well preservation of recognition performance before and after IFO hashing.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Broder, A.: On the resemblance and containment of documents. In: Proceedings of the Compression and Complexity of Sequences, pp. 21–29 (1997)

    Google Scholar 

  2. Broder, A., Charikar, M., Frieze, A., Mitzenmacher, M.: Min-wise independent permutations. J. Comput. Syst. Sci. 60(3), 630–659 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  3. CASIA iris image database. http://www.cbsr.ia.ac.cn/Databases.htm

  4. Chong, S.C., Jin, A.T.B., Ling, D.N.C.: High security iris verification system based on random secret integration. Comput. Vis. Image Underst. 102(2), 169–177 (2006)

    Article  Google Scholar 

  5. Daugman, J.: How iris recognition works. IEEE Trans. Circ. Syst. Video Technol. 14(1), 21–30 (2004)

    Article  Google Scholar 

  6. Daugman, J.: Probing the uniqueness and randomness of iris codes: results from 200 billion iris pair comparisons. Proc. IEEE 94(11), 1927–1935 (2006)

    Article  Google Scholar 

  7. Hämmerle-Uhl, J., Pschernig, E., Uhl, A.: Cancelable iris biometrics using block re-mapping and image warping. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 135–142. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. Hermans, J., Mennink, B., Peeters, R.: 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), vol. 230, pp. 75–86 (2014)

    Google Scholar 

  9. Indyk, P.: A small approximately min-wise independent family of hash functions. In: Proceedings of 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 454–456 (1999)

    Google Scholar 

  10. Jain, A.K., Nandakumar, K., Nagar, A.: Biometric template security. EURASIP J. Adv. Signal Process. 2008(113), 1–17 (2008). Special issue on Biometrics

    Article  Google Scholar 

  11. Kong, A., Cheung, K.H., Zhang, D., Kamel, M., You, J.: An analysis of biohashing and its variants. Pattern Recogn. 39(7), 1359–1368 (2006)

    Article  MATH  Google Scholar 

  12. Lacharme, P.: Analysis of the iriscodes bioencoding scheme. Int. J. Comput. Sci. Softw. Eng. (IJCSSE 2012) 6(5), 315–321 (2012)

    Google Scholar 

  13. Nagar, A., Nandakumar, K., Jain, A.K.: Biometric template transformation: a security analysis. In: Proceedings of the SPIE7541, Media Forensics and Security II, 75410O (2010)

    Google Scholar 

  14. Ouda, O., Tsumura, N., Nakaguchi, T.: Tokenless cancelable biometrics scheme for protecting iris codes. In: Proceedings of 20th International Conference on Pattern Recognition (ICPR 2010), pp. 882–885 (2010)

    Google Scholar 

  15. Ouda, D., Tsumura, N., Nakaguchi, T.: On the security of bioencoding based cancelable biometrics. IEICE Trans. Inf. Syst. E94–D(9), 1768–1777 (2011)

    Article  Google Scholar 

  16. Pillai, J.K., Patel, V.M., Chellappa, R., Ratha, N.K.: Sectored random projections for cancelable iris biometrics. In: Proceeding IEEE International Conference on Acoustics Speech and Signal Processing, pp. 1838–1841 (2010)

    Google Scholar 

  17. Rathgeb, C., Breitinger, F., Busch, C.: Alignment-free cancelable iris biometric templates based on adaptive bloom filters. In: IEEE International Conference on Biometrics (ICB 2013), pp. 1–8 (2013)

    Google Scholar 

  18. Scheirer, W.J., Boult, T.E.: Cracking fuzzy vaults and biometric encryption. In: Proceedings of the Biometrics Symposium, pp. 1–6 (2007)

    Google Scholar 

  19. Teoh, A.B.J., Goh, A., Ngo, D.C.L.: Random multispace quantization as an analytic mechanism for biohashing of biometric and random identity inputs. IEEE Trans. Pattern Anal. Mach. Intell. 28(12), 1892–1901 (2006)

    Article  Google Scholar 

  20. Uhl, A., Wild, P.: Weighted adaptive hough and ellipsopolar transforms for real-time iris segmentation. In: Proceedings of the 5th IAPR International Conference on Biometrics (ICB 2012), pp. 283–290 (2012)

    Google Scholar 

  21. Zuo, J., Ratha, N.K., Connel, J.H.: Cancelable iris biometric. In: Proceedings of 19th International Conference on Pattern Recognition (ICPR 2008), pp. 1–4 (2008)

    Google Scholar 

Download references

Acknowledgments

This works is under supports by MOSTI Science Fund number 01-02-11-SF0201. Wun-She Yap would like to acknowledge the financial support by the MOSTI Science Fund number 01-02-11-SF0189. The authors would like to thank C. Rathgeb for his helpful advice and data sets used in this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yen-Lung Lai .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Lai, YL., Jin, Z., Goi, BM., Chai, TY., Yap, WS. (2016). Iris Cancellable Template Generation Based on Indexing-First-One Hashing. In: Chen, J., Piuri, V., Su, C., Yung, M. (eds) Network and System Security. NSS 2016. Lecture Notes in Computer Science(), vol 9955. Springer, Cham. https://doi.org/10.1007/978-3-319-46298-1_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46298-1_29

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46297-4

  • Online ISBN: 978-3-319-46298-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics