Alignment-free cancellable template generation for fingerprint based authentication
- Authors: Nazmul, Rumana , Islam, Rafiqul , Chowdhury, Ahsan
- Date: 2018
- Type: Text , Conference proceedings
- Relation: 4th International Conference on Information Systems Security and Privacy, ICISSP 2018; Madeira, Portugal; 22nd-24th January 2018 Vol. 2018-January, p. 361-366
- Full Text: false
- Reviewed:
- Description: With the emergence and extensive deployment of biometric based user authentication system, ensuring the security of biometric template is becoming a growing concern in research community. One approach of securing biometric data is cancellable biometric which transforms the original biometric features into a non-invertible form for enrolment and matching. However, most of the schemes for generating cancellable template are alignment-based requiring an accurate alignment of query and enrolled images, which is very difficult to achieve. In this paper, we propose an alignment-free technique for generating revocable fingerprint template that exploits the local features i.e., minutiae details in a fingerprint image. A rotation and translation invariant values are extracted from the neighbouring region of each minutia. The invariant values are then used as inputs in a transformation function and combined with a stored and a user-specific key based random vectors using the type and orientation information of the minutiae. Hence, by varying the stored and user-specific keys in the transformation, multiple application-specific templates can be generated to preserve users’ privacy. Besides, if the transformed template is compromised, a new template can be reissued by assigning different keys for transformation to achieve revocability. Furthermore, the proposed approach preserves the actual geometric relationships between the enrolled and query templates even after transformation and offers reasonable recognition rate. Experiments conducted on FVC2000 DB1 demonstrate that the proposed method exhibits promising performance in terms of recognition accuracy, computational complexity, security along with diversity, revocability and non-invertibility that are the key issues of cancellable template generation.
- Description: ICISSP 2018 - Proceedings of the 4th International Conference on Information Systems Security and Privacy
Alignment-free fingerprint template protection technique based on minutiae neighbourhood information
- Authors: Nazmul, Rumana , Islam, Rafiqul , Chowdhury, Ahsan
- Date: 2018
- Type: Text , Conference proceedings
- Relation: International Conference on Applications and Techniques in Cyber Security and Intelligence, ATCSI 2017; Ningbo, China; 16th-18th June 2017; published in International Conference on Applications and Techniques in Cyber Security and Intelligence : Applications and Techniques in Cyber Security and Intelligence (Advances in Intelligent Systems and Computing series) Vol. 580, p. 256-265
- Full Text: false
- Reviewed:
- Description: With the emergence and extensive deployment of biometric-based user authentication system, ensuring the security of biometric template is becoming a growing concern in the research community. One approach to securing template is to transform the original biometric features into a non-invertible form and to use it for a person’s authentication. Registration-based template protection schemes require an accurate alignment of the enrolled and the query images, which is very difficult to achieve. To overcome the alignment issue, registration-free template protection approaches have been proposed that rely on local features such as minutiae details in a fingerprint image. In this paper, we develop an alignment-free fingerprint template protection technique which extracts the rotation and translation invariant features from the neighbouring region of each minutia and then exploits the neighbourhood information to achieve the non-invertible property. Evaluation of the proposed scheme on FVC2002 DB1-B shows that the new method exhibits satisfactory performance in terms of recognition accuracy, computational complexity, and security. © 2018, Springer International Publishing AG.
Minimization of CTS of k-CNOT circuits for SSF and MSF model
- Authors: Ibrahim, Yousef , Chowdhury, Ahsan , Babu, Hafiz
- Date: 2008
- Type: Text , Conference proceedings
- Relation: 23rd IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, DFT 2008; Boston, MA; United States; 1st -3rd October 2008; published in proceedings - IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems pg. 290-298 p. 290-298
- Full Text: false
- Reviewed:
- Description: In this paper, we consider the problem of testing reversible circuits for a particular fault model: Stuck-at Fault Model. We propose a design-for-test construction technique for k-CNOT circuit having k ≥ 1 and only 2 test vector (i.e. minimal) suffice as their complete test set. We have also shown the way to exploit our method for the case of 0-CNOT circuits. Finally we provide some experimental results for the proposed method and compare it with existing method to show how the proposed one outperforms the existing one both in terms of number of test vectors of complete test set and number of gates need to be replaced in the design-for-test. © 2008 IEEE.
- Description: Proceedings - IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems