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

Xiangdong Zeng

dblp:258/9835 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · unresolved

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 · 62% Hardware security and side channels · 19% Privacy and data protection · 19%
Databases, data mining, and information retrieval
1 paper
Query processing and optimization · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
join processing
0.912025
Jodes: Efficient Oblivious Join in the Distributed Setting · Proc. VLDB Endow. 2025
Cryptographic protocols and secure computation
secure query processing
0.912025
Jodes: Efficient Oblivious Join in the Distributed Setting · Proc. VLDB Endow. 2025
Privacy and data protection › information leakage
access pattern leakage
0.312025
Jodes: Efficient Oblivious Join in the Distributed Setting · Proc. VLDB Endow. 2025
Hardware security and side channels
trusted execution environments
0.312025
Jodes: Efficient Oblivious Join in the Distributed Setting · Proc. VLDB Endow. 2025

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

trusted execution environment · 1.7oblivious computation · 1.7distributed query execution · 1.7
YearPublicationVenuePosition
2025 Jodes: Efficient Oblivious Join in the Distributed Setting
abstract
Trusted execution environment (TEE) has provided an isolated and secure environment for building cloud-based analytic systems, but it still suffers from access pattern leakages caused by side-channel attacks. To better secure the data, computation inside TEE enclave should be made oblivious, which introduces significant overhead and severely slows down the computation. A natural way to speed up is to build the analytic system with multiple servers in the distributed setting. However, this setting raises a new security concern—the volumes of the transmissions among these servers can leak sensitive information to a network adversary. Existing works have designed specialized algorithms to address this concern, but their supports for equi-join, one of the most important but nontrivial database operators, are either inefficient, limited, or under a weak security assumption. In this paper, we present Jodes, an efficient oblivious join algorithm in the distributed setting. Jodes prevents the leakage on both the network and enclave sides, supports a general equi-join operation, and provides a high security level protection that only publicizes the input sizes and the output size. Meanwhile, it achieves both communication cost and computation cost asymptotically superior to existing algorithms. To demonstrate the practicality of Jodes, we conduct experiments in the distributed setting comprising 16 servers. Empirical results show that Jodes achieves up to a sixfold performance improvement over state-of-the-art join algorithms.
Xiangdong Zeng, Sheng Wang 0011, Feifei Li 0001
Proc. VLDB Endow.2