Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2015, Article ID 637458, 8 pages
http://dx.doi.org/10.1155/2015/637458
Research Article

Fair Secure Computation with Reputation Assumptions in the Mobile Social Networks

1School of Computer Science and Technology, Shandong University, Jinan 250101, China
2School of Information and Electrical Engineering, Ludong University, Yantai 264025, China
3School of Information Science and Engineering, Shandong Normal University, Jinan 250014, China
4School of Computer Science, Shaanxi Normal University, Xi’an 710062, China
5Laboratory of Algorithmics, Cryptology and Security (LACS), 1359 Luxembourg, Luxembourg

Received 29 August 2014; Accepted 1 September 2014

Academic Editor: David Taniar

Copyright © 2015 Yilei Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. M. Kimura and K. Saito, “Tractable models for information diffusion in social networks,” in Knowledge Discovery in Databases: PKDD 2006, vol. 4213, pp. 259–271, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  2. H. Ma, H. Yang, M. R. Lyu, and I. King, “Mining social networks using heat diffusion processes for marketing candidates selection,” in Proceedings of the 17th ACM Conference on Information and Knowledge Management (CIKM '08), pp. 233–242, ACM, October 2008. View at Publisher · View at Google Scholar · View at Scopus
  3. A. B. Waluyo, W. Rahayu, D. Taniar, and B. Scrinivasan, “A novel structure and access mechanism for mobile data broadcast in digital ecosystems,” IEEE Transactions on Industrial Electronics, vol. 58, no. 6, pp. 2173–2182, 2011. View at Publisher · View at Google Scholar · View at Scopus
  4. J. Goh and D. Taniar, “Mining frequency pattern from mobile users,” in Knowledge-Based Intelligent Information and Engineering Systems, pp. 795–801, Springer, 2004. View at Google Scholar
  5. D. Taniar and J. Goh, “On mining movement pattern from mobile users,” International Journal of Distributed Sensor Networks, vol. 3, no. 1, pp. 69–86, 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Y. Goh and D. Taniar, “Mobile data mining by location dependencies,” in Intelligent Data Engineering and Automated Learning—IDEAL 2004, vol. 3177 of Lecture Notes in Computer Science, pp. 225–231, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  7. A. Yao, “Protocols for secure computation,” in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS '82), pp. 160–164, IEEE Computer Society, Chicago, Ill, USA, November 1982. View at Publisher · View at Google Scholar
  8. R. Cleve, “Limits on the security of coin flips when half the processors are faulty,” in STOC 1986, J. Hartmanis, Ed., pp. 364–369, ACM, Berkeley, Calif, USA, 1986. View at Google Scholar
  9. O. Goldreich, Foundations of Cryptography, vol. 2, Cambridge University Press, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  10. J. Urry, “Social networks, travel and talk,” British Journal of Sociology, vol. 54, no. 2, pp. 155–175, 2003. View at Publisher · View at Google Scholar · View at Scopus
  11. K. W. Axhausen, “Social networks and travel: some hypotheses,” in Social Dimensions of Sustainable Transport: Transatlantic Perspectives, pp. 90–108, 2005. View at Google Scholar
  12. B. Wellman, B. Hogan, K. Berg et al., “Connected lives: the project1,” in Networked Neighbourhoods, pp. 161–216, Springer, 2006. View at Google Scholar
  13. J. Larsen, J. Urry, and K. Axhausen, “Coordinating face-to-face meetings in mobile network societies,” Information Communication & Society, vol. 11, no. 5, pp. 640–658, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. Y. Wang, G. Cong, G. Song, and K. Xie, “Community-based greedy algorithm for mining top-k influential nodes in mobile social networks,” in Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 1039–1048, ACM, 2010.
  15. E. Miluzzo, N. D. Lane, K. Fodor et al., “Sensing meets mobile social networks: the design, implementation and evaluation of the CenceMe application,” in Proceedings of the 6th ACM Conference on Embedded Networked Sensor Systems (SenSys '08), pp. 337–350, ACM, New York, NY, USA, November 2008. View at Publisher · View at Google Scholar · View at Scopus
  16. M. C. González, P. G. Lind, and H. J. Herrmann, “System of mobile agents to model social networks,” Physical Review Letters, vol. 96, no. 8, Article ID 088702, 2006. View at Publisher · View at Google Scholar · View at Scopus
  17. A. Beach, M. Gartrell, S. Akkala et al., “WhozThat? Evolving an ecosystem for context-aware mobile social networks,” IEEE Network, vol. 22, no. 4, pp. 50–55, 2008. View at Publisher · View at Google Scholar · View at Scopus
  18. Y. Wang, Z. Liu, H. Wang, and Q. Xu, “Social rational secure multi-party computation,” Concurrency Computation Practice and Experience, vol. 26, no. 5, pp. 1067–1083, 2014. View at Publisher · View at Google Scholar · View at Scopus
  19. J. Halpern and V. Teague, “Rational secret sharing and multiparty computation: extended abstract,” in Proceedings of the Symposium of Theory of Computing (STOC '04), pp. 623–632, ACM, Chicago, Ill, USA. View at Publisher · View at Google Scholar · View at MathSciNet
  20. S. Maleka, A. Shareef, and C. P. Rangan, “Rational secret sharing with repeated games,” in Information Security Practice and Experience: Proceedings of the 4th International Conference, ISPEC 2008 Sydney, Australia, April 21–23, 2008, L. Chen, Y. Mu, and W. Susilo, Eds., vol. 4991 of Lecture Notes in Computer Science, pp. 334–346, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  21. A. Groce and J. Katz, “Fair computation with rational players,” in Advances in Cryptology—EUROCRYPT 2012, D. Pointcheval and T. Johansson, Eds., vol. 7237, pp. 81–98, Springer, Cambridge, UK, 2012. View at Google Scholar
  22. Y. Wang, Q. Xu, and Z. Liu, “Fair computation with tit-for-tat strategy,” in Proceedings of the 5th IEEE International Conference on Intelligent Networking and Collaborative Systems (INCoS '13), pp. 309–314, Xi'an, China, September 2013. View at Publisher · View at Google Scholar · View at Scopus
  23. R. Axelrod, The Evolution of Cooperation, Penguin Press, London, UK, 1990.
  24. M. A. Nowak and K. Sigmund, “Tit for tat in heterogeneous populations,” Nature, vol. 355, no. 6357, pp. 250–253, 1992. View at Publisher · View at Google Scholar · View at Scopus
  25. D. Fudenberg and J. Tirole, Game Theory, 1991, MIT Press, Cambridge, Mass, USA, 1991. View at MathSciNet
  26. S. Gordon, C. Hazay, J. Katz, and Y. Lindell, “Complete fairness in secure two-party computation,” in Proceedings of the Symposium on Theory of Computing Conference (STOC '08), C. Dwork, Ed., pp. 413–422, ACM, Victoria, Canada, May 2008.
  27. J. Katz, “On achieving the best of both worlds in secure multiparty computation,” in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC '07), pp. 11–20, ACM, San Diego, Calif, USA, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. T. Moran, M. Naor, and G. Segev, “An optimally fair coin toss,” in Theory of Cryptography, O. Reingold, Ed., vol. 5444 of Lecture Notes in Computer Science, pp. 1–18, San Francisco, Calif, USA, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  29. B. Yu and M. P. Singh, “A social mechanism of reputation management in electronic communities,” in Cooperative Information Agents IV—The Future of Information Agents in Cyberspace, pp. 154–165, Springer, Boston, MA, USA, 2000. View at Google Scholar
  30. M. Nojoumian and T. C. Lethbridge, “A new approach for the trust calculation in social networks,” in E-Business and Telecommunication Networks, pp. 64–77, Springer, Berlin, Germany, 2008. View at Google Scholar
  31. R. Canetti, “Security and composition of multiparty cryptographic protocols,” Journal of Cryptology, vol. 13, no. 1, pp. 143–202, 2000. View at Publisher · View at Google Scholar · View at MathSciNet
  32. R. Canetti, “Universally composable security: a new paradigm for cryptographic protocols,” in Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS '01), pp. 136–145, IEEE Computer Society, Las Vegas, Nev, USA, October 2001. View at Publisher · View at Google Scholar
  33. D. M. Kreps and R. Wilson, “Reputation and imperfect information,” Journal of Economic Theory, vol. 27, no. 2, pp. 253–279, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  34. G. Asharov, R. Canetti, and C. Hazay, “Towards a game theoretic view of secure computation,” in Proceedings of the 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques (EUROCRYPT '11), K. G. Paterson, Ed., pp. 426–445, Springer, Tallinn, Estonia, 2011. View at Publisher · View at Google Scholar
  35. Y. Wang, Q. Xu, and Z. Liu, “Fair computation with tit-for-tat strategy,” in Proceedings of the 5th IEEE International Conference on Intelligent Networking and Collaborative Systems (INCoS '13), pp. 309–314, IEEE, Los Alamitos, Calif, USA, September 2013. View at Publisher · View at Google Scholar · View at Scopus