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Ā [12]) 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 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.
This research was supported by the European Research Council under the European Unionās Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement n. 239868.
Chapter PDF
Similar content being viewed by others
References
Aumann, Y., Lindell, Y.: Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.Ā 4392, pp. 137ā156. Springer, Heidelberg (2007)
Babaioff, M., Chuang, J., Feldman, M.: Incentives in Peer-to-Peer Systems. In: Algorithmic Game Theory, ch. 23. Cambridge University Press (2007)
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: 20th STOC, pp. 1ā10 (1988)
Bogetoft, P., et al.: Secure Multiparty Computation Goes Live. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol.Ā 5628, pp. 325ā343. Springer, Heidelberg (2009)
Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A Framework for Fast Privacy-Preserving Computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.Ā 5283, pp. 192ā206. Springer, Heidelberg (2008)
Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of CryptologyĀ 13(1), 143ā202 (2000)
Chaum, D., CrĆ©peau, C., DamgĆ„rd, I.: Multi-party Unconditionally Secure Protocols. In: 20th STOC, pp. 11ā19 (1988)
Cleve, R.: Limits on the Security of Coin Flips when Half the Processors are Faulty. In: 18th STOC, pp. 364ā369 (1986)
DamgĆ„rd, I., Geisler, M., Nielsen, J.B.: From Passive to Covert Security at Low Cost. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.Ā 5978, pp. 128ā145. Springer, Heidelberg (2010)
DamgĆ„rd, I., Ishai, Y.: Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.Ā 3621, pp. 378ā394. Springer, Heidelberg (2005)
Dubhashi, D., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms, 1st edn. Cambridge University Press, New York (2009)
Friedman, E., Resnick, P., Sami, R.: Manipulation-Resistant Reputation Systems. In: Algorithmic Game Theory, ch. 27. Cambridge University Press (2007)
Goldreich, O.: Foundations of Cryptography: Volume 1 ā Basic Tools. Cambridge University Press (2001)
Goldreich, O.: Foundations of Cryptography: Volume 2 ā Basic Applications. Cambridge University Press (2004)
Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game ā A Completeness Theorem for Protocols with Honest Majority. In: 19th STOC, pp. 218ā229 (1987), For details see [14]
Goyal, V., Mohassel, P., Smith, A.: Efficient Two Party and Multi Party Computation Against Covert Adversaries. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.Ā 4965, pp. 289ā306. Springer, Heidelberg (2008)
Halevi, S., Lindell, Y., Pinkas, B.: Secure Computation on the Web: Computing without Simultaneous Interaction. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.Ā 6841, pp. 132ā150. Springer, Heidelberg (2011)
Ishai, Y., Katz, J., Kushilevitz, E., Lindell, Y., Petrank, E.: On Achieving the āBest of Both Worldsā in Secure Multiparty Computation. SIAM J. Comput.Ā 40(1), 122ā141 (2011)
Hoeffding, W.: Probability Inequalities for Sums of Bounded Random Variables. Journal of the American Statistical AssociationĀ 58(301), 13ā30 (1963)
Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)
Rabin, T., Ben-Or, M.: Verifiable Secret Sharing and Multi-party Protocols with Honest Majority. In: 21st STOC, pp. 73ā85 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asharov, G., Lindell, Y., Zarosim, H. (2013). Fair and Efficient Secure Multiparty Computation with Reputation Systems. In: Sako, K., Sarkar, P. (eds) Advances in Cryptology - ASIACRYPT 2013. ASIACRYPT 2013. Lecture Notes in Computer Science, vol 8270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-42045-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-42045-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-42044-3
Online ISBN: 978-3-642-42045-0
eBook Packages: Computer ScienceComputer Science (R0)