Secure Sorting and Selection via Function Secret Sharing
Name
3658644.3690359.pdf
Size
1.16 MB
Format
Adobe PDF
Checksum (MD5)
79bf74a6ce514109e5e09e1cfcaed386
Author(s)
Agarwal, Amit
Boyle, Elette
Chandran, Nishanth
Gilboa, Niv
Gupta, Divya
Ishai, Yuval
Kelkar, Mahimna
Ma, Yiping
Date Issued
December 2, 2024
Publisher
ACM|Proceedings of the 2024 ACM SIGSAC Conference on Computer and Communications Security
Citation
Agarwal, Amit, Boyle, Elette, Chandran, Nishanth, Gilboa, Niv, Gupta, Divya et al. 2024. "Secure Sorting and Selection via Function Secret Sharing."
Version
Final published version
Abstract
We revisit the problem of concretely efficient secure computation of sorting and selection (e.g., maximum, median, or top-k) on secret-shared data, focusing on the case of security against a single semi-honest party. Previous solutions either have a high communication overhead or many rounds of interaction, even when allowing input-independent preprocessing.
We propose a suite of 2-party and 3-party offline-online protocols that exploit the efficient aggregation feature of function secret sharing to minimize the online communication and rounds. In particular, most of our protocols are optimal in terms of both online communication and online rounds up to small constant factors.
We compare the performance of our protocols with prior works for different input parameters (number of items, bit length of items, batch size) and system parameters (CPU cores, network) and obtain up to 14x improvement in online run time for sorting and selection under some settings.
Description
CCS ’24, October 14–18, 2024, Salt Lake City, UT, USA
Terms of Use
Creative Commons Attribution
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3658644.3690359
