© The Institution of Engineering and Technology
In this study, the authors propose a novel fingerprint template protection scheme that is developed using Delaunay triangulation net constructed from the fingerprint minutiae. The authors propose two methods namely FS_INCIR and FS_AVGLO to construct a feature set from the Delaunay triangles. The feature set computed is quantised and mapped to a 3D array to produce fixed length 1D bit string. This bit string is applied with a DFT to generate a complex vector. Finally, the complex vector is multiplied by user's key to generate a cancellable template. The proposed computation of feature set maintained a good balance between security and performance. These methods are tested on FVC 2002 and FVC 2004 databases and the experimental results show satisfactory performance. Further, the authors analysed the four requirements namely diversity, revocability, irreversibility and accuracy for protecting biometric templates. Thus, the feasibility of proposed scheme is depicted.
References
-
-
1)
-
13. Jin, Z., Teoh, A.B.J., Ong, T.S., et al: ‘Fingerprint template protection with minutiae-based bit-string for security and privacy preserving’, Expert Syst. Appl., 2012, 39, pp. 6157–6167 (doi: 10.1016/j.eswa.2011.11.091).
-
2)
-
17. Jin, Z., Lim, M.-H., Teoh, A.B.J., et al: ‘A non-invertible randomized graph-based hamming embedding for generating cancelable finger-print template’, Pattern Recogn. Lett., 2014, 42, pp. 137–147 (doi: 10.1016/j.patrec.2014.02.011).
-
3)
-
6. Moujahdi, C., Bebis, G., Ghouzali, S., et al: ‘Fingerprint shell: secure representation of fingerprint template’, Pattern Recogn. Lett., 2014, 45, pp. 189–196 (doi: 10.1016/j.patrec.2014.04.001).
-
4)
-
22. Yang, W., Hu, J., Wang, S., et al: ‘Cancelable fingerprint templates with delaunay triangle-based local structures’. Proc. Cyberspace Safety and Security,, 2013, Springer International Publishing, pp. 81–91.
-
5)
-
5. Ratha, N., Connell, J., Bolle, R.: ‘Enhancing security and privacy in biometrics-based authentication systems’, IBM Syst. J., 2001, 40, pp. 614–634 (doi: 10.1147/sj.403.0614).
-
6)
-
21. Abellanas, M., Hurtado, F., Ramos, P.A.: ‘Structural tolerance and Delaunay triangulation’, Inf. Process. Lett., 1999, 71, pp. 221–227 (doi: 10.1016/S0020-0190(99)00107-6).
-
7)
-
23. Fingerprint Verification Competetion: .
-
8)
-
19. Gudmundsson, J., Hammar, M., van Kreveld, M.: ‘Higher order Delaunay triangulations’, Comput. Geom., 2002, 23, pp. 85–98 (doi: 10.1016/S0925-7721(01)00027-X).
-
9)
-
5. Yang, W., Hu, J., Wang, S., Stojmenovic, M.: ‘An alignment-free fingerprint bio-cryptosystem based on modified voronoi neighbor structures’, Pattern Recognit., 2013, 47, (3), pp. 1309–1320 (doi: 10.1016/j.patcog.2013.10.001).
-
10)
-
10. Bolle, R.M., Connell, J.H., Ratha, N.K.: ‘Biometric perils and patches’, Pattern Recogn., 2002, 35, pp. 2727–2738 (doi: 10.1016/S0031-3203(01)00247-3).
-
11)
-
12)
-
20. Fortune, S.: ‘Voronoi diagrams and Delaunay triangulations’, in Goodman, J.E., O'Rourke, J. (Eds.): ‘Handbook of discrete and computational geometry’ (CRC Press, Inc., Boca Raton, FL, USA, 1997), pp. 377–388.
-
13)
-
15. Yang, W., Hu, J., Wang, S.: ‘A Delaunay quadrangle-based fingerprint authentication system with template protection using topology code for local registration and security enhancement’, IEEE Trans. Inf. Forensics Sec., 2014, 9, pp. 1179–1192 (doi: 10.1109/TIFS.2014.2328095).
-
14)
-
9. Prasad, M.V.N.K., Santhosh Kumar, C.: ‘Fingerprint template protection using multiline neighboring relation’, Expert Syst. Appl., 2014, 41, pp. 6114–6122 (doi: 10.1016/j.eswa.2014.04.020).
-
15)
-
2. Cappelli, R., Maio, D., Lumini, A., et al: ‘Fingerprint image reconstruction from standard templates’, IEEE Trans. Pattern Anal. Mach. Intell., 2007, 29, pp. 1489–1503 (doi: 10.1109/TPAMI.2007.1087).
-
16)
-
7. Ahmad, T., Hu, J., Wang, S.: ‘Pair-polar coordinate-based cancelable fingerprint templates’, Pattern Recogition, 2011, 44, pp. 2555–2564 (doi: 10.1016/j.patcog.2011.03.015).
-
17)
-
12. Das, P., Karthik, K., Garai, B.C.: ‘A robust alignment-free fingerprint hashing algorithm based on minimum distance graphs’, Pattern Recogn., 2012, 45, pp. 3373–3388 (doi: 10.1016/j.patcog.2012.02.022).
-
18)
-
14. Wang, S., Hu, J.: ‘Design of alignment-free cancelable fingerprint templates via curtailed circular convolution’, Pattern Recogn., 2014, 47, pp. 1321–1329 (doi: 10.1016/j.patcog.2013.10.003).
-
19)
-
1. Ratha, N., Chikkerur, S., Connell, J., et al: ‘Generating cancelable fingerprint templates’, IEEE Trans. Pattern Anal. Mach. Intell., 2007, 29, pp. 561–572 (doi: 10.1109/TPAMI.2007.1004).
-
20)
-
6. Lee, C., Kim, J.: ‘Cancelable fingerprint templates using minutiae-based bit-strings’, J. Netw. Comput. Appl., 2010, 33, (3), pp. 236–246 (doi: 10.1016/j.jnca.2009.12.011).
-
21)
-
8. Wang, S., Hu, J.: ‘Alignment-free cancelable fingerprint template design: a densely infinite-to-one mapping (DITOM) approach’, Pattern Recogn., 2012, 45, pp. 4129–4137 (doi: 10.1016/j.patcog.2012.05.004).
-
22)
-
18. Sandhya, M., Prasad, M.V.N.K.: ‘k-Nearest Neighborhood Structure (k-NNS) based alignment-free method for fingerprint template protection’. Int. Conf. on Biometrics (ICB), 2015, pp. 386–393.
-
23)
-
25. Uludag, U., Jain, A.K.: ‘Attacks on biometric systems: a case study in fingerprints’. Proc. SPIE, Security, Steganography, and Watermarking of Multimedia Contents, 2004, vol. 5306, pp. 622–633.
-
24)
-
4. Ross, A., Shah, J., Jain, A.: ‘From template to image: reconstructing fingerprints from minutiae points’, IEEE Trans. Pattern Anal. Mach. Intell., 2007, 29, pp. 544–560 (doi: 10.1109/TPAMI.2007.1018).
-
25)
-
3. Jain, A.K., Nandakumar, K., Nagar, A.: ‘Biometric template security’, EURASIP J. Adv. Signal Process, 2008, 113, pp. 1–17 (doi: 10.1155/2008/657081).
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-bmt.2015.0034
Related content
content/journals/10.1049/iet-bmt.2015.0034
pub_keyword,iet_inspecKeyword,pub_concept
6
6