A Privacy-Preserving Biometric Matching Protocol for Iris Codes Verification

Kok-Seng Wong, M. Kim
{"title":"A Privacy-Preserving Biometric Matching Protocol for Iris Codes Verification","authors":"Kok-Seng Wong, M. Kim","doi":"10.1109/MUSIC.2012.28","DOIUrl":null,"url":null,"abstract":"Biometric-based authentication systems have been widely used in applications that require high reliable scheme. For instance, iris-based authentication systems had received great attention due to its high reliability for personal identification. However, the growing use of biometric systems in real life applications raises more attention and concern about the privacy issues. Unlike PIN or password which provides exact matches, iris-codes recognition provides a degree of probability or confidence that two iris-codes are similar based on some distance measurements. In iris verification, the biometric matching is performed by measuring the Hamming distance between the query feature vector and the template. The computation must not leak any sensitive information because the leakage of such information may allow any malicious party to reconstruct the original feature vector of the user. Once the original features have been revealed, the privacy of the user will be compromised forever. In view of this problem, we design a privacy preserving biometric matching protocol to facilitate the iris-codes matching in a privacy preserved environment. By introducing some chaff features in our computation, the malicious client who outputs an artificially low mismatch score can be easily detected by the server. Hence, our protocol makes it computationally infeasible for malicious client to impersonate as an enrolled user.","PeriodicalId":260515,"journal":{"name":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","volume":"44 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Third FTRA International Conference on Mobile, Ubiquitous, and Intelligent Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MUSIC.2012.28","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Biometric-based authentication systems have been widely used in applications that require high reliable scheme. For instance, iris-based authentication systems had received great attention due to its high reliability for personal identification. However, the growing use of biometric systems in real life applications raises more attention and concern about the privacy issues. Unlike PIN or password which provides exact matches, iris-codes recognition provides a degree of probability or confidence that two iris-codes are similar based on some distance measurements. In iris verification, the biometric matching is performed by measuring the Hamming distance between the query feature vector and the template. The computation must not leak any sensitive information because the leakage of such information may allow any malicious party to reconstruct the original feature vector of the user. Once the original features have been revealed, the privacy of the user will be compromised forever. In view of this problem, we design a privacy preserving biometric matching protocol to facilitate the iris-codes matching in a privacy preserved environment. By introducing some chaff features in our computation, the malicious client who outputs an artificially low mismatch score can be easily detected by the server. Hence, our protocol makes it computationally infeasible for malicious client to impersonate as an enrolled user.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种保护隐私的虹膜码验证生物特征匹配协议
基于生物特征的身份认证系统在对可靠性要求较高的应用中得到了广泛的应用。例如,基于虹膜的身份认证系统因其对个人身份的高可靠性而受到广泛关注。然而,越来越多的生物识别系统在现实生活中的应用引起了人们对隐私问题的关注和担忧。与提供精确匹配的PIN或密码不同,虹膜代码识别提供了一定程度的概率或信心,即基于一些距离测量,两个虹膜代码相似。在虹膜验证中,通过测量查询特征向量与模板之间的汉明距离来进行生物特征匹配。计算过程中不能泄露任何敏感信息,因为泄露敏感信息可能导致恶意方重构用户的原始特征向量。一旦原始功能被泄露,用户的隐私将永远受到损害。针对这一问题,我们设计了一种保护隐私的生物特征匹配协议,以便在保护隐私的环境下进行虹膜码匹配。通过在我们的计算中引入一些箔条特征,服务器可以很容易地检测到输出人为低错配分数的恶意客户端。因此,我们的协议使得恶意客户端冒充注册用户在计算上是不可行的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Source-Based Share-Tree Like Multicast Routing in Satellite Constellation Networks An Empirical Case of a Context-Aware Mobile Recommender System in a Banking Environment Generating OWL Ontology from Relational Database Data Overhead Impact of Multipath Routing for Multicast in Wireless Mesh Networks UVote: A Ubiquitous E-voting System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1