Zhenhua Yin

dblp:283/0186 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 87% GPUs and heterogeneous computing · 13%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis › homomorphic encryption › fully homomorphic encryption
CKKS
1.012026
TensorFHE+: Fully Homomorphic Encryption Acceleration Based on Linear Algebra · IEEE Trans. Computers 2026
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
1.012026
TensorFHE+: Fully Homomorphic Encryption Acceleration Based on Linear Algebra · IEEE Trans. Computers 2026
Hardware accelerators and domain-specific architectures › cryptographic accelerator
homomorphic encryption accelerator
1.012026
TensorFHE+: Fully Homomorphic Encryption Acceleration Based on Linear Algebra · IEEE Trans. Computers 2026
Hardware accelerators and domain-specific architectures
machine learning accelerator
1.012026
TensorFHE+: Fully Homomorphic Encryption Acceleration Based on Linear Algebra · IEEE Trans. Computers 2026
GPUs and heterogeneous computing
GPU computing
0.312026
TensorFHE+: Fully Homomorphic Encryption Acceleration Based on Linear Algebra · IEEE Trans. Computers 2026

Methods — techniques the papers use, named apart from their topics

vectorized modulo arithmetic · 2.0tensor cores · 2.0data layout optimization · 2.0number-theoretic transform · 1.0number theoretic transform · 1.0
YearPublicationVenuePosition
2026 TensorFHE+: Fully Homomorphic Encryption Acceleration Based on Linear Algebra
abstract
Fully Homomorphic Encryption (FHE) enables encrypted data processing on untrusted cloud servers, crucial for privacy-sensitive applications. Despite its potential, performance overheads (about 10, 000× slower) limit adoption. ASIC accelerators outperform GPUs/FPGAs by optimizing specific operations but rely on costly 7nm processes and large on-chip memory, hindering cost-effective deployment. Balancing efficiency with manufacturing constraints remains critical. This paper presents TensorFHE+, a GPU-optimized FHE acceleration framework leveraging Tensor Cores to accelerate Number Theoretic Transform (NTT) operations. Key innovations include: 1) Decomposing CKKS kernels into vector/matrix operations for hardware utilization; 2) Vectorized modulo arithmetic; 3) Data layout optimization for memory efficiency. Evaluated on NVIDIA A100, TensorFHE+ outperforms TensorFHE [1] by 1.44× in average (up to 1.69× on ResNet-20) and surpasses prior GPU implementations [2], [3]. The design also demonstrates compatibility with commercial linear algebra accelerators, enabling efficient FHE deployment.
Yintai Sun, Shengyu Fan, Zhenhua Yin, Xinkai Song, Xing Hu 0001, Zidong Du, Qi Guo 0001, Weizhi Xu 0001, Rui Hou 0001, Dan Meng 0002, Song Bian 0001, Mingzhe Zhang 0005
IEEE Trans. Computers3