Skip to content

Author

Jingqiang Lin

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Jul 2026

BOLT-FHE: An Efficient Unified Framework for GPU-based TFHE Bootstrapping via On-Chip Local Tiling Strategies

Bootstrapping is the main performance bottleneck in bitwise Fully Homomorphic Encryption (FHE), and practical acceleration requires careful orchestration of the blind rotation and external product chain under GPU resource constraints. This paper presents BOLT-FHE, a GPU bootstrapping framework that emphasizes block-local execution, on-chip tiling, and a unified MegaKernel supporting both gadget decomposition and modulus raising, with optional support for a recently proposed technique (Bergerat et al., CHES 2025) based on the common mask assumption (CM packing). Our design keeps the accumulator update chain within a single thread block and fuses NTT/INTT, external products, and accumulator updates using a fixed execution template. Two compile-time parameters—WPP (warps per polynomial) and IPT (items per thread)—control multi-warp cooperation and per-thread register footprint, enabling consistent kernel structure across different parameter sets.On an NVIDIA RTX 4090, BOLT-FHE reaches 40,166 bootstrappings per second at 128-bit security, demonstrating high-throughput TFHE bootstrapping on a commodity GPU. Compared to the state-of-the-art GPU implementation VeloFHE (Shen et al., CHES 2025), BOLT-FHE achieves 1.01x–2.92x speedups with gadget decomposition. In particular, for modulus raising, BOLT-FHE improves by 2.38x–2.42x without CM packing, and by 3.17x–3.31x under the best packing configuration, reflecting the combined benefits of fused arithmetic, more regular memory access, and amortization enabled by CM packing. Overall, BOLT-FHE shows that a portable, fused-kernel organization with explicit on-chip budgeting can substantially improve TFHE bootstrapping throughput while remaining compatible with both noise management paths.

Yanren Chen, Fangyu Zheng, Guang Fan et al. · 0 citations
Sep 2026

Quantum-Based Two-Factor Authentication Protocol for Blockchain-Aided Internet-of-Medical-Things

The rapid growth of the Internet-of-Medical-Things (IoMT) and quantum computing presents significant security risks. Quantum algorithms efficiently break traditional public-key encryption, exposing sensitive patient data to long-term threat. Consequently, ensuring robust authentication and long-term security under quantum threats remains a critical challenge, particularly in decentralized environments. This article proposes a decentralized two-factor authentication (2FA) protocol for IoMT. Our protocol integrates blockchain, biometric fuzzy extractors, and the BB84 quantum key distribution (QKD) protocol. We utilize the biometric fuzzy extractor to protect user identities. A public blockchain manages authentication parameters via smart contracts (SCs) to support decentralized identity verification. This mechanism facilitates user revocation and authorized traceability. Session keys establish through QKD to achieve information-theoretic security, and the protocol provides forward and backward secrecy. Formal security analysis under the Canetti–Krawczyk (CK) and real-or-random (ROR) models demonstrates resistance to impersonation, replay, man-in-the-middle, and quantum attacks. Experimental results show that our protocol reduces classical computation overhead by over 56% and classical communication overhead by 10% compared to existing baselines. Furthermore, it achieves lower communication costs while maintaining high efficiency for resource-constrained IoMT environments in the future.

Zhao-Feng Huang, Yu-Hong Ke, Xu Yang et al. · 0 citations