{"title":"一种保护隐私的虹膜码验证生物特征匹配协议","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":"{\"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}","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}
A Privacy-Preserving Biometric Matching Protocol for Iris Codes Verification
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.