Inthispaper,wedescribearandomizedShellsortalgorithm. This algorithm is a simple, randomized, data-oblivious versionoftheShellsortalgorithmthatalwaysrunsinO(nlogn) 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 privacypreserving computations based on the secure multi-party computation (SMC) paradigm. In addition, by a trivial conversionofthisMonteCarloalgorithmtoitsLasVegasequivalent, one gets the first version of Shellsort with a running time that is provably O(nlogn) with very high probability.