arXiv:2603.26890cs.CRcs.CV2026-03被引 1

用同态加密保护虹膜识别隐私,精度接近明文但速度慢12万倍

Privacy-Preserving Iris Recognition: Performance Challenges and Outlook

  • 用同态加密保护虹膜特征,通过掩码剔除不可靠区域后比对加密模板
  • 在CASIA-Iris-Thousand数据集上精度与明文系统相当,但计算开销超12万倍
  • 适合关注生物特征隐私保护的系统设计者,尤其需支持大规模匹配场景

相比指纹或人脸等生物特征,基于虹膜的生物识别因高准确率和长期稳定性日益受到重视。然而所有生物特征数据都高度敏感,在去中心化和不可信环境中带来严重隐私与安全问题。虽然全同态加密(FHE)为计算过程中的数据保护提供了前景,但现有隐私保护虹膜识别系统存在显著性能瓶颈,阻碍实际应用。本文研究了当前基于FHE的隐私保护虹膜识别系统的性能挑战,并提出一个符合ISO/IEC 24745标准的可扩展框架。基于Open Iris库,流程包括鲁棒虹膜分割、归一化及使用Gabor滤波器提取特征生成虹膜码;通过二值掩码剔除不可靠区域,再以汉明距离在加密虹膜码上进行匹配。在CASIA-Iris-Thousand数据集上的评估显示,该方案精度与明文系统相近,但成对虹膜模板比较的计算开销高达约120,000倍,表明在可扩展的1-N模板匹配场景中需采用两级方案。

原文摘要 · Abstract (English)

Iris-based biometric identification is increasingly recognized for its significant accuracy and long-term stability compared to other biometric modalities such as fingerprints or facial features. However, all biometric modalities are highly sensitive data that raise serious privacy and security concerns, particularly in decentralized and untrusted environments. While Fully Homomorphic Encryption (FHE) has emerged as a promising solution for protecting sensitive data during computation, existing privacy-preserving iris recognition systems face significant performance limitations that hinder their practical deployment. This paper investigates the performance challenges of the current landscape of privacy-preserving iris recognition systems using FHE. Based on these insights, we outline a scalable privacy-preserving framework that aligns with all the requirements specified in the ISO/IEC 24745 standard. Leveraging the Open Iris library, our approach starts with robust iris segmentation, followed by normalization and feature extraction using Gabor filters to generate iris codes. We then apply binary masking to filter out unreliable regions and perform matching using Hamming distance on encrypted iris codes. The accuracy and performance of our proposed privacy-preserving framework is evaluated on the CASIA-Iris-Thousand dataset. Results show that our privacy-preserving framework yields very similar accuracy to the cleartext equivalent, but a much higher computational overhead with respect to pairwise iris template comparisons, of $\sim 120\,000 \times$. This points towards the need for the deployment of two-level schemes in the context of scalable $1-N$ template comparisons.

虹膜识别同态加密隐私保护生物特征

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。