Jodes: Efficient Oblivious Join in the Distributed Setting
Yilei Wang, Xiangdong Zeng, Sheng Wang, Feifei Li

TL;DR
Jodes is a novel distributed oblivious join algorithm that enhances security against side-channel and network attacks while significantly improving performance over existing methods.
Contribution
It introduces a secure, efficient, and general equi-join algorithm for distributed environments with strong security guarantees and superior performance.
Findings
Up to sixfold performance improvement over existing algorithms
Supports general equi-join with high security level
Reduces communication and computation costs asymptotically
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 non-trivial database operators, are either inefficient, limited, or under a weak security assumption. In this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy, Security, and Data Protection
