Demo Data from EDBT 2026 / reviewers in the wild / expert
Pinzhi Chen
dblp:386/7954
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2026
0009-0003-8227-8152ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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.
| Network and information security
3 papers |
Privacy and data protection · 56% Cryptographic protocols and secure computation · 44% | |
| Databases, data mining, and information retrieval
2 papers |
Query processing and optimization · 57% Distributed and cloud data management · 43% |
Topics — the 6 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection
privacy-preserving data analysis |
2.1 | 3 | 2026 | SIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs · WWW 2026 Shortcut: Making MPC-based Collaborative Analytics Efficient on Dynamic Databases · CCS 2024 SecureCA: Communication- and Round-Efficient Join and Group-By-Aggregation in Secure Database Services · IEEE Trans. Dependable Secur. Comput. 2026 |
Cryptographic protocols and secure computation
secure multiparty computation |
1.1 | 2 | 2026 | Shortcut: Making MPC-based Collaborative Analytics Efficient on Dynamic Databases · CCS 2024 SIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs · WWW 2026 |
Query processing and optimization
secure query processing |
1.0 | 1 | 2026 | SecureCA: Communication- and Round-Efficient Join and Group-By-Aggregation in Secure Database Services · IEEE Trans. Dependable Secur. Comput. 2026 |
Privacy and data protection › privacy-preserving machine learning › collaborative learning
secure collaborative learning |
1.0 | 1 | 2026 | SIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs · WWW 2026 |
Distributed and cloud data management
collaborative analytics |
0.8 | 1 | 2024 | Shortcut: Making MPC-based Collaborative Analytics Efficient on Dynamic Databases · CCS 2024 |
Cryptographic protocols and secure computation
secret sharing |
0.3 | 1 | 2026 | SIsomap: Secure Collaborative Manifold Learning with Reducing Communication Costs · WWW 2026 |
Methods — techniques the papers use, named apart from their topics
secure multiparty computation · 3.5incremental computation · 1.5secret sharing · 1.0isometric mapping · 1.0all-pairs shortest paths · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | SIsomap: Secure Collaborative Manifold Learning with Reducing Communication CostsabstractSecure manifold learning on datasets distributed among multiple data owners can benefit or even spawn many applications. For example, multiple service providers can jointly fit low-dimensional embeddings of their users' network behavior data to improve the accuracy of anomaly detection while addressing their privacy concerns about the datasets. In this paper, we focus on a classic manifold learning technique, known as isometric mapping (Isomap), and propose SIsomap, the first secure, distributed manifold learning system. We construct SIsomap based on secret sharing techniques and introduce careful optimizations. In particular, we propose two communication-efficient secure building blocks that focus on top-k and all-pairs shortest paths computation, respectively, and reduce secure operations by leveraging the characteristics of Isomap. Experimental results on both synthetic and real-world datasets demonstrate that our secure top-k and all-pairs shortest paths protocols are respectively up to 13.6× and 1818.5× faster than the state-of-the-art methods, and SIsomap as a whole is 11.1× to 28.8× faster than the baseline solution. Peizhao Zhou, Xiaojie Guo 0004, Pinzhi Chen, Ranyang Liu, Lihai Nie, Tong Li 0011, Zheli Liu |
WWW | 3 |
| 2026 | SecureCA: Communication- and Round-Efficient Join and Group-By-Aggregation in Secure Database Services
Pinzhi Chen, Peizhao Zhou, Xiaojie Guo 0004, Tong Li 0011, Zheli Liu |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2024 | Shortcut: Making MPC-based Collaborative Analytics Efficient on Dynamic DatabasesabstractSecure Multi-party Computation (MPC) provides a promising solution for privacy-preserving multi-source data analytics. However, existing MPC-based collaborative analytics systems (MCASs) have unsatisfying performance for scenarios with dynamic databases. Naively running an MCAS on a dynamic database would lead to significant redundant costs and raise performance concerns, due to the substantial duplicate contents between the pre-updating and post-updating databases. Peizhao Zhou, Xiaojie Guo 0004, Pinzhi Chen, Tong Li 0011, Siyi Lv, Zheli Liu |
CCS | 3 |