Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

Autor:	Asharov, Gilad, Chan, T-H. Hubert, Nayak, Kartik, Pass, Rafael, Ren, Ling, Shi, Elaine
Rok vydání:	2020
Předmět:	Computer Science - Data Structures and Algorithms Computer Science - Cryptography and Security
Druh dokumentu:	Working Paper
Popis:	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\times$ slower than a non-oblivious merge sort baseline; for $2^{30}$ elements, it is $5\times$ faster than bitonic sort, the de facto oblivious sorting algorithm in practical implementations. Comment: Appears in SOSA@SODA 2020
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2008.01765 Zobrazit plný text záznamu View this record from Arxiv