Secure Social Recommendation based on Secret Sharing

Nowadays, privacy preserving machine learning has been drawing much attention in both industry and academy. Meanwhile, recommender systems have been extensively adopted by many commercial platforms (e.g. Amazon) and they are mainly built based on user-item interactions. Besides, social platforms (e.g. Facebook) have rich resources of user social information. It is well known that social information, which is rich on social platforms such as Facebook, are useful to recommender systems. It is anticipated to combine the social information with the user-item ratings to improve the overall recommendation performance. Most existing recommendation models are built based on the assumptions that the social information are available. However, different platforms are usually reluctant to (or cannot) share their data due to certain concerns. In this paper, we first propose a SEcure SOcial RECommendation (SeSoRec) framework which can (1) collaboratively mine knowledge from social platform to improve the recommendation performance of the rating platform, and (2) securely keep the raw data of both platforms. We then propose a Secret Sharing based Matrix Multiplication (SSMM) protocol to optimize SeSoRec and prove its correctness and security theoretically. By applying minibatch gradient descent, SeSoRec has linear time complexities in terms of both computation and communication. The comprehensive experimental results on three real-world datasets demonstrate the effectiveness of our proposed SeSoRec and SSMM.

[1]  Kevin Chen-Chuan Chang,et al.  Semi-supervised Learning Meets Factorization , 2018, ACM Trans. Knowl. Discov. Data.

[2]  Yehuda Lindell,et al.  How To Simulate It - A Tutorial on the Simulation Proof Technique , 2016, IACR Cryptol. ePrint Arch..

[3]  Martine De Cock,et al.  Fast, Privacy Preserving Linear Regression over Distributed Datasets based on Pre-Distributed Data , 2015, AISec@CCS.

[4]  Benny Pinkas,et al.  Faster Private Set Intersection Based on OT Extension , 2014, USENIX Security Symposium.

[5]  Payman Mohassel,et al.  SecureML: A System for Scalable Privacy-Preserving Machine Learning , 2017, 2017 IEEE Symposium on Security and Privacy (SP).

[6]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[7]  Jean-Guillaume Dumas,et al.  Private Multi-party Matrix Multiplication and Trust Computations , 2016, SECRYPT.

[8]  Tamir Tassa,et al.  Secure Multi-Party Protocols for Item-Based Collaborative Filtering , 2017, RecSys.

[9]  Huan Liu,et al.  Personalized Privacy-Preserving Social Recommendation , 2018, AAAI.

[10]  Mohammad Ali Abbasi,et al.  Trust-Aware Recommender Systems , 2014 .

[11]  Shuguo Han,et al.  A Study of Efficiency and Accuracy of Secure Multiparty Protocol in Privacy-Preserving Data Mining , 2012, 2012 26th International Conference on Advanced Information Networking and Applications Workshops.

[12]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[13]  Blaise Agüera y Arcas,et al.  Communication-Efficient Learning of Deep Networks from Decentralized Data , 2016, AISTATS.

[14]  Stratis Ioannidis,et al.  Privacy-preserving matrix factorization , 2013, CCS.

[15]  Shuguo Han,et al.  Privacy-Preserving Linear Fisher Discriminant Analysis , 2008, PAKDD.

[16]  Donald Beaver,et al.  Efficient Multiparty Protocols Using Circuit Randomization , 1991, CRYPTO.

[17]  Oded Goldreich,et al.  Foundations of Cryptography: Volume 2, Basic Applications , 2004 .

[18]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[19]  Jun Zhou,et al.  Distributed Collaborative Hashing and Its Applications in Ant Financial , 2018, KDD.

[20]  Anderson C. A. Nascimento,et al.  Efficient and Private Scoring of Decision Trees, Support Vector Machines and Logistic Regression Models Based on Pre-Computation , 2019, IEEE Transactions on Dependable and Secure Computing.

[21]  Oded Goldreich,et al.  The Foundations of Cryptography - Volume 2: Basic Applications , 2001 .

[22]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[23]  Steffen Rendle,et al.  Factorization Machines , 2010, 2010 IEEE International Conference on Data Mining.

[24]  Marcel Keller,et al.  Overdrive: Making SPDZ Great Again , 2018, IACR Cryptol. ePrint Arch..

[25]  Huan Liu,et al.  Social recommendation: a review , 2013, Social Network Analysis and Mining.

[26]  Yehuda Koren,et al.  Matrix Factorization Techniques for Recommender Systems , 2009, Computer.

[27]  Neil Yorke-Smith,et al.  A Novel Bayesian Similarity Measure for Recommender Systems , 2013, IJCAI.

[28]  Yehuda Lindell,et al.  Secure Multiparty Computation for Privacy-Preserving Data Mining , 2009, IACR Cryptol. ePrint Arch..

[29]  Jun Zhou,et al.  Privacy Preserving Point-of-Interest Recommendation Using Decentralized Matrix Factorization , 2018, AAAI.

[30]  Tao Chen,et al.  TriRank: Review-aware Explainable Recommendation by Modeling Aspects , 2015, CIKM.

[31]  Ilya Mironov,et al.  Differentially private recommender systems: building privacy into the net , 2009, KDD.

[32]  Chao Liu,et al.  Recommender systems with social regularization , 2011, WSDM '11.

[33]  Junwei Wang,et al.  ComSoc: adaptive transfer of user behaviors over composite social network , 2012, KDD.

[34]  Ruslan Salakhutdinov,et al.  Probabilistic Matrix Factorization , 2007, NIPS.

[35]  Michael Zohner,et al.  ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation , 2015, NDSS.

[36]  T. Takagi,et al.  Efficient scalar product protocol and its privacy-preserving application , 2015, Int. J. Electron. Secur. Digit. Forensics.

[37]  Jingyu Hua,et al.  Differentially Private Matrix Factorization , 2015, IJCAI.

[38]  Stratis Ioannidis,et al.  Privacy-Preserving Ridge Regression on Hundreds of Millions of Records , 2013, 2013 IEEE Symposium on Security and Privacy.