New rational parties relying on reputation

In this paper, we redefine the utilities considering other parts such as reputation in order to give rational parties incentives to participate in the protocol and finally get the correct outputs. The most distinct contribution of this paper is the proposal of rational covert adversaries whose behaviors are combinations of rational parties and covert adversaries. Finally, given proper parameters, we prove that all parties have incentives to participate in the rational secure computation protocol. Copyright © 2013 John Wiley & Sons, Ltd.

[1]  Jonathan Katz,et al.  Rational Secret Sharing, Revisited , 2006, SCN.

[2]  Oded Goldreich.  Foundations of Cryptography: Volume 1 , 2006 .

[3]  Yehuda Lindell,et al.  Complete Fairness in Secure Two-Party Computation , 2011, JACM.

[4]  Georg Fuchsbauer,et al.  Efficient Rational Secret Sharing in Standard Communication Networks , 2010, IACR Cryptol. ePrint Arch..

[5]  Jonathan Katz,et al.  Fair Computation with Rational Players , 2012, EUROCRYPT.

[6]  Mehrdad Nojoumian.  Socio-Rational Secret Sharing as a New Direction in Both Rational Cryptography and Game Theory , 2011, IACR Cryptol. ePrint Arch..

[7]  Timothy Lethbridge,et al.  A New Approach for the Trust Calculation in Social Networks , 2006, ICE-B.

[8]  Gilad Asharov,et al.  Calling out Cheaters: Covert Security With Public Verifiability , 2012, IACR Cryptol. ePrint Arch..

[9]  Ran Canetti,et al.  Toward a Game Theoretic View of Secure Computation , 2011, Journal of Cryptology.

[10]  Benny Pinkas,et al.  Fairplay - Secure Two-Party Computation System , 2004, USENIX Security Symposium.

[11]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[12]  C. Pandu Rangan,et al.  The deterministic protocol for rational secret sharing , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[13]  Abhi Shelat,et al.  Completely fair SFE and coalition-safe cheap talk , 2004, PODC '04.

[14]  Rafail Ostrovsky,et al.  Covert Multi-Party Computation , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[15]  Jonathan Katz,et al.  Partial Fairness in Secure Two-Party Computation , 2010, Journal of Cryptology.

[16]  Jonathan Katz.  On achieving the "best of both worlds" in secure multiparty computation , 2007, STOC '07.

[17]  Yehuda Lindell,et al.  Utility Dependence in Correct and Fair Rational Secret Sharing , 2009, Journal of Cryptology.

[18]  Yehuda Lindell,et al.  Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries , 2007, TCC.

[19]  John Langford,et al.  Covert two-party computation , 2005, STOC '05.

[20]  Moshe Tennenholtz,et al.  Non-cooperative computation: Boolean functions with correctness and exclusivity , 2005, Theor. Comput. Sci..

[21]  Guangwen Yang,et al.  Optimizing write operation on replica in data grid , 2011, Science China Information Sciences.

[22]  Zhifang Zhang,et al.  Rational secret sharing as extensive games , 2013, Science China Information Sciences.

[23]  Abhi Shelat,et al.  Collusion-free protocols , 2005, STOC '05.

[24]  Douglas R. Stinson,et al.  Socio-Rational Secret Sharing as a New Direction in Rational Cryptography , 2012, GameSec.

[25]  C. Pandu Rangan,et al.  Rational Secret Sharing with Repeated Games , 2008, ISPEC.

[26]  Yuval Ishai,et al.  Extending Oblivious Transfers Efficiently , 2003, CRYPTO.

[27]  Zhifang Zhang,et al.  Unconditionally Secure Rational Secret Sharing in Standard Communication Networks , 2010, ICISC.

[28]  Sergei Izmalkov,et al.  Rational secure computation and ideal mechanism design , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[29]  Anna Lysyanskaya,et al.  Rationality and Adversarial Behavior in Multi-party Computation , 2006, CRYPTO.

[30]  Moni Naor,et al.  Games for exchanging information , 2008, STOC.

[31]  Adam D. Smith,et al.  Efficient Two Party and Multi Party Computation Against Covert Adversaries , 2008, EUROCRYPT.

[32]  Jonathan Katz,et al.  Bridging Game Theory and Cryptography: Recent Results and Future Directions , 2008, TCC.

[33]  David C. Parkes,et al.  Fairness with an Honest Minority and a Rational Majority , 2009, TCC.

[34]  Joseph Y. Halpern,et al.  Rational secret sharing and multiparty computation: extended abstract , 2004, STOC '04.

[35]  Moni Naor,et al.  Cryptography and Game Theory: Designing Protocols for Exchanging Information , 2008, TCC.

[36]  Ran Canetti,et al.  Security and Composition of Multiparty Cryptographic Protocols , 2000, Journal of Cryptology.

[37]  Munindar P. Singh,et al.  A Social Mechanism of Reputation Management in Electronic Communities , 2000, CIA.

[38]  Danny Dolev,et al.  Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation , 2006, PODC '06.

[39]  Matthew K. Franklin,et al.  Communication complexity of secure computation (extended abstract) , 1992, STOC '92.

[40]  Douglas R. Stinson,et al.  Unconditionally secure social secret sharing scheme , 2010, IET Inf. Secur..

[41]  Abhi Shelat,et al.  Purely Rational Secret Sharing (Extended Abstract) , 2009, TCC.