Comparison-based MPC in Star Topology

Gowri R. Chandran; Carmit Hazay; Robin Hundt; Thomas Schneider

doi:10.5220/0011144100003283

Comparison-based MPC in Star Topology

Gowri R. Chandran, Carmit Hazay, Robin Hundt, Thomas Schneider

Technische Universität Darmstadt

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

3 Scopus citations

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^{t 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 k^{t h} ranked element by Tueno et. al. (FC’20) by providing an implementation.

Original language	English
Title of host publication	SECRYPT 2022 - Proceedings of the 19th International Conference on Security and Cryptography
Editors	Sabrina De Capitani di Vimercati, Pierangela Samarati
Publisher	Science and Technology Publications, Lda
Pages	69-82
Number of pages	14
ISBN (Print)	9789897585906
DOIs	https://doi.org/10.5220/0011144100003283
State	Published - 2022
Event	19th International Conference on Security and Cryptography, SECRYPT 2022 - Lisbon, Portugal Duration: 11 Jul 2022 → 13 Jul 2022

Publication series

Name	Proceedings of the International Conference on Security and Cryptography
Volume	1
ISSN (Print)	2184-7711

Conference

Conference	19th International Conference on Security and Cryptography, SECRYPT 2022
Country/Territory	Portugal
City	Lisbon
Period	11/07/22 → 13/07/22

Bibliographical note

Publisher Copyright:
© 2021 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.

Funding

This project was also supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cy-ber Bureau in the Prime Minister’s Office, and by ISF grant No. 1316/18. This project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement No. 850990 PSOTI). It was co-funded by the Deutsche Forschungsgemeinschaft (DFG) within SFB 1119 CROSSING/236615297 and GRK 2050 Privacy & Trust/251805230, and by the German Federal Ministry of Education and Research and the Hessen State Ministry for Higher Education, Research and the Arts within ATHENE.

Funders	Funder number
Israel National Cy-ber Bureau in the Prime Minister’s Office
Horizon 2020 Framework Programme	850990 PSOTI
European Commission
Deutsche Forschungsgemeinschaft	Trust/251805230, SFB 1119 CROSSING/236615297
Bundesministerium für Bildung und Forschung
Hessisches Ministerium für Wissenschaft und Kunst
Israel Science Foundation	1316/18

Keywords

K Ranked Element
Optimisation Problems
Scheduling Problems
Secure Multi-party Computation

Access to Document

10.5220/0011144100003283License: CC BY-NC-ND

Cite this

Chandran, G. R., Hazay, C., Hundt, R., & Schneider, T. (2022). Comparison-based MPC in Star Topology. In S. De Capitani di Vimercati, & P. Samarati (Eds.), SECRYPT 2022 - Proceedings of the 19th International Conference on Security and Cryptography (pp. 69-82). (Proceedings of the International Conference on Security and Cryptography; Vol. 1). Science and Technology Publications, Lda. https://doi.org/10.5220/0011144100003283

Chandran, Gowri R. ; Hazay, Carmit ; Hundt, Robin et al. / Comparison-based MPC in Star Topology. SECRYPT 2022 - Proceedings of the 19th International Conference on Security and Cryptography. editor / Sabrina De Capitani di Vimercati ; Pierangela Samarati. Science and Technology Publications, Lda, 2022. pp. 69-82 (Proceedings of the International Conference on Security and Cryptography).

@inproceedings{5c6da7c02f3842b8b0c7306af41889f2,

title = "Comparison-based MPC in Star Topology",

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{\textquoteright}04) and for convex hull by Shelat and Venkitasubramaniam (ASIACRYPT{\textquoteright}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{\textquoteright}s inputs. We demonstrate that our protocol offers better performance than the protocol for kt h ranked element by Tueno et. al. (FC{\textquoteright}20) by providing an implementation.",

keywords = "K Ranked Element, Optimisation Problems, Scheduling Problems, Secure Multi-party Computation",

author = "Chandran, {Gowri R.} and Carmit Hazay and Robin Hundt and Thomas Schneider",

note = "Publisher Copyright: {\textcopyright} 2021 by SCITEPRESS – Science and Technology Publications, Lda. All rights reserved.; 19th International Conference on Security and Cryptography, SECRYPT 2022 ; Conference date: 11-07-2022 Through 13-07-2022",

year = "2022",

doi = "10.5220/0011144100003283",

language = "אנגלית",

isbn = "9789897585906",

series = "Proceedings of the International Conference on Security and Cryptography",

publisher = "Science and Technology Publications, Lda",

pages = "69--82",

editor = "{De Capitani di Vimercati}, Sabrina and Pierangela Samarati",

booktitle = "SECRYPT 2022 - Proceedings of the 19th International Conference on Security and Cryptography",

}

Chandran, GR, Hazay, C, Hundt, R & Schneider, T 2022, Comparison-based MPC in Star Topology. in S De Capitani di Vimercati & P Samarati (eds), SECRYPT 2022 - Proceedings of the 19th International Conference on Security and Cryptography. Proceedings of the International Conference on Security and Cryptography, vol. 1, Science and Technology Publications, Lda, pp. 69-82, 19th International Conference on Security and Cryptography, SECRYPT 2022, Lisbon, Portugal, 11/07/22. https://doi.org/10.5220/0011144100003283

Comparison-based MPC in Star Topology. / Chandran, Gowri R.; Hazay, Carmit; Hundt, Robin et al.
SECRYPT 2022 - Proceedings of the 19th International Conference on Security and Cryptography. ed. / Sabrina De Capitani di Vimercati; Pierangela Samarati. Science and Technology Publications, Lda, 2022. p. 69-82 (Proceedings of the International Conference on Security and Cryptography; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Comparison-based MPC in Star Topology

AU - Chandran, Gowri R.

AU - Hazay, Carmit

AU - Hundt, Robin

AU - Schneider, Thomas

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 - 10.5220/0011144100003283

DO - 10.5220/0011144100003283

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

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

PB - Science and Technology Publications, Lda

T2 - 19th International Conference on Security and Cryptography, SECRYPT 2022

Y2 - 11 July 2022 through 13 July 2022

ER -

Chandran GR, Hazay C, Hundt R, Schneider T. Comparison-based MPC in Star Topology. In De Capitani di Vimercati S, Samarati P, editors, SECRYPT 2022 - Proceedings of the 19th International Conference on Security and Cryptography. Science and Technology Publications, Lda. 2022. p. 69-82. (Proceedings of the International Conference on Security and Cryptography). doi: 10.5220/0011144100003283

Comparison-based MPC in Star Topology

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this