Skip to main content
SpringerLink
Log in

A Cancellable Ranking Based Hashing Method for Fingerprint Template Protection

  • Conference paper
  • First Online:
Mobile Networks and Management (MONAMI 2017)

Included in the following conference series:

Abstract

Despite a variety of theoretical-sound techniques have been proposed for biometric template protection, there is rarely practical solution that guarantees non-invertibility, cancellability, non-linkability and performance simultaneously. In this paper, a cancellable ranking based hashing is proposed for fingerprint template protection. The proposed method transforms a real-valued feature vector into an index code such that the pairwise-order measure in the hashed codes are closely correlated with rank similarity measure. Such a ranking based hashing offers two major merits: (1) Resilient to noises/perturbations in numeric values; and (2) Highly nonlinear embedding based on the rank correlation statistics. The former takes care of the accuracy performance mitigating numeric noises/perturbations while the latter offers strong non-invertible transformation via nonlinear feature embedding from Euclidean to Rank space that leads to toughness in inversion yet still preserve accuracy performance. The experimental results demonstrate reasonable accuracy performance on benchmark FVC2002 and FVC2004 fingerprint databases. The analyses justify its resilience to inversion, brute force and preimage attack as well as satisfy the revocability and unlink ability criteria of cancellable biometrics.

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

Access this chapter

Log in via an institution
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

References

  1. 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 

  2. Jain, A.K., Nandakumar, K., Nagar, A.: Biometric template security. EURASIP J. Adv. Sig. Process. 2008, 579416 (2008)

    Article  Google Scholar 

  3. Ratha, N.K., Chikkerur, S., Connell, J.H., Bolle, R.M.: Generating cancelable fingerprint templates. IEEE Trans. Pattern Anal. Mach. Intell. 29(4), 561–572 (2007)

    Article  Google Scholar 

  4. Rathgeb, C., Uhl, A.: A survey on biometric cryptosystems and cancelable biometrics. EURASIP J. Inf. Secur. 2011(1), 3 (2011)

    Article  Google Scholar 

  5. Patel, V.M., Ratha, N.K., Chellappa, R.: Cancelable biometrics: a review. IEEE Sig. Process. Mag. 32(5), 54–65 (2015)

    Article  Google Scholar 

  6. Natgunanathan, I., Mehmood, A., Xiang, Y., Beliakov, G., Yearwood, J.: Protection of privacy in biometric data. IEEE Access 4, 880–892 (2016)

    Article  Google Scholar 

  7. Nandakumar, K., Jain, A.K.: Biometric template protection schemes: bridging the performance gap between theory and practice. IEEE Sig. Process. Mag. 32(5), 88–100 (2015)

    Article  Google Scholar 

  8. Ferrara, M., Maltoni, D., Cappelli, R.: Noninvertible minutia cylinder-code representation. IEEE Trans. Pattern Anal. Mach. Intell. 7(6), 1727–1737 (2012)

    Google Scholar 

  9. Cappelli, R., Ferrara, M., Maltoni, D.: Minutia cylinder-code: a new representation and matching technique for fingerprint recognition. IEEE Trans. Pattern Anal. Mach. Intell. 32(12), 2128–2141 (2010)

    Article  Google Scholar 

  10. Ferrara, M., Maltoni, D., Cappelli, R.: A two-factor protection scheme for MCC fingerprint templates. In: 2014 International Conference of the Biometrics Special Interest Group, pp. 1–8 (2014)

    Google Scholar 

  11. Rathgeb, C., Breitinger, F., Busch, C., Baier, H.: On application of bloom filters to iris biometrics. IET Biom. 3(4), 207–218 (2014)

    Article  Google Scholar 

  12. Gomez-Barrero, M., Rathgeb, C., Galbally, J., Fierrez, J., Busch, C.: Protected facial biometric templates based on local gabor patterns and adaptive bloom filters. In: ICPR, pp. 4483–4488, August 2014

    Google Scholar 

  13. Li, G., Yang, B., Rathgeb, C., Busch, C.: Towards generating protected fingerprint templates based on bloom filters. In: 2015 International Workshop on Biometrics and Forensics, pp. 1–6 (2015)

    Google Scholar 

  14. Hermans, J., Mennink, B., Peeters, R.: When a bloom filter becomes a doom filter: security assessment of a novel iris biometric template protection system. In: Proceedings of the Special Interest Group on Biometrics, Darmstadt, pp. 1–6, September 2014

    Google Scholar 

  15. Bringer, J., Morel, C., Rathgeb, C.: Security analysis of bloom filter-based iris biometric template protection. In: Proceedings of International Conference on Biometrics (ICB), pp. 527–534 (2015)

    Google Scholar 

  16. Sandhya, M., Prasad, M.V.K.: k-Nearest Neighborhood Structure (k-NNS) based alignment-free method for fingerprint template protection. In: ICB 2015, pp. 386–393 (2015)

    Google Scholar 

  17. Wang, S., Hu, J.: A blind system identification approach to cancelable fingerprint templates. Pattern Recognit. 54, 14–22 (2016)

    Article  MathSciNet  Google Scholar 

  18. Yagnik, J., Strelow, D., Ross, D.A., Lin, R.-S.: The power of comparative reasoning. In: IEEE ICCV, pp. 2431–2438 (2011)

    Google Scholar 

  19. Nagar, A.: Biometric template security. Ph.D. dissertation, Department of Computer Science and Engineering, Michigan State University (2012)

    Google Scholar 

  20. Bhat, D., Nayar, S.: Ordinal measures for visual correspondence. In: Proceedings of CVPR, pp. 351–357 (1996)

    Google Scholar 

  21. Schölkopf, B., Smola, A., Müller, K.R.: Nonlinear component analysis as a kernel eigenvalue problem. Neural Comput. 10, 1299–1319 (1998)

    Article  Google Scholar 

  22. Jin, Z., Lim, M.H., Teoh, A.B.J., Goi, B.M., Tay, Y.H.: Generating fixed-length representation from minutiae using kernel methods for fingerprint authentication. IEEE Trans. Syst. Man Cybern. Syst. 40(10), 1415–1428 (2016)

    Article  Google Scholar 

  23. BioLab: FVC2002, FVC2004. http://bias.csr.unibo.it

  24. Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of 30th Symposium on Theory of Computing (1998)

    Google Scholar 

  25. Abe, N., Yamada, S., Shinzaki, T.: Irreversible fingerprint template using Minutiae Relation Code with Bloom Filter. In: IEEE 7th International Conference on Biometrics Theory, Applications and Systems (BTAS), Arlington, pp. 1–7 (2015)

    Google Scholar 

Download references

Acknowledgement

This work was supported by Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government (MSIT) (No. 2016-0-00097, Development of Biometrics-based Key Infrastructure Technology for On-line Identification).

Author information

Authors and Affiliations

  1. School of IT, Monash University Malaysia, Jalan Lagoon Selatan, 46150, Bandar Sunway, Selangor Darul Ehsan, Malaysia

    Zhe Jin & Yen-Lung Lai

  2. Electronics and Telecommunications Research Institute (ETRI), Seoul, South Korea

    Jung Yeon Hwang, Soohyung Kim & Sangrae Cho

  3. School of Electrical and Electronic Engineering, Yonsei University, Seoul, South Korea

    Andrew Beng Jin Teoh

Authors
  1. Zhe Jin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jung Yeon Hwang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Soohyung Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sangrae Cho
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Yen-Lung Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Andrew Beng Jin Teoh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andrew Beng Jin Teoh .

Editor information

Editors and Affiliations

  1. SEIT, UNSW Canberra, Canberra, Australia

    Jiankun Hu

  2. RMIT University, Melbourne, Victoria, Australia

    Ibrahim Khalil

  3. RMIT University, Melbourne, Victoria, Australia

    Zahir Tari

  4. Swinburne University of Technology, Hawthorne, Melbourne, Victoria, Australia

    Sheng Wen

Rights and permissions

Reprints and permissions

Copyright information

© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jin, Z., Hwang, J.Y., Kim, S., Cho, S., Lai, YL., Teoh, A.B.J. (2018). A Cancellable Ranking Based Hashing Method for Fingerprint Template Protection. In: Hu, J., Khalil, I., Tari, Z., Wen, S. (eds) Mobile Networks and Management. MONAMI 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 235. Springer, Cham. https://doi.org/10.1007/978-3-319-90775-8_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-90775-8_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-90774-1

  • Online ISBN: 978-3-319-90775-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation