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}
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.