Paper 2014/105 Original: eprint.iacr.org/2014/105 ↗
Reducing the Overhead of MPC over a Large Population
Abstract
We present a secure honest majority MPC protocol, against a static adversary, which aims to reduce the communication cost in the situation where there are a large number of parties and the number of adversarially controlled parties is relatively small. Our goal is to reduce the usage of point-to-point channels among the parties, thus enabling them to run multiple different protocol executions. Our protocol has highly efficient theoretical communication cost when compared with other protocols in the literature; specifically the circuit-dependent communication cost, for circuits of suitably large depth, is $\Order(|\Circuit|\kappa^7)$, for security parameter $\kappa$~and circuit size $|\Circuit|$. Our protocol finds application in cloud computing scenario, where the fraction of corrupted parties is relatively small. By minimizing the usage of point-to-point channels, our protocol can enable a cloud service provider to run multiple MPC protocols.
Metadata
- Available format(s)
PDF- Category
- Cryptographic protocols
- Publication info
- Preprint.
- History
- 2014-07-01: last updated
- 2014-02-14: published
- Short URL
- https://ia.cr/2014/105
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/105,
author = {Ashish Choudhury and Arpita Patra and Nigel P. Smart},
title = {Reducing the Overhead of MPC over a Large Population},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/105},
year = {2014},
url = {https://eprint.iacr.org/2014/105}
}