Paper 2014/615
The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults
Nishanth Chandran, Wutichai Chongchitmate, Juan A. Garay, Shafi Goldwasser, Rafail Ostrovsky, and Vassilis Zikas
Abstract
Secure multi-party computation (MPC) has been thoroughly studied over the past decades. The vast majority of works assume a full communication pattern: every party exchanges messages with {\em all} the network participants over a complete network of point-to-point channels. This can be problematic in modern large scale networks, where the number of parties can be of the order of millions, as for example when computing on large distributed data.
Motivated by the above observation, Boyle, Goldwasser, and Tessaro [TCC 2013] recently put forward the notion of {\em communication locality}, namely, the total number of point-to-point channels that each party uses in the protocol, as a quality metric of MPC protocols. They proved that assuming a public-key infrastructure (PKI) and a common reference string (CRS), an MPC protocol can be constructed for computing any
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Minor revision. ITCS 2015
- Keywords
- secure multi-party computationcommunication localityadaptive security
- Contact author(s)
- vassilis zikas @ gmail com
- History
- 2018-07-06: last of 3 revisions
- 2014-08-13: received
- See all versions
- Short URL
- https://ia.cr/2014/615
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/615, author = {Nishanth Chandran and Wutichai Chongchitmate and Juan A. Garay and Shafi Goldwasser and Rafail Ostrovsky and Vassilis Zikas}, title = {The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/615}, year = {2014}, url = {https://eprint.iacr.org/2014/615} }