Demo Data from EDBT 2026 / reviewers in the wild / expert
Xiaopeng Zan
dblp:385/4825
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 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
1 paper |
Cryptographic protocols and secure computation · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Distributed and cloud data management · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
secure multiparty computation |
0.8 | 1 | 2024 | SecretFlow-SCQL: A Secure Collaborative Query pLatform · Proc. VLDB Endow. 2024 |
Distributed and cloud data management
collaborative analytics |
0.2 | 1 | 2024 | SecretFlow-SCQL: A Secure Collaborative Query pLatform · Proc. VLDB Endow. 2024 |
Methods — techniques the papers use, named apart from their topics
secure sort protocol · 1.5additive secret sharing · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | SecretFlow-SCQL: A Secure Collaborative Query pLatformabstractIn the business scenarios at Ant Group, there is a rising demand for collaborative data analysis among multiple institutions, which can promote health insurance, financial services, risk control, and others. However, the increasing concern about privacy issues has led to data silos. Secure Multi-Party Computation (MPC) provides an effective solution for collaborative data analysis, which can utilize data value while ensuring data security. Nevertheless, the performance bottlenecks of MPC and the strong demand for scalability pose great challenges to secure collaborative data analysis frameworks. In this paper, we build a secure collaborative data analysis system SCQL with a general purpose. We design more efficient MPC protocols and relational operators to meet the demand for scalability. In terms of system design, we aim to implement a system with security, usability, and efficiency. We conduct extensive experiments on SCQL to validate our optimization improvements: (1) Our optimized secure sort protocol sorts one million 64-bit data in only 4.5 minutes, 126× faster than EMP (9.4 hours). (2) The end-to-end execution time of the typical vertical scenario query is reduced by 1991× from the state-of-the-art semi-honest collaborative analysis framework Secrecy (rewritten with Additive Secret Sharing protocol), with appropriate security tradeoffs. (3) We test the system in the WAN setting with input size = 10 7 to demonstrate the scalability. We have successfully deployed SCQL to address problems in real-world business scenarios at Ant Group. Wenjing Fang, Shunde Cao, Guojin Hua, Junming Ma, Yongqiang Yu, Qunshan Huang, Xiaopeng Zan, Pu Duan |
Proc. VLDB Endow. | 9 |