skip to main content
10.1145/2935764.2935778acmconferencesArticle/Chapter ViewAbstractPublication PagesspaaConference Proceedingsconference-collections
research-article

Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis

Published: 11 July 2016 Publication History

Abstract

We study parallel comparison-based algorithms for finding all equivalence classes of a set of $n$ elements, where sorting according to some total order is not possible. Such scenarios arise, for example, in applications, such as in distributed computer security, where each of n agents are working to identify the private group to which they belong, with the only operation available to them being a zero-knowledge pairwise-comparison (which is sometimes called a "secret handshake") that reveals only whether two agents are in the same group or in different groups. We provide new parallel algorithms for this problem, as well as new lower bounds and distribution-based analysis.

References

[1]
L. Alonso and E. M. Reingold. Analysis of Boyer and Moore's MJRTY algorithm. Information Processing Letters, 113(13):495--497, 2013.
[2]
L. Alonso, E. M. Reingold, and R. Schott. Determining the majority. Information Processing Letters, 47(5):253 -- 255, 1993.
[3]
L. Babai, P. Erdos, and S. M. Selkow. Random graph isomorphism. SIAM Journal on Computing, 9(3):628--635, 1980.
[4]
R. Beigel, W. Hurwood, and N. Kahale. Fault diagnosis in a ash. In 36th IEEE Symp. on Foundations of Computer Science (FOCS), pages 571--580, 1995.
[5]
R. Beigel, S. R. Kosaraju, and G. F. Sullivan. Locating faults in a constant number of parallel testing rounds. In 1st ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 189--198, 1989.
[6]
R. Beigel, G. Margulis, and D. A. Spielman. Fault diagnosis in a small constant number of parallel testing rounds. In 5th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 21--29, 1993.
[7]
C. Castelluccia, S. Jarecki, and G. Tsudik. Secret handshakes from CA-oblivious encryption. In P. J. Lee, editor, Advances in Cryptology - ASIACRYPT, pages 293--307. Springer, 2004.
[8]
J. Clausen, D. D. Keck, W. M. Hiesey, P. Grun, et al. Experimental taxonomy. Carnegie Institution of Washington. Yearbook No. 48: 1948-1949, pages 95--103, 1947.
[9]
D. J. Cook and L. B. Holder. Mining Graph Data. John Wiley & Sons, 2006.
[10]
D. Dobkin and J. I. Munro. Determining the mode. Theoretical Computer Science, 12(3):255--263, 1980.
[11]
M. T. Goodrich. Pipelined algorithms to detect cheating in long-term grid computations. Theoretical Computer Science, 408(2--3):199--207, 2008.
[12]
J. W. Gregor. Experimental taxonomy. New Phytologist, 38(4):293--322, 1939.
[13]
J. B. Hagen. Experimentalists and naturalists in twentieth-century botany: Experimental taxonomy, 1920--1950. Journal of the History of Biology, 17(2):249--270, 1984.
[14]
S. Jarecki and X. Liu. Unlinkable secret handshakes and key-private group key management schemes. In J. Katz and M. Yung, editors, 5th Int. Conf. on Applied Cryptography and Network Security (ACNS), pages 270--287. Springer, 2007.
[15]
V. Jayapaul, J. I. Munro, V. Raman, and S. R. Satti. Sorting and selection with equality comparisons. In F. Dehne, J.-R. Sack, and U. Stege, editors, 14th Int. Symp. on Algorithms and Data Structures (WADS), pages 434--445. Springer, 2015.
[16]
L. Kozma. Useful inequalities cheat sheet, 2016. http://www.lkozma.net/inequalitiescheatsheet/.
[17]
M. Mitzenmacher and E. Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2005.
[18]
H. Orman. The Morris worm: A fteen-year perspective. IEEE Security & Privacy, 1(5):35--43, 2003.
[19]
S. Parthasarathy, S. Tatikonda, and D. Ucar. A survey of graph mining techniques for biological datasets. In C. C. Aggarwal and H. Wang, editors, Managing and Mining Graph Data, pages 547--580. Springer, 2010.
[20]
A. Pelc and E. Upfal. Reliable fault diagnosis with few tests. Combinatorics, Probability and Computing, 7:323--333, 1998.
[21]
F. P. Preparata, G. Metze, and R. T. Chien. On the connection assignment problem of diagnosable systems. IEEE Trans. on Electronic Computers, EC-16(6):848--854, 1967.
[22]
M. E. Saks and M. Werman. On computing majority by comparisons. Combinatorica, 11(4):383--387, 1991.
[23]
A. Sorniotti and R. Molva. A provably secure secret handshake with dynamic controlled matching. Computers & Security, 29(5):619--627, 2010.
[24]
L. G. Valiant. Parallelism in comparison problems. SIAM Journal on Computing, 4(3):348--355, 1975.
[25]
S. Xu and M. Yung. K-anonymous secret handshakes with reusable credentials. In 11th ACM Conf. on Computer and Communications Security (CCS), pages 158--167, 2004.

Index Terms

  1. Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      SPAA '16: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
      July 2016
      492 pages
      ISBN:9781450342100
      DOI:10.1145/2935764
      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 the author(s) 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].

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 11 July 2016

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. equality comparisons
      2. equivalence class sorting
      3. sorting and selection

      Qualifiers

      • Research-article

      Funding Sources

      • NSF
      • NSF GRF

      Conference

      SPAA '16

      Acceptance Rates

      Overall Acceptance Rate 447 of 1,461 submissions, 31%

      Upcoming Conference

      SPAA '25
      37th ACM Symposium on Parallelism in Algorithms and Architectures
      July 28 - August 1, 2025
      Portland , OR , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 97
        Total Downloads
      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 17 Feb 2025

      Other Metrics

      Citations

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media