Cryptology ePrint Archive: Report 2013/824

Fair and Efficient Secure Multiparty Computation with Reputation Systems

Gilad Asharov and 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.

Category / Keywords: cryptographic protocols / secure multiparty computation, reputation systems, new models

Original Publication (in the same form): IACR-ASIACRYPT-2013
DOI:
10.1007/978-3-642-42045-0_11

Date: received 5 Dec 2013

Contact author: asharog at cs biu ac il

Available format(s): PDF | BibTeX Citation

Version: 20131206:203332 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]