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

14 Scopus citations

Abstract

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 non-oblivious merge sort baseline; for 230 elements, it is 5× faster than bitonic sort, the de facto oblivious sorting algorithm in practical implementations.

Original languageEnglish
Title of host publication3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020
EditorsMartin Farach-Colton, Inge Li Gortz
PublisherSociety for Industrial and Applied Mathematics Publications
Pages8-14
Number of pages7
ISBN (Electronic)9781713807377
StatePublished - 2020
Event3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020 - Salt Lake City, United States
Duration: 6 Jan 20207 Jan 2020

Publication series

Name3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020

Conference

Conference3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020
Country/TerritoryUnited States
CitySalt Lake City
Period6/01/207/01/20

Bibliographical note

Publisher Copyright:
© 2020 by SIAM.

Fingerprint

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

Cite this