Abstract
Rational parties in secure two-party computation (STPC) are willing to maximize their utilities. However, they have no incentives to cooperate in STPC under correctness and exclusivity assumptions since cooperation will bring them inferior utilities. Consequently, both parties will not participate in STPC. Therefore, new methods must be introduced to make parties cooperate such that they can complete this computation task. In this paper, we redefine utility considering the notion of reputation derived from social cloud to promote cooperation. In social cloud, parties form their reputation when they interact with others. Parties will get a higher utility if they have a higher cooperative reputation. Therefore they have incentives to cooperate. The computation of reputation is completed in the social cloud, which reduce the computation work for parties. Furthermore, we prove that given proper parameters in rational STPC, it is possible to construct an efficient computation protocol, where only one exchanging round in the second stage of the hybrid protocol.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Asharov, G., Canetti, R., Hazay, C.: Towards a game theoretic view of secure computation. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 426–445. Springer, Heidelberg (2011)
Aumann, Y., Lindell, Y.: Security against covert adversaries: Efficient protocols for realistic adversaries. Journal of Cryptology 23(2), 281–343 (2010)
Beberg, A., Ensign, D., Jayachandran, G., Khaliq, S., Pande, V.: Folding@home: Lessons from eight years of volunteer distributed computing. In: Parallel Distributed Processing (IPDPS 2009), pp. 1–8. IEEE (2009)
Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143–202 (2000)
Chard, K., Caton, S.: Social cloud computing: A vision for socially motivated resource sharing. IEEE Transactions on Services Computing 5(4), 551–563 (2012)
Cox, L., Noble, B.: Samsara: Honor among thieves in peer-to-peer storage. SIGOPS Operating Systems Rev. 37, 120–132 (2003)
Garay, J., Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Rational protocol design: Cryptography against incentive-driven adversaries. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS), pp. 648–657. IEEE (2013)
Goldreich, O.: Foundations of Cryptography, vol. 2. Cambridge University Press (2004)
Gordon, S.: On fairness in secure computation. Ph.D. thesis, University of Maryland (2010)
Groce, A., Katz, J.: Fair computation with rational players. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 81–98. Springer, Heidelberg (2012)
Klimeck, G., McLennan, M., Brophy, S.P., Adams III, G.B., Lundstrom, M.S.: nanohub.org: Advancing education and research in nanotechnology. Computing in Science and Engineering 10, 17–23 (2008)
Korpela, E., Werthimer, D., Anderson, D., Cobb, J., Leboisky, M.: Seti@home-massively distributed computing for seti. Computing in Science Engineering 3(1), 78–83 (2001)
Lakshman, A., Malik, P.: Cassandra: Structured storage system on a p2p network. In: 28th ACM Symp. Principles of Distributed Computing (PODC 2009), p. 5. ACM, New York (2009)
Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS Operating Systems Review 44(2), 35–40 (2010)
Lysyanskaya, A., Triandopoulos, N.: Rationality and adversarial behavior in multi-party computation. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 180–197. Springer, Heidelberg (2006)
Marks, K.: Future of web apis: The social cloud, future of Web Apps (2008)
Ong, S.J., Parkes, D.C., Rosen, A., Vadhan, S.: Fairness with an honest minority and a rational majority. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 36–53. Springer, Heidelberg (2009)
OpenSocial and Gadgets Specification Group: Opensocial specification v0.9 (2009), http://www.opensocial.org/Technical-Resources/opensocial-spec-v09/OpenSocial-Specification.html
Pezzi, R.: Information technology tools for a transition economy (2009), http://www.socialcloud.net/papers/ITtools.pdf
Roure, D.D., Goble, C., Stevens, R.: The design and realisation of the myexperiment virtual research environment for social sharing of workflows. Future Generation Computer Systems 25(5), 561–567 (2012)
Rowstron, A., Druschel, P.: Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility. SIGOPS Operating Systems Rev. 35, 188–201 (2001)
Wang, Y., Liu, Z., Wang, H., Xu, Q.: Social rational secure multi-party computation. Concurrency and Computation: Practice and Experience 26(5), 1067–1083 (2014)
Wang, Y., Liu, Z., Xu, Q.: New rational parties relying on reputation. Security and Communication Networks 7, 1128–1137 (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, Y., Liu, Z., Li, T., Xu, Q. (2014). Rational Secure Two-party Computation in Social Cloud. In: Au, M.H., Carminati, B., Kuo, CC.J. (eds) Network and System Security. NSS 2015. Lecture Notes in Computer Science, vol 8792. Springer, Cham. https://doi.org/10.1007/978-3-319-11698-3_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-11698-3_36
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11697-6
Online ISBN: 978-3-319-11698-3
eBook Packages: Computer ScienceComputer Science (R0)