Abstract
This paper presents a novel algorithm of fingerprint encryption which transforms fingerprint minutiae and performs matching in the transformed form. If an encrypted template is compromised, it can be cancelled by choosing just another transformed template. In our algorithm, a circular region is constructed around each minutia and non-invertible transformation is applied to all regions but only transformed regions are stored in the database. The proposed algorithm improves the accuracy of verification compared to related fuzzy vault systems. Experimental results show the comparative performance of matching using both transformed and original data. We find that transformed matching also has an impressive accuracy and speed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.