Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

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

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

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

Department of Computer Science and Artificial Intelligence

The University of Hong Kong
Duke University
Cornell University
University of Illinois at Urbana-Champaign

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

32 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 2³⁰ 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.

Cite this

Asharov, G., Chan, T. H. H., Nayak, K., Pass, R., Ren, L., & Shi, E. (2020). Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. In M. Farach-Colton, & I. L. Gortz (Eds.), 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020 (pp. 8-14). (3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020). Society for Industrial and Applied Mathematics Publications.

@inproceedings{af9d629abe494bba9657d7b9fefe4a99,

title = "Bucket Oblivious Sort: An Extremely Simple Oblivious Sort",

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

author = "Gilad Asharov and Chan, \{T. H.Hubert\} and Kartik Nayak and Rafael Pass and Ling Ren and Elaine Shi",

note = "Publisher Copyright: {\textcopyright} 2020 by SIAM.; 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020 ; Conference date: 06-01-2020 Through 07-01-2020",

year = "2020",

language = "אנגלית",

series = "3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020",

publisher = "Society for Industrial and Applied Mathematics Publications",

pages = "8--14",

editor = "Martin Farach-Colton and Gortz, \{Inge Li\}",

booktitle = "3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020",

address = "ארצות הברית",

}

Asharov, G, Chan, THH, Nayak, K, Pass, R, Ren, L & Shi, E 2020, Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. in M Farach-Colton & IL Gortz (eds), 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020. 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020, Society for Industrial and Applied Mathematics Publications, pp. 8-14, 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, United States, 6/01/20.

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort. / Asharov, Gilad; Chan, T. H.Hubert; Nayak, Kartik et al.
3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020. ed. / Martin Farach-Colton; Inge Li Gortz. Society for Industrial and Applied Mathematics Publications, 2020. p. 8-14 (3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Bucket Oblivious Sort

T2 - 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020

AU - Asharov, Gilad

AU - Chan, T. H.Hubert

AU - Nayak, Kartik

AU - Pass, Rafael

AU - Ren, Ling

AU - Shi, Elaine

PY - 2020

Y1 - 2020

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/85121926893

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85121926893

T3 - 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020

SP - 8

EP - 14

BT - 3rd SIAM Symposium on Simplicity in Algorithms, SOSA 2020

A2 - Farach-Colton, Martin

A2 - Gortz, Inge Li

PB - Society for Industrial and Applied Mathematics Publications

Y2 - 6 January 2020 through 7 January 2020

ER -

Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

Abstract

Publication series

Conference

Bibliographical note

Other files and links

Fingerprint

Cite this