Distributed & Scalable Oblivious Sorting and Shuffling
Nicholas Ngai, Ioannis Demertzis, Javad Ghareh Chamani, Dimitrios Papadopoulos
Abstract
Existing oblivious systems offer robust security by concealing memory access patterns, but they encounter significant scalability and performance challenges. Recent efforts to enhance the practicality of these systems involve embedding oblivious computation, e.g., oblivious sorting and shuffling, within Trusted Execution Environments (TEEs). For instance, oblivious sort has been heavily utilized: in Oblix (S&P’18), when oblivious indexes are created and accessed; in Snoopy’s high-throughput oblivious key-value (SOSP’21) during initialization and when the input requests are deduplicated and prepared for delivery; in Opaque (NSDI’17) for all the proposed oblivious SQL operators; in the state-of-the-art non-foreign key oblivious join approach (PVLDB’20). Additionally, oblivious sort/shuffle find applications in Signal’s commercial solution for contact discovery, anonymous Google’s Key Transparency, Searchable Encryption, software monitoring, and differentially private federated learning with user privacy.In this work, we address the scalability bottleneck of oblivious sort and shuffle by re-designing these approaches to achieve high efficiency in distributed multi-enclave environments. First, we propose a multi-threaded bitonic sort optimized for the distributed setting, making it the most performant oblivious sort for small number of enclaves (up to 4). For larger numbers of enclaves, we propose a novel oblivious bucket sort, which improves data locality and network consumption and outperforms our optimized distributed bitonic-sort by up to 5-6×. To the best of our knowledge, these are the first distributed oblivious TEE-based sorting solutions. For reference, we are able to sort 2 GiB of data in 1 second and 128 GiB in 53.4 seconds in a multi-enclave test. A fundamental building block of our oblivious bucket-sort is an oblivious shuffle that improves the prior state-of-the-art result (CCS’22) by up to 9.5× in the distributed multi-enclave setting—interestingly it is better by 10% even in the single-enclave/multi-thread setting.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 0fb12bed-a098-4ea2-90e8-afca454d5277Cited by top-tier papers7
- I/O-Efficient Dynamic Searchable Encryption meets Forward & Backward PrivacyPriyanka Mondal, Javad Ghareh Chamani, Ioannis Demertzis, Dimitrios PapadopoulosUSENIX Security 2024 · 13 citations
- Jodes: Efficient Oblivious Join in the Distributed SettingYilei Wang, Xiangdong Zeng, Sheng Wang, Feifei LiVLDB 2025 · 1 citation
- SONIC: Concurrent Oblivious RAM & Data Structures for Low-Latency and High-ThroughputNihal Talur, Ioannis DemertzisUSENIX Security 2026
- Fully Oblivious Differential Privacy for Frequency Estimation in the Augmented Shuffle Model with Trusted ProcessorsTakao Murakami, Yuichi Sei, Reo EriguchiUSENIX Security 2026
- Flexway O-Sort: Enclave-Friendly and Optimal Oblivious SortingTianyao Gu, Yilei Wang, Afonso Tinoco, Bingnan Chen et al.USENIX Security 2025
Related papers
- DISCO*: Distributed and SCalable Oblivious Joins and Oblivious PrimitivesApostolos Mavrogiannakis, Xian Wang, Ioannis Demertzis, Dimitrios Papadopoulos et al.SOSP 2026
- EnigMap: External-Memory Oblivious Map for Secure EnclavesAfonso Tinoco, Sixiang Gao, Elaine ShiUSENIX Security 2023
- What Is the Price for Joining Securely? Benchmarking Equi-Joins in Trusted Execution EnvironmentsKajetan Jeremi Maliszewski, Jorge-Arnulfo Quiané-Ruiz, Jonas Traub, Volker MarklVLDB 2022 · 13 citations
- Waks-On/Waks-Off: Fast Oblivious Offline/Online Shuffling and Sorting with Waksman NetworksSajin Sasy, Aaron Johnson, Ian GoldbergCCS 2023 · 6 citations
- Oblix: An Efficient Oblivious Search IndexPratyush Mishra, Rishabh Poddar, Jerry Chen, Alessandro Chiesa et al.S&P 2018 · 200 citations
