Paper 2024/1152
Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness
Abstract
Bottleneck complexity is an efficiency measure of secure multiparty computation (MPC) protocols introduced to achieve load-balancing in large-scale networks, which is defined as the maximum communication complexity required by any one player within the protocol execution. Towards the goal of achieving low bottleneck complexity, prior works proposed MPC protocols for computing symmetric functions in the correlated randomness model, where players are given input-independent correlated randomness in advance. However, the previous protocols with polylogarithmic bottleneck complexity in the number of players
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Major revision. ITC 2024
- Keywords
- secure multiparty computationinformation-theoretic securitybottleneck complexity
- Contact author(s)
- eriguchi-reo @ aist go jp
- History
- 2024-07-19: approved
- 2024-07-16: received
- See all versions
- Short URL
- https://ia.cr/2024/1152
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/1152, author = {Reo Eriguchi}, title = {Secure Multiparty Computation of Symmetric Functions with Polylogarithmic Bottleneck Complexity and Correlated Randomness}, howpublished = {Cryptology {ePrint} Archive, Paper 2024/1152}, year = {2024}, url = {https://eprint.iacr.org/2024/1152} }