research-article

Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm

Author:

Michael T. GoodrichAuthors Info & Claims

Journal of the ACM (JACM), Volume 58, Issue 6

Article No.: 27, Pages 1 - 26

https://doi.org/10.1145/2049697.2049701

Published: 01 December 2011 Publication History

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.

References

[1]

Ajtai, M., Komlós, J., and Szemerédi, E. 1983. Sorting in c log n parallel steps. Combinatorica 3, 1--19.

Digital Library

[2]

Arora, S., Leighton, T., and Maggs, B. 1990. On-line algorithms for path selection in a nonblocking network. In Proceedings of the 22nd ACM Symposium on Theory of Computing (STOC’90). ACM, New York, 149--158.

Digital Library

[3]

Assaf, S. and Upfal, E. 1991. Fault tolerant sorting networks. SIAM J. Disc. Math. 4, 4, 472--480.

Digital Library

[4]

Atallah, M. J., Frederickson, G. N., and Kosaraju, S. R. 1988. Sorting with efficient use of special-purpose sorters. Inf. Process. Lett. 27, 1, 13--15.

Digital Library

[5]

Beigel, R. and Gill, J. 1990. Sorting n objects with a k-sorter. IEEE Trans. Comput. 39, 714--716.

Digital Library

[6]

Ben-David, A., Nisan, N., and Pinkas, B. 2008. FairplayMP: A system for secure multi-party computation. In Proceedings of the 15th ACM Conference on Computer and Communications Security (CCS’08). ACM, New York, 257--266.

Digital Library

[7]

Blackston, D. T. and Ranade, A. 1993. Snakesort: A family of simple optimal randomized sorting algorithms. In Proceedings of the International Conference on Parallel Processing (ICPP’93). IEEE Computer Society, Los Alamitos, CA, 201--204.

Digital Library

[8]

Braverman, M. and Mossel, E. 2008. Noisy sorting without resampling. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA’08). SIAM, Philadelphia, PA, 268--276.

Digital Library

[9]

Brejová, B. 2001. Analyzing variants of Shellsort. Inf. Proc. Lett. 79, 5, 223--227.

Digital Library

[10]

Canetti, R., Lindell, Y., Ostrovsky, R., and Sahai, A. 2002. Universally composable two-party and multi-party secure computation. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC’02). ACM, New York, 494--503.

Digital Library

[11]

Cole, R. 1988. Parallel merge sort. SIAM J. Comput. 17, 4, 770--785.

Digital Library

[12]

Cormen, T. H., Leiserson, C. E., Rivest, R. L., and Stein, C. 2001. Introduction to Algorithms 2nd Ed. MIT Press, Cambridge, MA.

Digital Library

[13]

Cypher, R. 1993. A lower bound on the size of Shellsort sorting networks. SIAM J. Comput. 22, 1, 62--71.

Digital Library

[14]

Dobosiewicz, W. 1980. An efficient variation of bubble sort. Inf. Process. Lett. 11, 1, 5--6.

[15]

Du, W. and Atallah, M. J. 2001. Secure multi-party computation problems and their applications: A review and open problems. In Proceedings of the Workshop on New Security Paradigms (NSPW’01). ACM, New York, 13--22.

Digital Library

[16]

Du, W. and Zhan, Z. 2002. A practical approach to solve secure multi-party computation problems. In Proceedings of the Workshop on New Security Paradigms (NSPW’02). ACM, New York, 127--135.

Digital Library

[17]

Feige, U., Raghavan, P., Peleg, D., and Upfal, E. 1994. Computing with noisy information. SIAM J. Comput. 23, 5, 1001--1018.

Digital Library

[18]

Franceschini, G., Muthukrishnan, S., and Pătraşcu, M. 2007. Radix sorting with no extra space. In Proceedings of the European Symposium on Algorithms (ESA). 194--205.

Digital Library

[19]

Goodrich, M. T. 2009. The mastermind attack on genomic data. In Proceedings of the IEEE Symposium on Security and Privacy. IEEE, 204--218.

Digital Library

[20]

Goodrich, M. T. and Kosaraju, S. R. 1996. Sorting on a parallel pointer machine with applications to set expression evaluation. J. ACM 43, 2, 331--361.

Digital Library

[21]

Goodrich, M. T. and Tamassia, R. 2002. Algorithm Design: Foundations, Analysis, and Internet Examples. Wiley, New York.

Digital Library

[22]

Hoeffding, W. 1963. Probability inequalities for sums of bounded random variables. J. AMS Statistical Association 58, 301, 13--30.

[23]

Incerpi, J. and Sedgewick, R. 1985. Improved upper bounds on Shellsort. J. Comput. Syst. Sci. 31, 2, 210--224.

Digital Library

[24]

Incerpi, J. and Sedgewick, R. 1987. Practical variations of Shellsort. Inf. Process. Lett. 26, 1, 37--43.

Digital Library

[25]

Jiang, T., Li, M., and Vitányi, P. 2000. A lower bound on the average-case complexity of Shellsort. J. ACM 47, 5, 905--911.

Digital Library

[26]

Knuth, D. E. 1973. Sorting and Searching. The Art of Computer Programming, vol. 3. Addison-Wesley, Reading, MA.

Digital Library

[27]

Leighton, F. T. 1992. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan-Kaufmann, San Francisco, CA.

Digital Library

[28]

Leighton, T. 1985. Tight bounds on the complexity of parallel sorting. IEEE Trans. Comput. 34, 4, 344--354.

Digital Library

[29]

Leighton, T. and Plaxton, C. G. 1998. Hypercubic sorting networks. SIAM J. Comput. 27, 1, 1--47.

Digital Library

[30]

Maggs, B. M. and Vöcking, B. 2000. Improved routing and sorting on multibutterflies. Algorithmica 28, 4, 438--437.

Digital Library

[31]

Malkhi, D., Nisan, N., Pinkas, B., and Sella, Y. 2004. Fairplay---A secure two-party computation system. In Proceedings of the 13th Conference on USENIX Security Symposium (SSYM’04). USENIX Association, Berkeley, CA, 20--20.

Digital Library

[32]

Maurer, U. 2006. Secure multi-party computation made simple. Disc. Appl. Math. 154, 2, 370--381.

Digital Library

[33]

McGeoch, C., Sanders, P., Fleischer, R., Cohen, P. R., and Precup, D. 2002. Using finite experiments to study asymptotic performance. In Experimental algorithmics: From Algorithm Design to Robust and Efficient Software. Springer-Verlag, Berlin, Germany, 93--126.

Digital Library

[34]

Mitzenmacher, M. and Upfal, E. 2005. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, Cambridge, UK.

Digital Library

[35]

Motwani, R. and Raghavan, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, UK.

Digital Library

[36]

Paterson, M. 1990. Improved sorting networks with O(log N) depth. Algorithmica 5, 1, 75--92.

[37]

Plaxton, C. G. and Suel, T. 1997. Lower bounds for Shellsort. J. Algorithms 23, 2, 221--240.

Digital Library

[38]

Pratt, V. R. 1972. Shellsort and sorting networks. Ph.D. thesis, Stanford University, Palo Alto, CA.

Digital Library

[39]

Rajasekaran, S. and Sen, S. 2005. PDM sorting algorithms that take a small number of passes. In Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS’05) (Papers). IEEE Computer Society, Los Alamitos, CA, 10.

Digital Library

[40]

Reif, J. H. 1985. An optimal parallel algorithm for integer sorting. In Proceedings of the 26th Annual Symposium on Foundations of Computer Science (SFCS’85). IEEE Computer Society, Los Alamitos, CA, 496--504.

Digital Library

[41]

Sanders, P. and Fleischer, R. 2001. Asymptotic complexity from experiments? A case study for randomized algorithms. In Proceedings of the 4th International Workshop on Algorithm Engineering (WAE’00). Springer-Verlag, Berlin, Germany, 135--146.

Digital Library

[42]

Scherson, I. D. and Sen, S. 1989. Parallel sorting in two-dimensional VLSI models of computation. IEEE Trans. Comput. 38, 2, 238--249.

Digital Library

[43]

Sedgewick, R. 1992. Algorithms in C++. Addison-Wesley, Reading, MA.

Digital Library

[44]

Sedgewick, R. 1996. Analysis of Shellsort and related algorithms. In Proceedings of the 4th Annual European Symposium on Algorithms (ESA’96). Springer-Verlag, Berlin, Germany, 1--11.

Digital Library

[45]

Seiferas, J. 2009. Sorting networks of logarithmic depth, further simplified. Algorithmica 53, 3, 374--384.

Digital Library

[46]

Shavit, N., Upfal, E., and Zemach, A. 1997. A wait-free sorting algorithm. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC). ACM, 121--128.

Digital Library

[47]

Shell, D. L. 1959. A high-speed sorting procedure. Comm. ACM 2, 7, 30--32.

Digital Library

[48]

Weiss, M. A. and Sedgewick, R. 1988. Bad cases for shaker-sort. Inf. Proc. Lett. 28, 3, 133--136.

Digital Library

Cited By

Kim SSon YPaek JCho SLee H(2024)A Survey of Blind Sorting Techniques: Approaches Using Fully Homomorphic Encryption2024 15th International Conference on Information and Communication Technology Convergence (ICTC)10.1109/ICTC62082.2024.10827130(480-485)Online publication date: 16-Oct-2024
https://doi.org/10.1109/ICTC62082.2024.10827130
Kudelić RIvković NŠmaguc T(2023)A Brief Overview of Randomized AlgorithmsIOT with Smart Systems10.1007/978-981-99-3761-5_57(651-667)Online publication date: 31-Aug-2023
https://doi.org/10.1007/978-981-99-3761-5_57
Yan PPotanin A(2022)Proving Obliviousness of Probabilistic Algorithms with Formal VerificationCompanion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity10.1145/3563768.3565547(25-28)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3563768.3565547
Show More Cited By

Index Terms

Randomized Shellsort: A Simple Data-Oblivious Sorting Algorithm
1. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Randomized Shellsort: a simple oblivious sorting algorithm
SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms

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 ...
Work-Time Optimal k-Merge Algorithms on the PRAM

For 2 k n, the k-merge problem is to merge a collection of k sorted sequences of total length n into a new sorted sequence. The k-merge problem is fundamental as it provides a common generalization of both merging and sorting. The main contribution of ...
Equivalence between priority queues and sorting

We present a general deterministic linear space reduction from priority queues to sorting implying that if we can sort up to n keys in S(n) time per key, then there is a priority queue supporting delete and insert in O(S(n)) time and find-min in ...

Comments

Information & Contributors

Information

Published In

cover image Journal of the ACM

Journal of the ACM Volume 58, Issue 6

December 2011

209 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/2049697

Issue’s Table of Contents

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2011

Accepted: 01 August 2011

Revised: 01 June 2011

Received: 01 January 2010

Published in JACM Volume 58, Issue 6

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
1,255
Total Downloads

Downloads (Last 12 months)49
Downloads (Last 6 weeks)3

Reflects downloads up to 29 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kim SSon YPaek JCho SLee H(2024)A Survey of Blind Sorting Techniques: Approaches Using Fully Homomorphic Encryption2024 15th International Conference on Information and Communication Technology Convergence (ICTC)10.1109/ICTC62082.2024.10827130(480-485)Online publication date: 16-Oct-2024
https://doi.org/10.1109/ICTC62082.2024.10827130
Kudelić RIvković NŠmaguc T(2023)A Brief Overview of Randomized AlgorithmsIOT with Smart Systems10.1007/978-981-99-3761-5_57(651-667)Online publication date: 31-Aug-2023
https://doi.org/10.1007/978-981-99-3761-5_57
Yan PPotanin A(2022)Proving Obliviousness of Probabilistic Algorithms with Formal VerificationCompanion Proceedings of the 2022 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity10.1145/3563768.3565547(25-28)Online publication date: 29-Nov-2022
https://dl.acm.org/doi/10.1145/3563768.3565547
Haga RToyoda KShinoda YMiyahara DShinagawa KHayashi YMizuki T(2022)Card-Based Secure Sorting ProtocolAdvances in Information and Computer Security10.1007/978-3-031-15255-9_12(224-240)Online publication date: 31-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-15255-9_12
Araki TFurukawa JOhara KPinkas BRosemarin HTsuchida HKim YKim JVigna GShi E(2021)Secure Graph Analysis at ScaleProceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security10.1145/3460120.3484560(610-629)Online publication date: 12-Nov-2021
https://dl.acm.org/doi/10.1145/3460120.3484560
Lee JKim YNo J(2021)Analysis of Modified Shell Sort for Fully Homomorphic EncryptionIEEE Access10.1109/ACCESS.2021.31108689(126198-126215)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3110868
Chakraborti ASion R(2020)SqORAM: Read-Optimized Sequential Write-Only Oblivious RAMProceedings on Privacy Enhancing Technologies10.2478/popets-2020-00122020:1(216-234)Online publication date: 7-Jan-2020
https://doi.org/10.2478/popets-2020-0012
Eskandarian SZaharia M(2019)ObliDBProceedings of the VLDB Endowment10.14778/3364324.336433113:2(169-183)Online publication date: 1-Oct-2019
https://dl.acm.org/doi/10.14778/3364324.3364331
Bahig H(2019)Complexity analysis and performance of double hashing sort algorithmJournal of the Egyptian Mathematical Society10.1186/s42787-019-0004-227:1Online publication date: 4-Apr-2019
https://doi.org/10.1186/s42787-019-0004-2
Aly AVan Vyve M(2017)Practically Efficient Secure Single-Commodity Multi-market AuctionsFinancial Cryptography and Data Security10.1007/978-3-662-54970-4_7(110-129)Online publication date: 17-May-2017
https://doi.org/10.1007/978-3-662-54970-4_7
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents