Quantum proof biometric authentication framework using binary lattices and homomorphic encryption for secure cancelable templates

Biometric authentication schemes have gained popularity due to their potential for strong security measures and user accessibility. Despite its benefits, significant concerns remain about the security and privacy of biometric data. The proposed AEGIIS (Quantum-proof Biometric Authentication: A FramEwork UtilizinG BInary Lattices and HomomorphIc Encryption for Cancelable TemplateS) secures an individual’s biometric templates through efficient arithmetic operations on binary lattices and homomorphic encryption, utilizing random noise polynomials with uniform distribution. Three benchmark data sets, ORL, CASIA-Face V5 and deep funneled LFW, were used for security and performance evaluations, resulting in Error Equal Rates of 0.000714, 0.000438, and 0.006330, respectively. The generated cancelable templates demonstrate average entropy, NPCR, and UACI values of 7.9360, 99.62 $$\%$$ , and 33.59 $$\%$$ , respectively, signifying substantially distorted templates that resist adversarial identification. The similarity score between freshly generated cancelable templates and stored CBT was evaluated against the predefined thresholds of Cosine Similarity ( $$S_{\cos }\ge 0.95$$ ), the Kolmogorov-Smirnov statistic Test ( $$S_{\text {KS}}\le 0.05$$ ) , and the Pearson Correlation Coefficient ( $$S_{\text {corr}}\ge 0.85$$ ), indicating successful authentication. The genuine and impostor distributions in the extensive data sets were used to validate the above authentication thresholds that were chosen through empirical testing. The proposed template protection method demonstrates a recognition accuracy of 99.5 $$\%$$ . The AEGIIS scheme was designed to operate on the Ring-Learning-with-Errors hardness problem, which exhibits the super polynomial complexity of $$\ {O(n \log n)}$$ and is resilient to both classical and quantum attacks and tested using indistinguishability analysis through IND-CPA analysis on ROM model, achieving post-quantum security with a key size of 256 bits.

Authors

Institutions

Publication Details

Journal
Discover Computing
Published
2025-06-27
DOI
https://doi.org/10.1007/s10791-025-09631-0
Citations
1
Primary Topic
Biometric Identification and Security
Type
article
Field-Weighted Citation Impact
1.49

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum proof biometric authentication framework using binary lattices and homomorphic encryption for secure cancelable templates

K. Geetha, N. Sasikaladevi, S. Aarthi
1 citations
Discover Computing
Biometric Identification and Security
1.49
article

Quantum proof biometric authentication framework using binary lattices and homomorphic encryption for secure cancelable templates

K. Geetha, N. Sasikaladevi, S. Aarthi
article en
1 citations

Abstract

Biometric authentication schemes have gained popularity due to their potential for strong security measures and user accessibility. Despite its benefits, significant concerns remain about the security and privacy of biometric data. The proposed AEGIIS (Quantum-proof Biometric Authentication: A FramEwork UtilizinG BInary Lattices and HomomorphIc Encryption for Cancelable TemplateS) secures an individual’s biometric templates through efficient arithmetic operations on binary lattices and homomorphic encryption, utilizing random noise polynomials with uniform distribution. Three benchmark data sets, ORL, CASIA-Face V5 and deep funneled LFW, were used for security and performance evaluations, resulting in Error Equal Rates of 0.000714, 0.000438, and 0.006330, respectively. The generated cancelable templates demonstrate average entropy, NPCR, and UACI values of 7.9360, 99.62 $$\%$$ , and 33.59 $$\%$$ , respectively, signifying substantially distorted templates that resist adversarial identification. The similarity score between freshly generated cancelable templates and stored CBT was evaluated against the predefined thresholds of Cosine Similarity ( $$S_{\cos }\ge 0.95$$ ), the Kolmogorov-Smirnov statistic Test ( $$S_{\text {KS}}\le 0.05$$ ) , and the Pearson Correlation Coefficient ( $$S_{\text {corr}}\ge 0.85$$ ), indicating successful authentication. The genuine and impostor distributions in the extensive data sets were used to validate the above authentication thresholds that were chosen through empirical testing. The proposed template protection method demonstrates a recognition accuracy of 99.5 $$\%$$ . The AEGIIS scheme was designed to operate on the Ring-Learning-with-Errors hardness problem, which exhibits the super polynomial complexity of $$\ {O(n \log n)}$$ and is resilient to both classical and quantum attacks and tested using indistinguishability analysis through IND-CPA analysis on ROM model, achieving post-quantum security with a key size of 256 bits.

Discover ComputingVol. 28(1)
SASTRA University (IN)
Department of Science and Technology, Ministry of Science and Technology, India, Science and Engineering Research Board
Openalex Percentile: Top 17%
Biometric Identification and Security
1.49
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.