Affiliation:
1. University of California, Irvine
Abstract
In this article, we describe a
randomized Shellsort
algorithm. This algorithm is a simple, randomized, data-oblivious version of the Shellsort algorithm that always runs in
O
(
n
log
n
) time and succeeds in sorting any given input permutation with very high probability. Taken together, these properties imply applications in the design of new efficient privacy-preserving computations based on the secure multiparty computation (SMC) paradigm. In addition, by a trivial conversion of this Monte Carlo algorithm to its Las Vegas equivalent, one gets the first version of Shellsort with a running time that is provably
O
(
n
log
n
) with very high probability.
Funder
Office of Naval Research
National Science Foundation
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exploring the Efficiency of Data-Oblivious Programs;2023 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS);2023-04
2. A Brief Overview of Randomized Algorithms;IOT with Smart Systems;2023
3. Proving Obliviousness of Probabilistic Algorithms with Formal Verification;Companion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity;2022-11-29
4. Card-Based Secure Sorting Protocol;Advances in Information and Computer Security;2022
5. Secure Graph Analysis at Scale;Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security;2021-11-12