Demo Data from EDBT 2026 / reviewers in the wild / expert
Chunyi Zhang
dblp:323/0158
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 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.
| Network and information security
2 papers |
Cryptographic primitives and cryptanalysis · 65% Privacy and data protection · 35% | |
| Databases, data mining, and information retrieval
2 papers |
Query processing and optimization · 68% Database system architecture and tuning · 32% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Cloud and datacenter computing · 100% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Query processing and optimization
aggregate query processing |
1.0 | 1 | 2026 | Secure Acceleration of Aggregation Queries Over Homomorphically Encrypted Databases · IEEE Trans. Inf. Forensics Secur. 2026 |
Privacy and data protection › privacy-preserving query processing
encrypted query processing |
1.0 | 1 | 2026 | Secure Acceleration of Aggregation Queries Over Homomorphically Encrypted Databases · IEEE Trans. Inf. Forensics Secur. 2026 |
Cryptographic primitives and cryptanalysis
homomorphic encryption |
1.0 | 1 | 2026 | Secure Acceleration of Aggregation Queries Over Homomorphically Encrypted Databases · IEEE Trans. Inf. Forensics Secur. 2026 |
Database system architecture and tuning › database security
encrypted database |
0.9 | 1 | 2025 | Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data Management · IEEE Trans. Dependable Secur. Comput. 2025 |
Query processing and optimization
join processing |
0.9 | 1 | 2025 | Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data Management · IEEE Trans. Dependable Secur. Comput. 2025 |
Cryptographic primitives and cryptanalysis
structured encryption |
0.9 | 1 | 2025 | Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data Management · IEEE Trans. Dependable Secur. Comput. 2025 |
Cloud and datacenter computing
cloud security |
0.3 | 1 | 2026 | Secure Acceleration of Aggregation Queries Over Homomorphically Encrypted Databases · IEEE Trans. Inf. Forensics Secur. 2026 |
Methods — techniques the papers use, named apart from their topics
homomorphic encryption · 3.0tag-based join · 1.7global counter · 1.7encrypted multi-map · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Secure Acceleration of Aggregation Queries Over Homomorphically Encrypted Databases
Jinjiang Yang, Chunyi Zhang, Feng Liu 0059, Yingjie Xue, Kaiping Xue |
IEEE Trans. Inf. Forensics Secur. | 2 |
| 2025 | Dynamic Structurally-Encrypted Database Solutions for Large-Scale Data ManagementabstractThe widespread adoption of cloud storage has raised considerable data privacy concerns for outsourced databases. In recent years, Structured Encryption (STE) has emerged as a promising solution to build encrypted databases that efficiently handle queries while preserving privacy through underlying structures called Encrypted Multi-Maps (EMMs). However, current STE-based schemes primarily focus on static settings, and their direct extensions to dynamic settings introduce significant challenges in client storage overhead and update efficiency with join condition. In this paper, we present an efficient dynamic encrypted database scheme supporting large-scale data. To address the challenges in dynamic settings, we first propose a novel dynamic EMM design with constant client storage that utilizes a global counter to reduce client storage overhead. We then introduce an algorithm for dynamically handling join queries based on tags generated from values of the join attribute, significantly reducing update overhead. We implement our scheme and conduct comparative analyses with existing dynamic STE schemes. The experimental results demonstrate that our scheme offers significant advantages in terms of client storage overhead and update performance. Kaiping Xue, Yutao Guo, Jingjiang Yang, Feng Liu 0059, Chunyi Zhang, Qibin Sun, Jun Lu 0001 |
IEEE Trans. Dependable Secur. Comput. | 5 |