In this chapter we describe the construction of Aggarwal et al.  for securely computing the kth-ranked element of the union of two distributed and sorted data sets in the presence of semi-honest and malicious adversaries. An important special case of this problem is that of securely computing the median. The construction of  is based on the iterative protocol of  for computing the kth-ranked element with low communication complexity. The secure implementation of this fundamental problem has been looked at by researchers in the last few years, mostly due to its potential applications. One particular setting is where the data sets contain sensitive data, yet the particular kth element is of mutual interest. For instance, two health insurance companies may wish to compute the median life expectancy of their insured smokers, or two companies may wish to compute the median salary of their employees. By running secure protocols for these tasks, sensitive information is not unnecessarily revealed.
|Title of host publication||Information Security and Cryptography|
|Publisher||Springer International Publishing|
|Number of pages||14|
|State||Published - 2010|
|Name||Information Security and Cryptography|
Bibliographical notePublisher Copyright:
© 2010, Springer-Verlag Berlin Heidelberg.