Paper 2022/574 Original: eprint.iacr.org/2022/574 ↗

Comparison-Based MPC in Star Topology (Full Version)

Gowri R Chandran
Carmit Hazay
Robin Hundt
Thomas Schneider
Abstract

With the large amount of data generated nowadays, analysis of this data has become eminent. Since a vast amount of this data is private, it is also important that the analysis is done in a secure manner. Comparison-based functions are commonly used in data analysis. These functions use the comparison operation as the basis. Secure computation of such functions have been discussed for median by Aggarwal et al. (EUROCRYPT'04) and for convex hull by Shelat and Venkitasubramaniam (ASIACRYPT'15). In this paper, we present a generic protocol for the secure computation of comparison-based functions. In order to scale to a large number of participants, we propose this protocol in a star topology with an aim to reduce the communication complexity. We also present a protocol for one specific comparison-based function, the $k^{th}$ ranked element. The construction of one of our protocols leaks some intermediate values but does not reveal information about an individual party's inputs. We demonstrate that our protocol offers better performance than the protocol for $k^{th}$ ranked element by Tueno et. al. (FC'20) by providing an implementation.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2022-05-16: last updated
2022-05-16: published
Short URL
https://ia.cr/2022/574
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2022/574,
      author = {Gowri R Chandran and Carmit Hazay and Robin Hundt and Thomas Schneider},
      title = {Comparison-Based MPC in Star Topology (Full Version)},
      howpublished = {Cryptology {ePrint} Archive, Paper 2022/574},
      year = {2022},
      url = {https://eprint.iacr.org/2022/574}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.