TY - GEN
T1 - Comparison-based MPC in Star Topology
AU - Chandran, Gowri R.
AU - Hazay, Carmit
AU - Hundt, Robin
AU - Schneider, Thomas
N1 - Publisher Copyright: © 2021 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.
PY - 2022
Y1 - 2022
N2 - 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 kt h 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 kt h ranked element by Tueno et. al. (FC’20) by providing an implementation.
AB - 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 kt h 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 kt h ranked element by Tueno et. al. (FC’20) by providing an implementation.
KW - K Ranked Element
KW - Optimisation Problems
KW - Scheduling Problems
KW - Secure Multi-party Computation
UR - http://www.scopus.com/inward/record.url?scp=85178504092&partnerID=8YFLogxK
U2 - https://doi.org/10.5220/0011144100003283
DO - https://doi.org/10.5220/0011144100003283
M3 - منشور من مؤتمر
SN - 9789897585906
T3 - Proceedings of the International Conference on Security and Cryptography
SP - 69
EP - 82
BT - SECRYPT 2022 - Proceedings of the 19th International Conference on Security and Cryptography
A2 - De Capitani di Vimercati, Sabrina
A2 - Samarati, Pierangela
T2 - 19th International Conference on Security and Cryptography, SECRYPT 2022
Y2 - 11 July 2022 through 13 July 2022
ER -