An alignment-free non-invertible transformation-based method for generating the cancellable fingerprint template

被引:0
|
作者
Diwakar Agarwal
Atul Bansal
机构
[1] GLA University,Electronics and Communication Engineering
[2] Chandigarh University,Electronics and Communication Engineering
来源
Pattern Analysis and Applications | 2022年 / 25卷
关键词
Cancellable; Fingerprint; Matching; Polar histogram; Template; Transformation;
D O I
暂无
中图分类号
学科分类号
摘要
Since long time fingerprint has been the most compelling biometric due to its permanence, universality, acceptability, and collectability. However, fingerprint recognition raises some privacy concerns. A stolen fingerprint template from the reference database could be used by an antagonist to gain a unauthorized access of the system. Therefore, the fingerprint needs to be secured from being compromised. In this paper, a non-invertible transformation function-based method for generating the cancellable fingerprint template is proposed. The transformation matrix is governed by the user key which is in the form of a randomly generated binary string. An alignment-free approach is proposed in which the fingerprint template is stored in the form of a polar histogram that contains the information about location of neighbouring minutiae around each detected minutia point. The matching score is obtained by computing the Chi-square distance between two templates. The pre-requisites for being the secured template are satisfied by conducting series of experiments on DB1 and DB2 datasets of FVC2000, FVC2002, FVC2004, and FVC2006 databases. The performance is evaluated in both non-transformed and transformed domains by computing error rates based on the receiver operating characteristic (ROC) of the fingerprint recognition system.
引用
收藏
页码:837 / 852
页数:15
相关论文
共 16 条
  • [1] An alignment-free non-invertible transformation-based method for generating the cancellable fingerprint template
    Agarwal, Diwakar
    Bansal, Atul
    PATTERN ANALYSIS AND APPLICATIONS, 2022, 25 (04) : 837 - 852
  • [2] Non-invertible Cancellable Template for Fingerprint Biometric
    Kavati, Ilaiah
    Kumar, G. Kiran
    Gopalachari, M. Venu
    Babu, E. Suresh
    Cheruku, Ramalingaswamy
    Reddy, V. Dinesh
    HYBRID INTELLIGENT SYSTEMS, HIS 2021, 2022, 420 : 615 - 624
  • [3] A robust and non-invertible fingerprint template for fingerprint matching system
    Trivedi, Amit Kumar
    Thounaojam, Dalton Meitei
    Pal, Shyamosree
    FORENSIC SCIENCE INTERNATIONAL, 2018, 288 : 256 - 265
  • [4] ON THE SECURITY OF NON-INVERTIBLE FINGERPRINT TEMPLATE TRANSFORMS
    Nagar, Abhishek
    Jain, Anil K.
    2009 FIRST IEEE INTERNATIONAL WORKSHOP ON INFORMATION FORENSICS AND SECURITY (WIFS), 2009, : 81 - 85
  • [5] A Novel Minutiae Triangulation Technique for Non-invertible Fingerprint Template Generation
    Trivedi, Amit Kumar
    Thounaojam, Dalton Meitei
    Pal, Shyamosree
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 186
  • [6] FinTem: A secure and non-invertible technique for fingerprint template
    Hayat, Amber
    Ali, Syed Sadaf
    Bhateja, Ashok Kumar
    Werghi, Naoufel
    COMPUTERS & SECURITY, 2024, 142
  • [7] Alignment-free Cancellable Template with Clustered-minutiae Local Structure
    Quang Nhat Tran
    Hu, Jiankun
    Wang, Song
    2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
  • [8] FinCaT: a novel approach for fingerprint template protection using quadrant mapping via non-invertible transformation
    Eain Ul Sehar
    Arvind Selwal
    Deepika Sharma
    Multimedia Tools and Applications, 2023, 82 : 22795 - 22813
  • [9] FinCaT: a novel approach for fingerprint template protection using quadrant mapping via non-invertible transformation
    Sehar, Eain Ul
    Selwal, Arvind
    Sharma, Deepika
    MULTIMEDIA TOOLS AND APPLICATIONS, 2023, 82 (15) : 22795 - 22813
  • [10] A Novel Cancelable FaceHashing Technique Based on Non-Invertible Transformation With Encryption and Decryption Template
    Sardar, Alamgir
    Umer, Saiyed
    Pero, Chiara
    Nappi, Michele
    IEEE ACCESS, 2020, 8 : 105263 - 105277