使用完全同态加密的多模态生物识别认证

Dilip Kumar Vallabhadas, M. Sandhya, Soumyadip Sarkar, Y. R. Chandra
{"title":"使用完全同态加密的多模态生物识别认证","authors":"Dilip Kumar Vallabhadas, M. Sandhya, Soumyadip Sarkar, Y. R. Chandra","doi":"10.1109/PCEMS58491.2023.10136104","DOIUrl":null,"url":null,"abstract":"In this paper multimodal biometric system is developed using two traits iris and fingerprint. The features generated by iris and fingerprint images are fused at the feature level. The generated fused feature vector template cannot be stored directly on the server, if stored directly can lead to various privacy and security concerns. So, these templates are encrypted in such a way that even when applying any operations on the templates, the templates should be in encrypted form. So, the operations need to be performed in the encrypted domain without decrypting it, and the final result, when decrypted should again give back the correct result as if the operations are performed on the original data. Fully Homomorphic encryption (FHE) scheme is designed to satisfy the above conditions. FHE is used to compute the hamming distance between the reference and probe template in an encrypted domain. To improve accuracy rotational invariant technique is used, which solves rotational inconsistency problems. The computational speed is increased by using a batching scheme to reduce the number of operations during homomorphic multiplication. We have conducted our experiment on the IITD and CASIA dataset. The best EER is obtained in CASIA dataset of 0.01% with a computational time of 0.0152 sec per template.","PeriodicalId":330870,"journal":{"name":"2023 2nd International Conference on Paradigm Shifts in Communications Embedded Systems, Machine Learning and Signal Processing (PCEMS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multimodal biometric authentication using Fully Homomorphic Encryption\",\"authors\":\"Dilip Kumar Vallabhadas, M. Sandhya, Soumyadip Sarkar, Y. R. Chandra\",\"doi\":\"10.1109/PCEMS58491.2023.10136104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper multimodal biometric system is developed using two traits iris and fingerprint. The features generated by iris and fingerprint images are fused at the feature level. The generated fused feature vector template cannot be stored directly on the server, if stored directly can lead to various privacy and security concerns. So, these templates are encrypted in such a way that even when applying any operations on the templates, the templates should be in encrypted form. So, the operations need to be performed in the encrypted domain without decrypting it, and the final result, when decrypted should again give back the correct result as if the operations are performed on the original data. Fully Homomorphic encryption (FHE) scheme is designed to satisfy the above conditions. FHE is used to compute the hamming distance between the reference and probe template in an encrypted domain. To improve accuracy rotational invariant technique is used, which solves rotational inconsistency problems. The computational speed is increased by using a batching scheme to reduce the number of operations during homomorphic multiplication. We have conducted our experiment on the IITD and CASIA dataset. The best EER is obtained in CASIA dataset of 0.01% with a computational time of 0.0152 sec per template.\",\"PeriodicalId\":330870,\"journal\":{\"name\":\"2023 2nd International Conference on Paradigm Shifts in Communications Embedded Systems, Machine Learning and Signal Processing (PCEMS)\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2023 2nd International Conference on Paradigm Shifts in Communications Embedded Systems, Machine Learning and Signal Processing (PCEMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCEMS58491.2023.10136104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 2nd International Conference on Paradigm Shifts in Communications Embedded Systems, Machine Learning and Signal Processing (PCEMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCEMS58491.2023.10136104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文利用虹膜和指纹两种特征开发了多模态生物识别系统。将虹膜和指纹图像生成的特征在特征层进行融合。生成的融合特征向量模板不能直接存储在服务器上,如果直接存储会导致各种隐私和安全问题。因此,这些模板是加密的,即使在模板上应用任何操作时,模板也应该以加密的形式存在。因此,需要在不解密的情况下在加密域中执行操作,并且解密后的最终结果应该再次返回正确的结果,就像在原始数据上执行操作一样。设计了满足上述条件的全同态加密(FHE)方案。FHE用于计算加密域内参考模板与探测模板之间的汉明距离。为了提高精度,采用了旋转不变量技术,解决了旋转不一致问题。在同态乘法运算过程中,采用批处理方法减少运算次数,提高了计算速度。我们在IITD和CASIA数据集上进行了实验。在CASIA数据集的效率为0.01%,每个模板的计算时间为0.0152秒时,获得了最佳的EER。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Multimodal biometric authentication using Fully Homomorphic Encryption
In this paper multimodal biometric system is developed using two traits iris and fingerprint. The features generated by iris and fingerprint images are fused at the feature level. The generated fused feature vector template cannot be stored directly on the server, if stored directly can lead to various privacy and security concerns. So, these templates are encrypted in such a way that even when applying any operations on the templates, the templates should be in encrypted form. So, the operations need to be performed in the encrypted domain without decrypting it, and the final result, when decrypted should again give back the correct result as if the operations are performed on the original data. Fully Homomorphic encryption (FHE) scheme is designed to satisfy the above conditions. FHE is used to compute the hamming distance between the reference and probe template in an encrypted domain. To improve accuracy rotational invariant technique is used, which solves rotational inconsistency problems. The computational speed is increased by using a batching scheme to reduce the number of operations during homomorphic multiplication. We have conducted our experiment on the IITD and CASIA dataset. The best EER is obtained in CASIA dataset of 0.01% with a computational time of 0.0152 sec per template.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Interactive Zira Voice Assistant- A Personalized Desktop Application Gait-Face Based Human Recognition From Distant Video Survey on Diverse Image Inpainting using Diffusion Models Survey, Analysis and Association Rules derivation using Apriori Method for buying preference amongst kids of age-group 5 to 9 in India Implementing Chaos Based Optimisations on Neural Networks for Predictions of Distributed Denial-of-Service (DDoS) Attacks
×
引用
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