Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters

Gilad Asharov; Koki Hamada; Dai Ikarashi; Ryo Kikuchi; Ariel Nof; Benny Pinkas; Katsumi Takahashi; Junichi Tomida

doi:10.1145/3548606.3560691

Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters

Gilad Asharov
, Koki Hamada
, Dai Ikarashi
, Ryo Kikuchi
, Ariel Nof
, Benny Pinkas
, Katsumi Takahashi
, Junichi Tomida

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

29 Scopus citations

Abstract

We present a three-party sorting protocol secure against passive and active adversaries in the honest majority setting. The protocol can be easily combined with other secure protocols which work on shared data, and thus enable different data analysis tasks, such as private set intersection of shared data, deduplication, and the identification of heavy hitters. The new protocol computes a stable sort. It is based on radix sort and is asymptotically better than previous secure sorting protocols. It improves on previous radix sort protocols by not having to shuffle the entire length of the items after each comparison step. We implemented our sorting protocol with different optimizations and achieved concretely fast performance. For example, sorting one million items with 32-bit keys and 32-bit values takes less than 2 seconds with semi-honest security and about 3.5 seconds with malicious security. Finding the heavy hitters among hundreds of thousands of 256-bit values takes only a few seconds, compared to close to an hour in previous work.

Original language	English
Title of host publication	CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
Publisher	Association for Computing Machinery
Pages	125-138
Number of pages	14
ISBN (Electronic)	9781450394505
DOIs	https://doi.org/10.1145/3548606.3560691
State	Published - 7 Nov 2022
Event	28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022 - Hybrid, Los Angeles, United States Duration: 7 Nov 2022 → 11 Nov 2022

Publication series

Name	Proceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)	1543-7221

Conference

Conference	28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022
Country/Territory	United States
City	Hybrid, Los Angeles
Period	7/11/22 → 11/11/22

Bibliographical note

Publisher Copyright:
© 2022 ACM.

Funding

Sponsored in part by the Israel Science Foundation (grant No. 2439/20), by JPM Faculty Research Award, by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office, and by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 891234.

Funders	Funder number
JPMorgan Chase and Company
Horizon 2020 Framework Programme
H2020 Marie Skłodowska-Curie Actions	891234
Israel Science Foundation	2439/20

Keywords

honest majority
secure computation
sorting

Access to Document

10.1145/3548606.3560691

Cite this

Asharov, G., Hamada, K., Ikarashi, D., Kikuchi, R., Nof, A., Pinkas, B., Takahashi, K., & Tomida, J. (2022). Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. In CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 125-138). (Proceedings of the ACM Conference on Computer and Communications Security). Association for Computing Machinery. https://doi.org/10.1145/3548606.3560691

Asharov, Gilad ; Hamada, Koki ; Ikarashi, Dai et al. / Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, 2022. pp. 125-138 (Proceedings of the ACM Conference on Computer and Communications Security).

@inproceedings{611167d33fff4ce3929809b59d8bda92,

title = "Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters",

abstract = "We present a three-party sorting protocol secure against passive and active adversaries in the honest majority setting. The protocol can be easily combined with other secure protocols which work on shared data, and thus enable different data analysis tasks, such as private set intersection of shared data, deduplication, and the identification of heavy hitters. The new protocol computes a stable sort. It is based on radix sort and is asymptotically better than previous secure sorting protocols. It improves on previous radix sort protocols by not having to shuffle the entire length of the items after each comparison step. We implemented our sorting protocol with different optimizations and achieved concretely fast performance. For example, sorting one million items with 32-bit keys and 32-bit values takes less than 2 seconds with semi-honest security and about 3.5 seconds with malicious security. Finding the heavy hitters among hundreds of thousands of 256-bit values takes only a few seconds, compared to close to an hour in previous work.",

keywords = "honest majority, secure computation, sorting",

author = "Gilad Asharov and Koki Hamada and Dai Ikarashi and Ryo Kikuchi and Ariel Nof and Benny Pinkas and Katsumi Takahashi and Junichi Tomida",

note = "Publisher Copyright: {\textcopyright} 2022 ACM.; 28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022 ; Conference date: 07-11-2022 Through 11-11-2022",

year = "2022",

month = nov,

day = "7",

doi = "10.1145/3548606.3560691",

language = "אנגלית",

series = "Proceedings of the ACM Conference on Computer and Communications Security",

publisher = "Association for Computing Machinery",

pages = "125--138",

booktitle = "CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security",

}

Asharov, G, Hamada, K, Ikarashi, D, Kikuchi, R, Nof, A , Pinkas, B, Takahashi, K & Tomida, J 2022, Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. in CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. Proceedings of the ACM Conference on Computer and Communications Security, Association for Computing Machinery, pp. 125-138, 28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Hybrid, Los Angeles, United States, 7/11/22. https://doi.org/10.1145/3548606.3560691

Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. / Asharov, Gilad; Hamada, Koki; Ikarashi, Dai et al.
CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery, 2022. p. 125-138 (Proceedings of the ACM Conference on Computer and Communications Security).

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

TY - GEN

T1 - Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters

AU - Asharov, Gilad

AU - Hamada, Koki

AU - Ikarashi, Dai

AU - Kikuchi, Ryo

AU - Nof, Ariel

AU - Pinkas, Benny

AU - Takahashi, Katsumi

AU - Tomida, Junichi

PY - 2022/11/7

Y1 - 2022/11/7

N2 - We present a three-party sorting protocol secure against passive and active adversaries in the honest majority setting. The protocol can be easily combined with other secure protocols which work on shared data, and thus enable different data analysis tasks, such as private set intersection of shared data, deduplication, and the identification of heavy hitters. The new protocol computes a stable sort. It is based on radix sort and is asymptotically better than previous secure sorting protocols. It improves on previous radix sort protocols by not having to shuffle the entire length of the items after each comparison step. We implemented our sorting protocol with different optimizations and achieved concretely fast performance. For example, sorting one million items with 32-bit keys and 32-bit values takes less than 2 seconds with semi-honest security and about 3.5 seconds with malicious security. Finding the heavy hitters among hundreds of thousands of 256-bit values takes only a few seconds, compared to close to an hour in previous work.

AB - We present a three-party sorting protocol secure against passive and active adversaries in the honest majority setting. The protocol can be easily combined with other secure protocols which work on shared data, and thus enable different data analysis tasks, such as private set intersection of shared data, deduplication, and the identification of heavy hitters. The new protocol computes a stable sort. It is based on radix sort and is asymptotically better than previous secure sorting protocols. It improves on previous radix sort protocols by not having to shuffle the entire length of the items after each comparison step. We implemented our sorting protocol with different optimizations and achieved concretely fast performance. For example, sorting one million items with 32-bit keys and 32-bit values takes less than 2 seconds with semi-honest security and about 3.5 seconds with malicious security. Finding the heavy hitters among hundreds of thousands of 256-bit values takes only a few seconds, compared to close to an hour in previous work.

KW - honest majority

KW - secure computation

KW - sorting

UR - https://www.scopus.com/pages/publications/85143051277

U2 - 10.1145/3548606.3560691

DO - 10.1145/3548606.3560691

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

AN - SCOPUS:85143051277

T3 - Proceedings of the ACM Conference on Computer and Communications Security

SP - 125

EP - 138

BT - CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security

PB - Association for Computing Machinery

T2 - 28th ACM SIGSAC Conference on Computer and Communications Security, CCS 2022

Y2 - 7 November 2022 through 11 November 2022

ER -

Asharov G, Hamada K, Ikarashi D, Kikuchi R, Nof A , Pinkas B et al. Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters. In CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security. Association for Computing Machinery. 2022. p. 125-138. (Proceedings of the ACM Conference on Computer and Communications Security). doi: 10.1145/3548606.3560691

Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy Hitters

Abstract

Publication series

Conference

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this