A Two-Dimensional Infinite-to-One Transform for Generating Alignment-Free Cancelable Fingerprint Template

Biometrics plays a vital role in security through authentication and verification. Securing the biometric template is the current challenge field of research. As intruders attack the biometric system which affects the applications which are being used for human authentication. To name a few border security, access control surveillance and so on. Vulnerabilities too affect the protected templates at the time of biometric verification process. Biometric templates can be protected by using the techniques like transformation or cancelable biometrics, biometrics cryptosystem, and hybridization. Most of the vulnerabilities or attacks are resolved by developing hybridization process like combining biometrics template with user knowledge keys or passwords for secure authentication. The challenges in template protection are like alignment of template, selection of pseudonymous identifiers (PI), and auxiliary data (AD). An attempt is made to review the literature in this direction and present few issues and challenges in the field of biometric template protection.

U-healthcare, which grafted advanced IT technology onto medical technology, is in the limelight because it can provide medical services at anytime and anywhere. U-healthcare system applied RFID technology for Implantable Medical Device (IMD), but patient's biometric information can be easily exposed to third parties. In this article, RFID-based U-healthcare authentication protocol is proposed to prevent illegal usage for personal biometric information exposed to the third patty. The proposed protocol guarantees patients' biometric information integrity as compounding random numbers between administrators and hospital/clinic managers, and uses continuous number SEQ and time stamp T to synchronize IMD/administrators and administrators/hospital managers. Also, to protect user's privacy from the third party, patients' biometric information can be safely guarded by managing patients' security identifiers by administrators.

Cancellable fingerprint template has increasingly received interest in research thanks to not only the security for the user's original features but also the stable performance for the system. In this paper, we propose a new method to design cancellable fingerprint template with local structure by clustering the minutiae using the k Nearest Neighbor (kNN) algorithm. In other words, $k$ minutiae in a fingerprint that are closest to a reference minutia form a local structure. Pairwise features from the reference minutia and each of the member in the cluster are extracted and used for local structure matching. The partial Discrete Fourier Transformation was applied as the non-invertible transformation. This method has been evaluated with four public databases FVC2002 DB1-DB3, and FVC2004 DB2. The Equal Error Rate achieved for each database is 0.2%, 0.04%, 4.78%, and 7.64%, respectively.

An Outsized keys of various sizes such as 256,192 or 128 binary digits are being used for the existing symmetric cryptographic algorithms. These long keys are very tough to recollect. Consequently, key is deposited in a plastic card with a built-in microprocessor, tokens which cannot be tampered. Also an authentication based on password can be used to restrict the access of key related to cryptography. But there is every chance that these user nominated passwords can be lost, taken or predicted by dictionary attacks. Moreover, in symmetric cryptography there is another probable risk of safety that is copy of same secret key exists with receiver and sender and this must be kept secret. Probable solution to above deliberated key management problem is by using biological data of both receiver and sender in all sessions of communication. One of the foremost problem with biometrics is that once it gets negotiated it can't be reused. For cancelling and reissuing biometrics template, cancelable biometrics has been anticipated so that the above mentioned problem may be overcome. A method to generate 128 bit symmetric key using cancelable fingerprint template of receiver and sender is being proposed in this current work. This present approach confirms the privacy of fingerprints by one way transformation of original template into cancelable one as well as resolves the difficulty of key storage and key distribution. The reason is that in this approach the key is neither deposited in any location nor it is sent to the receiver.

The biometric community is faced with the difficult problem of protection of the original biometric template. One way of doing this is using a cancelable biometric method, which transforms original biometric template in a noninvertible way and uses the transformed template to verify a person's identity. In this paper, we propose two novel representation methods for fingerprint minutiae. Proposed methods based on this representation are simple to generate cancelable templates without requiring pre-alignment of the fingerprints. The main idea is to generate a minimal spanning tree (MST) for fingerprint minutiae in a three-dimensional (3D) feature space. The chain code representation for a generated MST in a two-dimensional (2D) feature space is proposed. A bit string is then generated by mapping the chain code into 2D array. The fingerprint minutiae based upon the Cartesian system is dealt with in Method-1, while the boundary representation of the minutiae is dealt with in Method-2. The proposed methods are evaluated using FVC2004 and FVC2002 databases and the performance is better compared to existing methods [C. Lee and J. Kim, J. Netw. Comput. Appl.33(3) (2010) 236–246; S. Wang and J. Hu, Pattern Recogn.45 (2012) 4129–4137; S. Wang and J. Hu, Pattern Recogn.47(3) (2014) 1321–1329; Z. Jin, A. B. J. Teoh, T. S. Ong and C. Tee, Expert Syst. Appl.39 (2012) 6157–6167; P. Das, K. Karthik and B. C. Garai, Pattern Recogn.45(9) (2012) 3373–3388; A. B. J. Teoh, D. C. L. Ngo and A. Goh, Pattern Recogn.37(11) (2004) 2245–2255.]

Alignment-free cancelable fingerprint template design: A densely infinite-to-one mapping (DITOM) approach

Biometric recognition is more and more employed in authentication and access control of various applications. Biometric data are strongly linked with the user and do not allow revocability nor diversity, without an adapted post-processing. Cancelable biometrics, including the very popular algorithm BioHashing, is used to cope with the underlying privacy and security issues. The principle is to transform a biometric template in a BioCode, in order to enhance user privacy and application security. These schemes are used for template protection of several biometric modalities, as fingerprints or face and the robustness is generally related to the hardness to recover the original biometric template by an impostor. In this paper, we propose to use genetic algorithms to approximate the original biometric feature and spoof the authentication system. We show through experimental results on fingerprints the efficiency of the proposed attack on the BioHashing algorithm, by approximating the original FingerCode, given the seed and the corresponding BioCode.

This work presents a novel method for biometric identity verification for newborn babies in maternity wards based on fingerprint minutiae. The information system realized combines contemporary program languages such as: Java and Python as object-oriented languages, C programming language for device programming as structural (line) and SQL for storing encrypted data in a relational database management system. Also, there is the RSA asynchronous cryptographic algorithm as well as keys for storing the encrypted data of fingerprint minutiae. The information system implements a device for biometric verification of maternity i.e. a dual fingerprint scanner that provides data of mother's and baby's fingerprints at the very moment of childbirth and further guarantees maternity for each newborn baby with 100% accuracy, by generating a unique ID reference and encrypting these data with cancelable biometrics. This is a novel method for determining identity based on baby's fingerprint minutiae.

Biometric template protection approaches have been developed to secure the biometric templates against image reconstruction on the stored templates. Two cancellable fingerprint template protection approaches namely minutiae-based bit-string cancellable fingerprint template and modified minutiae-based bit-string cancellable fingerprint template, are selected to be evaluated. Both approaches include the geometric information of the fingerprint into the extracted minutiae. Six modified fingerprint data sets are derived from the original fingerprint images in FVC2002DB1_B and FVC2002DB2_B by conducting the rotation and changing the quality of original fingerprint images according to the environment conditions during an emergency situation such as wet or dry fingers and disoriented angle of fingerprint images. The experimental results show that the modified minutiae-based bit-string cancellable fingerprint template performs well on all conditions during an emergency situation by achieving the matching accuracy between 83% and 100% on FVC2002DB1_B data set and between 99% and 100% on FVC2002DB2_B data set.

Strong biometrics is a key element of securing modern-day systems which are characterized specifically by iris. The research study portrayed in this paper deals specifically with the development of a neoteric iris acclamation subtlety. Data capturing marks the beginning process which acquires the biometric sample. This follows with feature extraction which leads to the creation of biometric signature. The developed biometric signature is compared with a particular or several biometric signatures that are being registered in the knowledge database, together designated as biometric templates. They are collected during the enrolment process which corresponds to an identity that is subject verified. When the acquired biometric signature matches with the template, then the identity being claimed is the same identity being stored; otherwise, it belongs to a different identity. The comparisons done between the templates determine the basic distinction betwixt the nodes that are exploited for performing biometric recognition, namely verification and identification. One-to-one match is resulted by the verification process, where the identity of the person is verified by the biometric system. On presenting a new sample to the system, calculation of the difference between the new sample and its corresponding template (which is stored previously in the system) is done and the comparison of the computed difference and predefined threshold takes place. New sample is being accepted if the difference comes out to be smaller; otherwise, rejection of sample occurs.

As the applications within Mobile devices becoming more extensive, the mobile communication security issues of these applications and researches are appearing to be the most important concern. In this paper, we propose new integration OTP framework technique which uses the fingerprint and voice features of biometrics in order to generate Mobile One Time Passwords (OTPs) Token. The fingerprint and voice are considered to be one of the powerful personal authentication factors of biometrics and it can be used for generating variable passwords based on mobile environments for one time use. However, we performed a simulation of homomorphic variability of fingerprint and voice feature points using dendrogram and distribution of fingerprint and voice feature points for proposed password generation method, and verified validation of availability.

A lightweight machine learning-based authentication framework for smart IoT devices

Cancelable biometrics has been proposed for canceling and re-issuing biometric templates and for protecting privacy in biometrics systems. Recently, new cancelable biometric approaches are proposed based on BioHashing, which are random transformed feature-based cancelable biometrics. In this paper, we consider the accuracy of one of the cancelable biometrics based on BioHashing and face. Through this analysis, as an illustration, we would like to raise an issue to be considered in cancelable biometrics: accuracy may be traded for biometrics being cancelable.

To replace compromised biometric templates, cancelable biometrics has recently been introduced. The concept is to transform a biometric signal or feature into a new one for enrollment and matching. For making cancelable fingerprint templates, previous approaches used either the relative position of a minutia to a core point or the absolute position of a minutia in a given fingerprint image. Thus, a query fingerprint is required to be accurately aligned to the enrolled fingerprint in order to obtain identically transformed minutiae. In this paper, we propose a new method for making cancelable fingerprint templates that do not require alignment. For each minutia, a rotation and translation invariant value is computed from the orientation information of neighboring local regions around the minutia. The invariant value is used as the input to two changing functions that output two values for the translational and rotational movements of the original minutia, respectively, in the cancelable template. When a template is compromised, it is replaced by a new one generated by different changing functions. Our approach preserves the original geometric relationships (translation and rotation) between the enrolled and query templates after they are transformed. Therefore, the transformed templates can be used to verify a person without requiring alignment of the input fingerprint images. In our experiments, we evaluated the proposed method in terms of two criteria: performance and changeability. When evaluating the performance, we examined how verification accuracy varied as the transformed templates were used for matching. When evaluating the changeability, we measured the dissimilarities between the original and transformed templates, and between two differently transformed templates, which were obtained from the same original fingerprint. The experimental results show that the two criteria mutually affect each other and can be controlled by varying the control parameters of the changing functions.

The purpose of this paper is to address the privacy paradox by attempting to better understand the predictors of users’ disclosure behavior and evaluates their relation to disclosure, and social capital on social network sites. Using a survey questionnaire, empirical data were collected from 473 members of Facebook in Taiwan. Partial least square (PLS) technique was performed to test the validity of the proposed research model. The results suggest that bridging and bonding social capital are determined by self-disclosure, which in turn is jointly determined by psychological need for privacy and privacy setting. The relationship between privacy concern and self-disclosure is mediated by privacy setting. The findings of this study can help social network sites operators design effective and relevant privacy controls to reduce a user's privacy concern and enhance self-disclosure on social network sites. Our contributions center on a comprehensive understanding of the impact of antecedents of self-disclosure on users’ disclosure behavior and social capital on SNSs may provide valuable insights for SNS operators and marketers to offer more effective services to SNS users.