Paper 2013/824
Fair and Efficient Secure Multiparty Computation with Reputation Systems
Gilad Asharov, Yehuda Lindell, and Hila Zarosim
Abstract
A reputation system for a set of entities is essentially a list of scores that provides a measure of the reliability of each entity in the set. The score given to an entity can be interpreted (and in the reputation system literature it often is~\cite{FRS}) as the probability that an entity will behave honestly. In this paper, we ask whether or not it is possible to utilize reputation systems for carrying out secure multiparty computation. We provide formal definitions of secure computation in this setting, and carry out a theoretical study of feasibility. We present almost tight results showing when it is and is not possible to achieve \emph{fair} secure computation in our model. We suggest applications for our model in settings where some information about the honesty of other parties is given. This can be preferable to the current situation where either an honest majority is arbitrarily assumed, or a protocol that is secure for a dishonest majority is used and the efficiency and security guarantees (including fairness) of an honest majority are not obtained.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in ASIACRYPT 2013
- DOI
- 10.1007/978-3-642-42045-0_11
- Keywords
- secure multiparty computationreputation systemsnew models
- Contact author(s)
- asharog @ cs biu ac il
- History
- 2013-12-06: received
- Short URL
- https://ia.cr/2013/824
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/824,
author = {Gilad Asharov and Yehuda Lindell and Hila Zarosim},
title = {Fair and Efficient Secure Multiparty Computation with Reputation Systems},
howpublished = {Cryptology {ePrint} Archive, Paper 2013/824},
year = {2013},
doi = {10.1007/978-3-642-42045-0_11},
url = {https://eprint.iacr.org/2013/824}
}
