{"title":"Cancelable binary biometric template generation scheme based on partial walsh transformation and MinHash algorithm","authors":"Shuaichao Song, Yeming Yang, Miao Yu, Yuming Liao, Weilai Guo, Jiyuan Li, Songhui Guo","doi":"10.1016/j.asoc.2025.113049","DOIUrl":null,"url":null,"abstract":"<div><div>With the widespread use of biometrics, biometric templates stored in biometric systems are at serious risk of security and privacy breaches. Cancelable biometric scheme is an effective remedy when many unprotected biometric templates are compromised. We propose a cancelable binary biometric template generation scheme based on the partial Walsh transformation and the MinHash algorithm to improve recognition accuracy and generation efficiency. Firstly, the partial Walsh matrix transforms the high-dimensional original biometric feature into a low-dimensional space. Then, protected cancelable binary biometric templates are generated based on the proposed sliding window grouping minimum hash algorithm SWG-MinHash. Our scheme demonstrates superior recognition accuracy and generation efficiency on fingerprint and face databases compared to existing schemes. Meanwhile, our scheme satisfies the properties of non-invertibility, revocability, and unlinkability, and is resistant to common security and privacy attacks. Therefore, our scheme effectively mitigates the problem of balancing recognition accuracy, security, and generation efficiency of cancelable biometric schemes and is more practical for biometric systems. The source code of our scheme is available at <span><span>https://github.com/sscwrx/cbef</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50737,"journal":{"name":"Applied Soft Computing","volume":"175 ","pages":"Article 113049"},"PeriodicalIF":7.2000,"publicationDate":"2025-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Soft Computing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1568494625003606","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
With the widespread use of biometrics, biometric templates stored in biometric systems are at serious risk of security and privacy breaches. Cancelable biometric scheme is an effective remedy when many unprotected biometric templates are compromised. We propose a cancelable binary biometric template generation scheme based on the partial Walsh transformation and the MinHash algorithm to improve recognition accuracy and generation efficiency. Firstly, the partial Walsh matrix transforms the high-dimensional original biometric feature into a low-dimensional space. Then, protected cancelable binary biometric templates are generated based on the proposed sliding window grouping minimum hash algorithm SWG-MinHash. Our scheme demonstrates superior recognition accuracy and generation efficiency on fingerprint and face databases compared to existing schemes. Meanwhile, our scheme satisfies the properties of non-invertibility, revocability, and unlinkability, and is resistant to common security and privacy attacks. Therefore, our scheme effectively mitigates the problem of balancing recognition accuracy, security, and generation efficiency of cancelable biometric schemes and is more practical for biometric systems. The source code of our scheme is available at https://github.com/sscwrx/cbef.
期刊介绍:
Applied Soft Computing is an international journal promoting an integrated view of soft computing to solve real life problems.The focus is to publish the highest quality research in application and convergence of the areas of Fuzzy Logic, Neural Networks, Evolutionary Computing, Rough Sets and other similar techniques to address real world complexities.
Applied Soft Computing is a rolling publication: articles are published as soon as the editor-in-chief has accepted them. Therefore, the web site will continuously be updated with new articles and the publication time will be short.