Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

Gilad Asharov, T. H. Hubert Chan, Kartik Nayak, Rafael Pass, Ling Ren, Elaine Shi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


We propose a conceptually simple oblivious sort and
oblivious random permutation algorithms called bucket
oblivious sort and bucket oblivious random permutation. Bucket oblivious sort uses 6n log n time (measured by the number of memory accesses) and 2Z client
storage with an error probability exponentially small in
Z. The above runtime is only 3× slower than a nonoblivious merge sort baseline; for 230 elements, it is 5×
faster than bitonic sort, the de facto oblivious sorting
algorithm in practical implementations
Original languageAmerican English
Title of host publicationSymposium on Simplicity in Algorithms (SOSA)
EditorsMartin Farach-Colton, Inge Li Gørtz
Number of pages7
ISBN (Electronic)978-1-61197-601-4
StatePublished - 2020


Dive into the research topics of 'Bucket Oblivious Sort: An Extremely Simple Oblivious Sort'. Together they form a unique fingerprint.

Cite this