Improved upper bounds on Shellsort
Journal of Computer and System Sciences
Practical variations of shellsort
Information Processing Letters
Sorting with efficient use of special-purpose sorters
Information Processing Letters
Information Processing Letters
Sorting in c log n parallel steps
Combinatorica
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
SIAM Journal on Computing
Parallel Sorting in Two-Dimensional VLSI Models of Computation
IEEE Transactions on Computers
Sorting n Objects with a k-Sorter
IEEE Transactions on Computers
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Algorithms in C++
A lower bound on the size of shellsort sorting networks
SIAM Journal on Computing
Randomized algorithms
Sorting on a parallel pointer machine with applications to set expression evaluation
Journal of the ACM (JACM)
Journal of Algorithms
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
SIAM Journal on Computing
A lower bound on the average-case complexity of shellsort
Journal of the ACM (JACM)
A high-speed sorting procedure
Communications of the ACM
Analyzing variants of Shellsort
Information Processing Letters
Secure multi-party computation problems and their applications: a review and open problems
Proceedings of the 2001 workshop on New security paradigms
Universally composable two-party and multi-party secure computation
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Introduction to Algorithms
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
Analysis of Shellsort and Related Algorithms
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
A practical approach to solve Secure Multi-party Computation problems
Proceedings of the 2002 workshop on New security paradigms
Using finite experiments to study asymptotic performance
Experimental algorithmics
Shellsort and sorting networks
Shellsort and sorting networks
PDM Sorting Algorithms That Take A Small Number of Passes
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
SnakeSort: A Family of Simple Optimal Randomized Sorting Algorithms
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 03
An optimal parallel algorithm for integer sorting
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
Algorithm Design: Foundations, Analysis and Internet Examples
Algorithm Design: Foundations, Analysis and Internet Examples
The Mastermind Attack on Genomic Data
SP '09 Proceedings of the 2009 30th IEEE Symposium on Security and Privacy
Secure multi-party computation made simple
Discrete Applied Mathematics - Special issue: Coding and cryptography
Radix sorting with no extra space
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Bureaucratic protocols for secure two-party sorting, selection, and permuting
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Privacy-preserving data-oblivious geometric algorithms for geographic data
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Generic fully simulatable adaptive oblivious transfer
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Round-efficient oblivious database manipulation
ISC'11 Proceedings of the 14th international conference on Information security
Privacy-preserving group data access via stateless oblivious RAM simulation
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Secure computation, i/o-efficient algorithms and distributed signatures
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
Single round access privacy on outsourced storage
Proceedings of the 2012 ACM conference on Computer and communications security
PrivateFS: a parallel oblivious file system
Proceedings of the 2012 ACM conference on Computer and communications security
Private and oblivious set and multiset operations
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Graph drawing in the cloud: privately visualizing relational data using small working storage
GD'12 Proceedings of the 20th international conference on Graph Drawing
Distributed oblivious RAM for secure two-party computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Practically efficient multi-party sorting protocols from comparison sort algorithms
ICISC'12 Proceedings of the 15th international conference on Information Security and Cryptology
Data-oblivious graph algorithms for secure computation and outsourcing
Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Privacy-preserving matrix factorization
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Secure and verifiable outsourcing of large-scale biometric computations
ACM Transactions on Information and System Security (TISSEC)
Access privacy and correctness on untrusted storage
ACM Transactions on Information and System Security (TISSEC)
| Hi-index | 0.00 |
In this paper, 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 multi-party 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.