Demo Data from EDBT 2026 / reviewers in the wild / expert
Weizong Yu
dblp:389/7074
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0008-8086-8497ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 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 · 62% Reconfigurable computing and FPGAs · 19% Memory systems · 19% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Hardware accelerators and domain-specific architectures
cryptographic accelerator |
0.8 | 1 | 2024 | An NTT/INTT Accelerator with Ultra-High Throughput and Area Efficiency for FHE · DAC 2024 |
Reconfigurable computing and FPGAs
FPGA accelerator |
0.2 | 1 | 2024 | An NTT/INTT Accelerator with Ultra-High Throughput and Area Efficiency for FHE · DAC 2024 |
Memory systems › virtual memory management
memory mapping |
0.2 | 1 | 2024 | An NTT/INTT Accelerator with Ultra-High Throughput and Area Efficiency for FHE · DAC 2024 |
Methods — techniques the papers use, named apart from their topics
hardware/software pipeline · 0.8conflict-free memory mapping · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | An NTT/INTT Accelerator with Ultra-High Throughput and Area Efficiency for FHEabstractAs a core arithmetic operation and security guarantee of Fully Homomorphic Encryption (FHE), Number Theoretic Transform (NTT) of a large degree is the primary source of computational and time overhead. In this paper, we propose a scalable and conflict-free memory mapping algorithm that breaks the memory bound and releases a large amount of on-chip resources. A flexible and no-stall hardware/software pipeline architecture is designed to boost the throughput of NTT/INTT of N = 216 to over 48,543 operations per second with area efficiency, which 4× and 10× speed up the FPGA-based (HPCA'23) and GPU-based (HPCA'23) schemes. Zhaojun Lu, Weizong Yu, Peng Xu 0003, Wei Wang 0088, Jiliang Zhang 0002, Dengguo Feng |
DAC | 2 |
| 2024 | An FPGA-based Key-Switching Accelerator with Ultra-High Throughput for FHEabstractFully Homomorphic Encryption (FHE) enables computations directly on encrypted numbers, thereby preserving the privacy of sensitive information even in untrusted environments. However, the substantial computational overhead associated with homomorphic evaluations restricts the practical application of FHE schemes. To deal with the performance challenges, this paper proposes a hardware/software pipeline framework with a three-level cache architecture to accelerate the costly Key-Switching operation in FHE. This framework supports the dynamically reconfigurable processing mode, two parallelism strategies, and flexible control flow, effectively breaking the compute-bound and the memory-bound limitations. A no-stall and conflict-free memory mapping algorithm is implemented on the Xilinx U55C FPGA platform that boosts the throughput of ciphertext-ciphertext multiplication to 395 operations per second, which 1.4× and 2.5× speeds up the FPGA-based (HPCA'23) and GPU-based (HPCA'23) schemes with the same parameter set and precision. Zhaojun Lu, Peng Xu 0003, Qidong Chen, Weizong Yu, Gang Qu 0001 |
ICCAD | 6 |