Bucket Oblivious Sort: An Extremely Simple Oblivious Sort

08/04/2020
by   Gilad Asharov, et al.
0

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 6nlog 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^30 elements, it is 5× faster than bitonic sort, the de facto oblivious sorting algorithm in practical implementations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/19/2022

Lower bound on the running time of Pop-Stack Sorting on a random permutation

Pop-Stack Sorting is an algorithm that takes a permutation as an input a...
research
08/22/2022

Analysis of Approximate sorting in I/O model

We consider the problem of approximate sorting in I/O model. The goal of...
research
02/07/2023

Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place

Shuffling is the process of rearranging a sequence of elements into a ra...
research
08/31/2020

Rotational analysis of ChaCha permutation

We show that the underlying permutation of ChaCha20 stream cipher does n...
research
07/05/2023

Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns

We consider the problem of comparison-sorting an n-permutation S that av...
research
01/30/2020

An algebraic 1.375-approximation algorithm for the Transposition Distance Problem

In genome rearrangements, the mutational event transposition swaps two a...
research
08/02/2017

Practically efficient methods for performing bit-reversed permutation in C++11 on the x86-64 architecture

The bit-reversed permutation is a famous task in signal processing and i...

Please sign up or login with your details

Forgot password? Click here to reset