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 language | English |
|---|---|
| Title of host publication | 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020 |
| Editors | Martin Farach-Colton, Inge Li Gortz |
| Publisher | Society for Industrial and Applied Mathematics Publications |
| Pages | 8-14 |
| Number of pages | 7 |
| ISBN (Electronic) | 9781713807377 |
| State | Published - 2020 |
| Event | 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020 - Salt Lake City, United States Duration: 6 Jan 2020 → 7 Jan 2020 |
Publication series
| Name | 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020 |
|---|
Conference
| Conference | 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020 |
|---|---|
| Country/Territory | United States |
| City | Salt Lake City |
| Period | 6/01/20 → 7/01/20 |
Bibliographical note
Publisher Copyright:© 2020 by SIAM.