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.
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
Berkhin, P.: Bookmark-coloring algorithm for personalized PageRank. Internet Mathematics 3(1), 41–62 (2006)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 4th edn. MIT Press (2009)
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)
Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. USENIX Security (2011)
Jorgensen, Z., Yu, T.: A privacy-preserving framework for personalized, social recommendations. In: EDBT 2014, pp. 571–582 (2014)
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)
Konstas, I., Stathopoulos, V., Jose, J.M.: On social networks and collaborative recommendation. In: ACM, pp. 195–202 (2009)
Liu, B., Hengartner, U.: Privacy-preserving social recommendations in geosocial networks. In: IEEE, pp. 69–76. (2013)
Lindell, Y., Pinkas, B.: A Proof of Security of Yao’s Protocol for Two-Party Computation. J. Cryptology 22(2), 161–188 (2009)
Lü, L., Zhou, T.: Link prediction in complex networks: A survey. Physica A 390(6), 1150–1170 (2011)
McSherry, F., Mironov, I.: Differentially private recommender systems: Building privacy into the Netflix prize contenders. In: KDD 2009, pp. 627–636 (2009)
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)
Nikolaenko, V., Weinsberg, U., Ioannidis, S., Joye, M., Boneh, D., Taft, N.: Privacy-Preserving matrix factorization. In: CCS 2013, pp. 801–812 (2013)
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)
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)
Yao, A.C.-C.: How to generate and exchange secrets. In: FOCS 1986, pp. 162–167 (1986)
Yuan, Q., Zhao, S., Chen, L., et al.: Augmenting collaborative recommender by fusing explicit social relationships. In: Recsys (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Liu, S. et al. (2015). A Secure and Efficient Framework for Privacy Preserving Social Recommendation. In: Cheng, R., Cui, B., Zhang, Z., Cai, R., Xu, J. (eds) Web Technologies and Applications. APWeb 2015. Lecture Notes in Computer Science(), vol 9313. Springer, Cham. https://doi.org/10.1007/978-3-319-25255-1_64
Download citation
DOI: https://doi.org/10.1007/978-3-319-25255-1_64
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25254-4
Online ISBN: 978-3-319-25255-1
eBook Packages: Computer ScienceComputer Science (R0)