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.

Graphical abstractFigure optionsDownload full-size imageDownload high-quality image (28 K)Download as PowerPoint slideResearch highlights► A soft two-level construction based on wrap-around and PinSketch is used to tolerate the random errors and burst errors in the n-nearest structures. ► Shamir’s secret sharing scheme is used for key binding. ► The proposed key binding system can work with or without minutiae alignment. ► Compared with other key binding system, the proposed system achieves higher ZeroGAR performance.