Paper 2014/209
A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation
Juan A. Garay, Ran Gelles, David S. Johnson, Aggelos Kiayias, and Moti Yung
Abstract
Secure multiparty computation (MPC) as a service is becoming a tangible reality. In such a service, a population of clients wish to utilize a set of servers to delegate privately and reliably a given computation on their inputs. MPC protocols have a number of desired properties including tolerating active misbehavior by some of the servers and guaranteed output delivery. A fundamental result is that in order to achieve the above, an honest majority among servers is necessary. There are settings, however, where this condition might be
overly restrictive, making it important to investigate models where this impossibility result can be circumvented, allowing secure computation to be performed even when the number of malicious participants outweighs the number of honest participants.
To this end, we introduce the two-tier model for MPC, where a set of
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- anonymityMPCadaptive securitydishonest majoritytwo-tier model
- Contact author(s)
- gelles @ cs ucla edu
- History
- 2014-03-22: received
- Short URL
- https://ia.cr/2014/209
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/209, author = {Juan A. Garay and Ran Gelles and David S. Johnson and Aggelos Kiayias and Moti Yung}, title = {A Little Honesty Goes a Long Way: The Two-Tier Model for Secure Multiparty Computation}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/209}, year = {2014}, url = {https://eprint.iacr.org/2014/209} }