Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Wei Chen 0161

dblp:181/2832-161 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0002-2511-5835ORCID · conflict

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

Security and privacy · 2 · 1 first-author · 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.

Network and information security
2 papers
Cryptographic primitives and cryptanalysis · 73% Privacy and data protection · 27%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
GPUs and heterogeneous computing · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic primitives and cryptanalysis
homomorphic encryption
1.922026
APEX: Accurate Parallel Expressive Homomorphic Execution for Encrypted Databases · SP 2026
Opera: Achieving Secure and High-Performance OLAP with Parallelized Homomorphic Comparisons · SP 2025
Privacy and data protection › privacy-preserving query processing
encrypted query processing
1.012026
APEX: Accurate Parallel Expressive Homomorphic Execution for Encrypted Databases · SP 2026
Query processing and optimization › secure query processing
encrypted query processing
0.912025
Opera: Achieving Secure and High-Performance OLAP with Parallelized Homomorphic Comparisons · SP 2025
Query processing and optimization › OLAP
OLAP query processing
0.912025
Opera: Achieving Secure and High-Performance OLAP with Parallelized Homomorphic Comparisons · SP 2025
Cryptographic primitives and cryptanalysis › homomorphic encryption
fully homomorphic encryption
0.912025
Opera: Achieving Secure and High-Performance OLAP with Parallelized Homomorphic Comparisons · SP 2025
GPUs and heterogeneous computing
GPU query processing
0.312025
Opera: Achieving Secure and High-Performance OLAP with Parallelized Homomorphic Comparisons · SP 2025

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

homomorphic comparison · 2.6density-driven cache management · 2.6caching · 2.6
YearPublicationVenuePosition
2026 APEX: Accurate Parallel Expressive Homomorphic Execution for Encrypted Databases
Wei Chen 0161, Siu-Ming Yiu, Heming Cui
SP1
2025 Opera: Achieving Secure and High-Performance OLAP with Parallelized Homomorphic Comparisons
abstract
Fully Homomorphic Encryption (FHE) is increasingly adopted in Online Analytical Processing (OLAP) systems to protect against data breaches. However, existing FHE-based OLAP systems must sequentially execute computationally intensive homomorphic comparisons for query processing on FHE ciphertexts, leading to significantly lower performance compared to traditional OLAP systems. We present Opera, the first high-performance FHE-based OLAP system on the GPU. Observing the redundancy in re-executing homomorphic comparisons from scratch, we design Homcache to create a GPU-accelerated parallel query execution workflow: Opera selectively caches comparison results and allows subsequent comparisons to reuse them, thereby reducing the computational cost per comparison and facilitating concurrent execution of multiple comparisons on the GPU. Nevertheless, due to the large size of FHE ciphertexts, Homcache can grow substantially, and naively applying traditional plaintext-oriented cache management strategies like LRU results in suboptimal performance. To ensure stable high performance, we develop a density-driven algorithm tailored for managing ciphertexts in Homcache. Compared to notable baselines running on CPUs, Opera reduces query latency by up to 9612x with 1.2GB cache storage without compromising security. OPERA's source code, complete benchmark suite, and raw results are available at github.com/hku-systems/Opera.
Wei Chen 0161, Tianxiang Shen, Xin Yao 0008, Nicholas Zhang, Heming Cui, Siu-Ming Yiu
SP2