arXiv:2607.22065 · v2
BioZKFHE: Scalable Encrypted Biometric Identification via Verifiable Homomorphic Similarity Evaluation
摘要
Large-scale biometric identification in outsourced settings requires two properties simultaneously: biometric templates and queries must remain protected during computation, and the encrypted similarity outputs produced by an untrusted compute node must be verifiably correct before any application result is released. Existing FHE-based biometric systems primarily address confidentiality, while practical verifiability introduces two bottlenecks in the underlying encrypted 1:N matching layer: rotation- and bandwidth-heavy similarity evaluation and the high cost of proving repeated homomorphic similarity traces. We present BioZKFHE, a framework for scalable encrypted biometric identification via verifiable homomorphic similarity evaluation that combines BGV homomorphic computation with committee-based threshold opening, verification, and decryption, and smart-contract enforcement of the committee's verification attestations. To reduce encrypted storage and avoid rotation-heavy encrypted 1:N matching, we propose Single-Coefficient Multi-Value (SCMV) packing, which binds multiple quantized embedding values into each plaintext entry through base-T expansion. To make proof generation practical, we propose Parallelizable and Verifiable Similarity Computation (PVSC), which exploits the Double-CRT execution structure of BGV to decompose each blockwise similarity trace into parallel proof instances that are opened and checked before result release. Under standard lattice assumptions and explicit committee/verifier assumptions, we analyze recoverability, noise growth, confidentiality, encrypted-output integrity, and finalized-result integrity. Experiments on FaceNet and MobileFaceNet show near-lossless biometric utility, up to 67% encrypted-storage reduction, and about 22-44 s end-to-end proof-verified runtime for 10k-40k templates.
作者备注：v2: corrects the placement of PVSC verification (the algebraic check of opened proofs is executed inside the committee's threshold boundary and attested on-chain, rather than by the smart contract), the noise-correctness statement, and the login decision rule. Accepted for publication in IEEE Transactions on Dependable and Secure Computing. 29 pages, including supplementary material
期刊信息：IEEE Transactions on Dependable and Secure Computing, early access, 23 July 2026