Paper 2026/2572

DISCO*: DIstributed and SCalable Oblivious Joins and Oblivious Primitives

Apostolos Mavrogiannakis, University of California, Santa Cruz
Xian Wang, Hong Kong University of Science and Technology
Ioannis Demertzis, Hong Kong University of Science and Technology
Dimitrios Papadopoulos, Hong Kong University of Science and Technology
Minos Garofalakis, ATHENA Research Center and Technical University of Crete, Greece
Abstract

Trusted Execution Environments (TEEs) let clients outsource computation to untrusted clouds, but they remain vulnerable to side-channel and leakage-abuse attacks. Recent work closes this gap by combining hardware enclaves with oblivious computation, which offers strong security guarantees yet struggles to meet the performance and scalability demands of real-world deployments. In this work, we present DISCO, the first scalable, distributed, and fully oblivious database system that seamlessly combines hardware enclaves with cutting-edge oblivious primitives and novel optimizations that significantly reduce inter-server communication overheads. What distinguishes DISCO from prior work is a suite of distributed frameworks that unlock parallel computation and fundamentally shift the design paradigm of distributed oblivious systems, enabling practical deployment at scales that were unattainable with previous solutions. We provide a thorough evaluation of the performance of our system on both synthetic and real-world datasets. Our evaluation demonstrates that our design significantly reduces the gap between theory and practice, achieving 88× speedup over Jodes and 180× over SODA on non-foreign key joins with N = 2²⁵ elements. Most importantly, we report, for the first time, results for computations at the terabyte scale.

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Published elsewhere. ACM SIGOPS 32nd Symposium on Operating Systems Principles (SOSP '26), Prague, Czech Republic, 2026.
DOI
10.1145/3830418.3843862
Keywords
oblivious computationtrusted execution environmentsdistributed databasesoblivious joinsoblivious sorting
Contact author(s)
amavrogi @ ucsc edu
xwanggj @ connect ust hk
idemertz @ ucsc edu
dipapado @ cse ust hk
minos @ athenarc gr
History
2026-10-21: approved
2026-10-20: received
See all versions
Short URL
https://ia.cr/2026/2572
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/2572,
      author = {Apostolos Mavrogiannakis and Xian Wang and Ioannis Demertzis and Dimitrios Papadopoulos and Minos Garofalakis},
      title = {{DISCO}*: {DIstributed} and {SCalable} Oblivious Joins and Oblivious Primitives},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2572},
      year = {2026},
      doi = {10.1145/3830418.3843862},
      url = {https://eprint.iacr.org/2026/2572}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.