SHELBRS: Location Based Recommendation Services using Switchable Homomorphic Encryption

Location-Based Recommendation Services (LBRS) has seen an unprecedented rise in its usage in recent years. LBRS facilitates a user by recommending services based on his location and past preferences. However, leveraging such services comes at a cost of compromising one’s sensitive information like their shopping preferences, lodging places, food habits, recently visited places, etc. to the third-party servers. Losing such information could be crucial and threatens one’s privacy. Nowadays, the privacy-aware society seeks solutions that can provide such services, with minimized risks. Recently, a few privacy-preserving recommendation services have been proposed that exploit the fully homomorphic encryption (FHE) properties to address the issue. Though, it reduced privacy risks but suffered from heavy computational overheads that ruled out their commercial applications. Here, we propose SHELBRS, a lightweight LBRS that is based on switchable homomorphic encryption (SHE), which will benefit the users as well as the service providers. A SHE exploits both the additive as well as the multiplicative homomorphic properties but with comparatively much lesser processing time as it’s FHE counterpart. We evaluate the performance of our proposed scheme with the other stateof-the-art approaches without compromising security.

[1]  Ja-Ling Wu,et al.  A Novel Privacy Preserving Location-Based Service Protocol With Secret Circular Shift for K-NN Search , 2013, IEEE Transactions on Information Forensics and Security.

[2]  Christos Faloutsos,et al.  Analysis of the Clustering Properties of the Hilbert Space-Filling Curve , 2001, IEEE Trans. Knowl. Data Eng..

[3]  Hayato Yamana,et al.  Privacy-preserving Recommendation for Location-based Services , 2019, 2019 IEEE 4th International Conference on Big Data Analytics (ICBDA).

[4]  Qiang He,et al.  Time-aware distributed service recommendation with privacy-preservation , 2019, Inf. Sci..

[5]  Philippe Gaborit,et al.  A fast private information retrieval protocol , 2008, 2008 IEEE International Symposium on Information Theory.

[6]  Minjuan Wang,et al.  FM-based: Algorithm research on rural tourism recommendation combining seasonal and distribution features , 2018, Pattern Recognit. Lett..

[7]  Xinwen Fu,et al.  A context-aware scheme for privacy-preserving location-based services , 2012, Comput. Networks.

[8]  Iwao Sasase,et al.  LPCQP: Lightweight private circular query protocol for privacy-preserving k-NN search , 2015, 2015 12th Annual IEEE Consumer Communications and Networking Conference (CCNC).

[9]  Victor I. Chang,et al.  Towards privacy preservation for "check-in" services in location-based social networks , 2019, Inf. Sci..

[10]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[11]  Ibrahim Khalil,et al.  A Practical Privacy-Preserving Recommender System , 2016, Data Science and Engineering.

[12]  Marco Gruteser,et al.  USENIX Association , 1992 .

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

[14]  Ee-Chien Chang,et al.  Faster Secure Arithmetic Computation Using Switchable Homomorphic Encryption , 2014, IACR Cryptol. ePrint Arch..

[15]  David Contreras,et al.  EventAware: A mobile recommender system for events , 2017, Pattern Recognit. Lett..

[16]  James M. Kang,et al.  Space-Filling Curves , 2017, Encyclopedia of GIS.

[17]  Yi-Cheng Zhang,et al.  Recommender Systems , 2012, ArXiv.

[18]  Orestis Papakyriakopoulos,et al.  Political communication on social media: A tale of hyperactive users and bias in recommender systems , 2020, Online Soc. Networks Media.

[19]  Craig Gentry,et al.  (Leveled) Fully Homomorphic Encryption without Bootstrapping , 2014, ACM Trans. Comput. Theory.