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-mediated proof opening/decryption and smart-contract verification of opened proof batches. 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 percent encrypted-storage reduction, and about 22 to 44 seconds end-to-end proof-verified runtime for 10k to 40k templates.
Rundong Xin, Taotao Wang, Xiaoxiao Wu et al.· IEEE Transactions on Dependa...· 0 citations
With the rapid expansion of the Internet of Things (IoT) and heterogeneous wireless networks, Age of Information (AoI) has emerged as a critical metric for evaluating information freshness in real-time systems. AoI-oriented access optimization in heterogeneous multiple access networks is challenging because legacy access mechanisms, such as TDMA and ALOHA, may coexist over a shared channel, while conventional rule-based and learning-based methods often suffer from limited adaptability, slow convergence, and poor interpretability. In this paper, we propose Reflex-Core, an LLM-agent-based framework for AoI-oriented adaptive access in heterogeneous wireless networks. Reflex-Core adopts an “Observe-Reflect-Decide-Execute” closed-loop mechanism to refine transmission strategies through semantic feedback and historical memory. To provide an analytical foundation for reflection-guided strategy refinement, we derive a drift-plus-penalty design principle and construct a reflection-cycle-level reward target that jointly captures weighted AoI reduction and collision cost. This reward target guides reflection selection, reward model training, and PPO-based post-training. Based on Reflex-Core, we develop the Reflexive Multiple Access (RMA) protocol and a priority-aware RMA variant for differentiated freshness requirements. We further discuss an asynchronous edge-assisted implementation, where LLM-based reflection can be offloaded without blocking slot-level random access. Simulation results show that RMA reduces AoI by up to 14.9% compared with representative baselines and maintains robust performance in dynamic and priority-aware scenarios. Additional scalability and backbone-sensitivity experiments further confirm that Reflex-Core remains effective in a 20-node heterogeneous scenario with varied ALOHA loads and is robust when LongChat-7B-16k is replaced by Qwen2.5-7B-Instruct.
Fang Liu, Erchao Zhu, Jiedan Tan et al.· IEEE Open Journal of the Com...· 0 citations