Recommender Systems on Homomorphically Encrypted Databases for Enhanced User Privacy

Detailed customer statistics play an important role for merchants to distribute targeted advertising and derive sales statistics. For that, merchants are strongly interested in correlations between product groups to generate proper recommendation models. Systems that collect customer data are usually profile-based and pose a threat to customer privacy. For further improving their advertising cooperating merchants can share their customer profiles. We propose to employ homomorphic encryption to ensure all customer profile data remains protected without revealing the merchants operational secrets. Only a set of predefined operations can be performed on aggregated records of these encrypted data to calculate the desired correlations and still protect privacy. We perform an evaluation on the efficiency and feasibility of our prototypical implementation using simulated data. Our experiments show, that such a system can be implemented using commercial off-the-shelf hardware and software with negligible additional effort.

[1]  Bruce Schneier,et al.  Applied cryptography : protocols, algorithms, and source codein C , 1996 .

[2]  Berk Sunar,et al.  Accelerating NTRU based homomorphic encryption using GPUs , 2014, 2014 IEEE High Performance Extreme Computing Conference (HPEC).

[3]  Dong Wang,et al.  An analysis of anonymity on capacity finite social spots based pseudonym changing for location privacy in VANETs , 2015, 2015 12th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD).

[4]  Hao Chen,et al.  Simple Encrypted Arithmetic Library - SEAL v2.1 , 2016, Financial Cryptography Workshops.

[5]  Rajeev Motwani,et al.  Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.

[6]  Prateek Mittal,et al.  EASiER: encryption-based access control in social networks with efficient revocation , 2011, ASIACCS '11.

[7]  Björn Scheuermann,et al.  ANONUS: Anonymous Bonus Point System with Fraud Detection , 2017, 2017 IEEE 42nd Conference on Local Computer Networks (LCN).

[8]  Roberto J. Bayardo,et al.  Efficiently mining long patterns from databases , 1998, SIGMOD '98.

[9]  Yvo Desmedt,et al.  Threshold cryptography , 1994, Eur. Trans. Telecommun..

[10]  Tsan-sheng Hsu,et al.  Privacy-Preserving Collaborative Recommender Systems , 2010, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[11]  Craig Gentry,et al.  Fully homomorphic encryption using ideal lattices , 2009, STOC '09.

[12]  Berk Sunar,et al.  Accelerating fully homomorphic encryption using GPU , 2012, 2012 IEEE Conference on High Performance Extreme Computing.

[13]  Vinod Vaikuntanathan,et al.  On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption , 2012, STOC '12.

[14]  Rachel Player,et al.  Simple Encrypted Arithmetic Library-SEAL , 2017 .

[15]  Jian Pei,et al.  Mining frequent patterns without candidate generation , 2000, SIGMOD '00.

[16]  Chris Peikert,et al.  An update on SIPHER (Scalable Implementation of Primitives for Homomorphic EncRyption) — FPGA implementation using Simulink , 2012, 2012 IEEE Conference on High Performance Extreme Computing.

[17]  Kun Guo,et al.  Data mining for the online retail industry: A case study of RFM model-based customer segmentation using data mining , 2012 .

[18]  Zekeriya Erkin,et al.  Generating Private Recommendations Efficiently Using Homomorphic Encryption and Data Packing , 2012, IEEE Transactions on Information Forensics and Security.

[19]  Tomasz Imielinski,et al.  Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[20]  Hari Balakrishnan,et al.  CryptDB: protecting confidentiality with encrypted query processing , 2011, SOSP.

[21]  Aggelos Kiayias,et al.  Group Encryption , 2007, ASIACRYPT.