Distributed & Scalable Oblivious Sorting and Shuffling

ePrint Report: Distributed & Scalable Oblivious Sorting and Shuffling

Nicholas Ngai, Ioannis Demertzis, Javad Ghareh Chamani, Dimitrios Papadopoulos

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 …

access amp challenges computation distributed eprint report memory oblivious offer patterns performance report robust security scalability security systems