论文标题
可取消模板的广义方法及其实现小节缸代码
A Generalized Approach for Cancellable Template and Its Realization for Minutia Cylinder-Code
论文作者
论文摘要
哈希技术最近在保护生物识别模板方面引起了很多关注。例如，最新报告的哈希技术索引（IOM）是一种基于排名的局部性敏感哈希技术，它说明了保护有序和固定长度生物特征模板的可行性。但是，生物特征模板并不总是以有序和固定长度的形式形式，而是它可能是无序且可变的大小点集，例如指纹细节，限制了传统哈希技术的使用。在本文中，我们提出了IOM HASHINing的广义版本，即GIOM，因此可以使用无序和可变尺寸的生物特征模板。我们使用众所周知的变量尺寸矢量，指纹细节缸代码（MCC）证明了实现。 GIOM将MCC转换为索引域以形成基于索引的特征表示。因此，MCC从转化表示形式的反转是不可行的，因此在保留性能时实现了不可抑制。公共指纹数据库FVC2002和FVC2004用于实验作为基准，以证明与其他方法进行了公平的比较。此外，安全性和隐私分析表明，GIOM符合模板保护的标准：不可抑制性，可竞态性和不可链接性。
Hashing technology gains much attention in protecting the biometric template lately. For instance, Index-of-Max (IoM), a recent reported hashing technique, is a ranking-based locality sensitive hashing technique, which illustrates the feasibility to protect the ordered and fixed-length biometric template. However, biometric templates are not always in the form of ordered and fixed-length, rather it may be an unordered and variable size point set e.g. fingerprint minutiae, which restricts the usage of the traditional hashing technology. In this paper, we proposed a generalized version of IoM hashing namely gIoM, and therefore the unordered and variable size biometric template can be used. We demonstrate a realization using a well-known variable size feature vector, fingerprint Minutia Cylinder-Code (MCC). The gIoM transforms MCC into index domain to form indexing-based feature representation. Consequently, the inversion of MCC from the transformed representation is computational infeasible, thus to achieve non-invertibility while the performance is preserved. Public fingerprint databases FVC2002 and FVC2004 are employed for experiment as benchmark to demonstrate a fair comparison with other methods. Moreover, the security and privacy analysis suggest that gIoM meets the criteria of template protection: non-invertibility, revocability, and non-linkability.
