Design of alignment-free cancelable fingerprint templates via curtailed circular convolution

Fraudulent use of stolen fingerprint data and privacy invasion by tracking individuals unlawfully with shared or stolen fingerprint data justify the significance of fingerprint template protection. With no a priori fingerprint image registration, alignment-free cancelable fingerprint templates do not suffer from inaccurate singular point detection. In this paper, we propose an effective alignment-free method for constructing cancelable fingerprint templates via curtailed circular convolution. The proposed method features an efficient one-way transform, which protects the input binary string such that it cannot be retrieved from the length-reduced, convolved output vector. The transformed template fulfills the requirements of non-invertibility, revocability and diversity for cancelable fingerprint templates. Evaluation of the proposed scheme over FVC2002 DB1, DB2 and DB3 shows that the new method demonstrates satisfactory performance compared to the existing alignment-free cancelable template schemes.     

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

Registration-based cancelable template schemes rely on accurate fingerprint image alignment, which is very difficult to achieve. In this paper, by exploiting pair-minutiae vectors, we develop a lightweight, alignment-free scheme for generating cancelable fingerprint templates. The proposed mathematical model is based on a densely infinite-to-one mapping (DITOM) aiming to achieve the non-invertible property. The transformation designed describes the intersection of a collection of hyperplanes and effectively realizes infinite-to-one mapping. The proposed scheme has the properties of non-invertibility, revocability and multiple template independence. Evaluation of the proposed scheme over FVC2002 DB1, DB2 and DB3 shows that the new method exhibits satisfactory performance compared to existing methods.     

Fingerprint template protection with minutiae-based bit-string for security and privacy preserving

Recently, biometric template protection has received great attention from the research community due to the security and privacy concerns for biometric template. Although a number of biometric template protection methods have been reported, it is still a challenging task to devise a scheme which satisfies all of the four template protection criteria namely diversity, revocability, non-invertibility and performance. In this paper, a method is proposed to generate a revocable fingerprint template in terms of bit-string from a set of minutiae points via a polar grid based 3-tuple quantization technique. Two merits of the proposed method are outlined, namely alignment-free and performance. Four publicly available benchmark datasets: FVC2002 DB1, DB2 and FVC2004 DB1, DB2 are used to evaluate the performance of the proposed method. Besides, the diversity, revocability, non-invertibility criteria are also analyzed.     

一种有效的指纹图像方向滤波增强算法 *

方向滤波是沿着指纹纹线方向滤波的方法。一种方向滤波算法的有效性主要依赖于指纹图像方向估计的准确性和滤波模板构造的合理性。首先利用对低质量指纹图像鲁棒性较高的掩膜法估计点方向 ,并将点方向转换为块方向 ;然后使用八个方向的平滑滤波模板和锐化滤波模板 ,对指纹图像滤波进行增强 ;最后对增强后的指纹图像二值化。通过对 FVC2000指纹数据库 DB2中的指纹图像作增强处理 ,表明该算法增强效果较好。     

基于细节点邻域信息的可撤销指纹模板生成算法

为了提高指纹模板算法的安全性等性能,设计了一种基于细节点邻域信息的可撤销指纹模板生成算法.首先对指纹图像进行预处理,提取指纹的细节点特征,然后采用改进的细节点描述子采样结构提取细节点邻域的纹线特征,最后结合用户PIN码生成指纹模板,同时结合贪婪算法设计了相应的指纹匹配算法.在指纹数据库FVC2002-DB1和DB2上的实验表明,该算法具有良好的认证性能,能较好地满足可撤销性、多样性和不可逆性,而且改进的采样结构在没有降低系统识别性能的情况下,进一步拓展了细节点描述子的采样结构方式.     

Fingerprint template protection using multiline neighboring relation

Security and privacy concern of biometric information leads to the attention for generating cancellable template from the original biometric template. We proposed an alignment free cancellable template generation by construction of M rectangles with different orientations around every reference minutiae followed by the calculation of rotation invariant and translation invariant neighboring relation, plane based quantization for bit string generation and matching. The proposed method fulfills non-invertibility, accuracy, diversity and revocability properties which are the primary requirements of cancellable template design. The EER obtained for FVC 2002 DB1, DB2, and DB3 is 0.62%, 1.33%, and 2.64% for same key scenario. The proposed method shows the better performance for FVC 2002 DB1, DB2, and DB3 compared to the existing methods (Wang & Hu, 2012, 2014; Ahmad et al., 2011).     

基于比特串异或和置乱变换的指纹模板保护算法

针对现有指纹模板保护算法存在的准确性较低、安全性能较差的问题, 提出一种基于比特串异或和置乱变换的指纹模板保护算法. 该算法在已有二维映射算法的基础上, 对得到的比特串进行异或和随机索引置乱变换, 有效地将线性和非线性变换相结合, 扩展了密钥空间, 增强了指纹模板的安全性. 理论分析和仿真结果表明, 对于密钥泄露场景, 该算法在数据库FVC2002 DB1和DB2中的等错误率(Equal error rate, EER)分别为0.08 %和0.75 %, 与现有算法相比, 具有较好的准确性和安全性.     

基于自适应投影的指纹模板生成算法

针对现有指纹模板生成算法存在的准确性较低、安全性较差的问题,提出一种基于自适应投影的指纹模板生成算法。该算法将有效细节点对之间的距离垂直投影到自适应圆上,并对投影后的向量进行量化得到比特串。此外,为增强数据的安全性及隐私性,采用异或和随机索引置乱变换对比特串进行处理,最终生成指纹模板。在数据库FVC2002 DB1和DB2中的实验结果表明,该算法相较于对比算法,具有较高的准确性和安全性。     

基于指纹细节点的可撤销比特串模板生成算法

为了提高指纹模板算法的安全性能,设计了一种基于细节点的可撤销比特串指纹模板生成算法。首先对指纹图像进行预处理,提取指纹的细节点特征,然后对细节点特征进行量化和映射生成比特串模板,最后结合用户PIN码生成可撤销指纹模板。在指纹数据库FVC2002-DB1和DB2上的实验表明,该算法具有更好的安全性和认证性能,满足可撤销性、多样性和不可逆性。     

A key binding system based on n-nearest minutiae structure of fingerprint

Biometric cryptosystem has gained increasing attention in recent years. One of the difficulties in this field is how to perform biometric matching under template protection. In this paper, we propose a key binding system based on n-nearest minutiae structures of fingerprint. Unlike the traditional fingerprint recognition method, the matching of nearest structures are totally performed in the encrypted domain, where the template minutiae are protected. Three levels of secure sketch are applied to deal with error correction and key binding: (1) The wrap-around construction is used to tolerate random errors that happens on paired minutiae; (2) the PinSketch construction is used to recover nearest structures which are disturbed by burst errors; and (3) Shamir’s secret sharing scheme is used to bind and recover a key based on template minutia structures. The experimental results on FVC2002 DB1 and DB2 and security analysis show that our system is efficient and secure.     

Multi-algorithmic cancelable fingerprint template generation based on weighted sum rule and <Emphasis Type="Italic">T</Emphasis>-operators

With the emergence of biometric-based authentication systems in real-world applications, template protection in biometrics is a significant issue to be considered in the recent years. This paper presents two feature set computation algorithms, namely nearest neighbor feature set (NNFS) and Delaunay triangle feature set (DTFS), for a fingerprint sample. Further, the match scores obtained from these algorithms are fused using weighted sum rule and T-operators (T-norms and T-conorms). The experimental evaluation done on FVC 2002 databases confirms the credibility of fusion method compared to each individual algorithm used for fusing. The EER obtained for proposed method is 0 %, 0.059 %, and 3.93 % for FVC 2002 DB1, DB2, and DB3 databases, respectively. This paper also aims to prove the effectiveness of applying T-operators for fusion at score level in fingerprint template protection.     

基于细节点投影的可撤销指纹模板生成算法

为了改善指纹模板保护算法的可撤销性、不可逆性等性能,设计了一种基于细节点投影的可撤销指纹模板生成算法.首先对指纹图像进行预处理,提取指纹的细节点特征,并筛选出采样半径范围内的有效细节点,然后对细节点进行直线投影,将投影后的向量映射到二维网格,生成固定长度的一维比特串,再结合用户PIN码生成可撤销指纹模板.在指纹数据库FVC2002-DB1和DB2上的实验结果表明,该算法不仅提高了指纹模板认证的稳定性,而且在可撤销性、不可逆性和安全性等方面均具有较好性能.     

基于Fingercode和同态加密的指纹认证方案

针对开放网络中进行指纹身份认证时的双方指纹隐私保护问题,提出了基于Fingercode和同态加密的指纹认证方案。相较传统方案,该方案中服务器端模板以加密形式保存,保护了用户指纹数据的安全性;设计了安全认证协议,使得服务器和用户可以联合计算双方指纹特征的距离而不会泄露各自特征数据的隐私。协议中采用了数据打包技术,能够明显减轻服务器与用户之间的通讯压力和计算复杂度。分析和实验结果表明,该方案具有安全性和一定的实用性。     

Monitoring and diagnosis process of abnormal consumption on smart power grid

Unique and stable reference point is essential for registration and identification in automated fingerprint identification systems. Most existing methods for detecting reference points need to scan the fingerprint image or orientation field pixel by pixel or block by block to confirm a candidate reference point. The inherent complexity of this process makes those methods time-consuming. In this paper, we propose a two-step method to improve the efficiency of detecting reference points by (1) determining the singular point, i.e., the approximate position of the reference point, in a novel fast way; then (2) refining the reference point precisely in the local area of the singular point. In the first step, a walking algorithm is proposed which can walk directly to the singular point without scanning the whole fingerprint image and hence it is extremely fast. Then, in the local area around the singular point, an enhanced method based on mean-shift concept (EMS-based method) is designed to localize the reference point precisely. Experimental results on FVC2000 DB1a and DB2a databases validate that the proposed WEMS (Walking + EMS) method outperforms two state-of-the-art methods in terms of accuracy and efficiency.

     

Cancellability and diversity analysis of fingerprint template protection scheme based on compact minutiae pattern

ABSTRACT

As fingerprints continue toward ubiquity in human recognition applications, growing fingerprint databases will pose an increasingly greater risk of irreversible identity theft in the event of a database breach. Consequently, more focus is being placed on researching new and effective ways of securing fingerprint templates during database storage. Recently, a new fingerprint template protection scheme, based on representing a fingerprint by a sparse 3-, 4-, or 5-minutiae pattern, has been proposed. The most important advantage of this method over other fingerprint template protection schemes is that it employs only a small number of identifying features in the creation of the protected template, such that it is impossible to recover the original fingerprint even if the protected template is compromised. In this article, we present a thorough analysis to demonstrate that this new fingerprint construct also boasts impressive cancellability and diversity properties. Cancellability allows for the replacement of a compromised template with a new template from the same fingerprint, and diversity enables a person to enroll into multiple applications using the same fingerprint without the prospect of being tracked across the different applications.     

小波域中的PDE指纹图像增强

提出了一种基于偏微分方程的小波域指纹增强算法。分析了一致性扩散方程的缺陷,改为使用方向扩散使方程严格沿着指纹纹路扩散;进而提出了一种基于方向扩散的小波域指纹增强算法。该算法利用小波域低频系数图增强指纹,抑制了噪声的影响,将增强子图利用小波逆变换实现重构。通过对FVC2002的dB4指纹库中部分低质量图像的增强结果比较,表明该算法对低质量指纹图像的增强效果明显,且处理速度比现存的基于PDE的增强方法快。     

Fingerprint reconstruction: from minutiae to phase

Fingerprint matching systems generally use four types of representation schemes: grayscale image, phase image, skeleton image, and minutiae, among which minutiae-based representation is the most widely adopted one. The compactness of minutiae representation has created an impression that the minutiae template does not contain sufficient information to allow the reconstruction of the original grayscale fingerprint image. This belief has now been shown to be false; several algorithms have been proposed that can reconstruct fingerprint images from minutiae templates. These techniques try to either reconstruct the skeleton image, which is then converted into the grayscale image, or reconstruct the grayscale image directly from the minutiae template. However, they have a common drawback: Many spurious minutiae not included in the original minutiae template are generated in the reconstructed image. Moreover, some of these reconstruction techniques can only generate a partial fingerprint. In this paper, a novel fingerprint reconstruction algorithm is proposed to reconstruct the phase image, which is then converted into the grayscale image. The proposed reconstruction algorithm not only gives the whole fingerprint, but the reconstructed fingerprint contains very few spurious minutiae. Specifically, a fingerprint image is represented as a phase image which consists of the continuous phase and the spiral phase (which corresponds to minutiae). An algorithm is proposed to reconstruct the continuous phase from minutiae. The proposed reconstruction algorithm has been evaluated with respect to the success rates of type-I attack (match the reconstructed fingerprint against the original fingerprint) and type-II attack (match the reconstructed fingerprint against different impressions of the original fingerprint) using a commercial fingerprint recognition system. Given the reconstructed image from our algorithm, we show that both types of attacks can be successfully launched against a fingerprint recognition system.     

An effective biometric cryptosystem combining fingerprints with error correction codes

With the emergence and popularity of identity verification means by biometrics, the biometric system which can assure security and privacy has received more and more concentration from both the research and industry communities. In the field of secure biometric authentication, one branch is to combine the biometrics and cryptography. Among all the solutions in this branch, fuzzy commitment scheme is a pioneer and effective security primitive. In this paper, we propose a novel binary length-fixed feature generation method of fingerprint. The alignment procedure, which is thought as a difficult task in the encrypted domain, is avoided in the proposed method due to the employment of minutiae triplets. Using the generated binary feature as input and based on fuzzy commitment scheme, we construct the biometric cryptosystems by combining various of error correction codes, including BCH code, a concatenated code of BCH code and Reed-Solomon code, and LDPC code. Experiments conducted on three fingerprint databases, including one in-house and two public domain, demonstrate that the proposed binary feature generation method is effective and promising, and the biometric cryptosystem constructed by the feature outperforms most of the existing biometric cryptosystems in terms of ZeroFAR and security strength. For instance, in the whole FVC2002 DB2, a 4.58% ZeroFAR is achieved by the proposed biometric cryptosystem with the security strength 48 bits.