Advertisement

A Secure and Efficient Framework for Privacy Preserving Social Recommendation

  • Shushu LiuEmail author
  • An Liu
  • Guanfeng Liu
  • Zhixu Li
  • Jiajie Xu
  • Pengpeng Zhao
  • Lei Zhao
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9313)

Abstract

The well-known cold start problem in traditional collaborative filtering based recommender systems can be effectively addressed by social recommendation, which has been witnessed by a number of researches recently in many application domains. The social graph used in social recommendation is typically owned by a third party such as Facebook and Twitter, and should be hidden from recommender systems for obvious reasons of commercial benefits, as well as due to privacy legislation. In this paper, we present a secure and efficient framework for privacy preserving social recommendation. Our framework is built on mature cryptographic building blocks, including Paillier cryptosystem and Yao’ protocol, which lays a solid foundation for the security of our framework. Using our framework, the owner of sales data and the owner of social graph can cooperatively compute social recommendation, without revealing their private data to each other. We theoretically prove the security and analyze the complexity of our framework. Empirical study shows our framework has a linear complexity with respect to the number of users and items in recommender systems and is practical in real applications.

Keywords

recommender system social recommendation privacy preserving secure two-party computation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berkhin, P.: Bookmark-coloring algorithm for personalized PageRank. Internet Mathematics 3(1), 41–62 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 4th edn. MIT Press (2009)Google Scholar
  3. 3.
    Erkin, Z., Veugen, T., Toft, T., Lagendijk, R.L.: Generating Private Recommendations Efficiently Using Homomorphic Encryption and Data Packing. IEEE Trans. Information Forensics and Security 7(3), 1053–1066 (2012)CrossRefGoogle Scholar
  4. 4.
    Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. USENIX Security (2011)Google Scholar
  5. 5.
    Jorgensen, Z., Yu, T.: A privacy-preserving framework for personalized, social recommendations. In: EDBT 2014, pp. 571–582 (2014)Google Scholar
  6. 6.
    Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 1–20. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  7. 7.
    Konstas, I., Stathopoulos, V., Jose, J.M.: On social networks and collaborative recommendation. In: ACM, pp. 195–202 (2009)Google Scholar
  8. 8.
    Liu, B., Hengartner, U.: Privacy-preserving social recommendations in geosocial networks. In: IEEE, pp. 69–76. (2013)Google Scholar
  9. 9.
    Lindell, Y., Pinkas, B.: A Proof of Security of Yao’s Protocol for Two-Party Computation. J. Cryptology 22(2), 161–188 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Lü, L., Zhou, T.: Link prediction in complex networks: A survey. Physica A 390(6), 1150–1170 (2011)CrossRefGoogle Scholar
  11. 11.
    McSherry, F., Mironov, I.: Differentially private recommender systems: Building privacy into the Netflix prize contenders. In: KDD 2009, pp. 627–636 (2009)Google Scholar
  12. 12.
    Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., Taft, N.: Privacy-preserving ridge regression on hundreds of millions of records. In: S&P 2013, pp. 334–348 (2013)Google Scholar
  13. 13.
    Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., Taft, N.: Privacy-Preserving matrix factorization. In: CCS 2013, pp. 801–812 (2013)Google Scholar
  14. 14.
    Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  15. 15.
    Shokri, R., Pedarsani, P., Theodorakopoulos, G., Hubaux, J.: Preserving privacy in collaborative filtering through distributed aggregation of offline profiles. In: RecSys 2009, pp. 157–164 (2009)Google Scholar
  16. 16.
    Yao, A.C.-C.: How to generate and exchange secrets. In: FOCS 1986, pp. 162–167 (1986)Google Scholar
  17. 17.
    Yuan, Q., Zhao, S., Chen, L., et al.: Augmenting collaborative recommender by fusing explicit social relationships. In: Recsys (2009)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Shushu Liu
    • 1
    • 2
    Email author
  • An Liu
    • 1
    • 2
  • Guanfeng Liu
    • 1
    • 2
  • Zhixu Li
    • 1
    • 2
  • Jiajie Xu
    • 1
    • 2
  • Pengpeng Zhao
    • 1
    • 2
  • Lei Zhao
    • 1
    • 2
  1. 1.School of Computer Science and TechnologySoochow UniversitySuzhouChina
  2. 2.Collaborative Innovation Center of Novel Software Technology and IndustrializationJiangsuChina

Personalised recommendations