Generating Private Recommendations Efficiently Using Homomorphic Encryption and Data Packing
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Recommender systems have become an important tool for personalization of online services. Generating recommendations in online services depends on privacy-sensitive data collected from the users. Traditional data protection mechanisms focus on access control and secure transmission, which provide security only against malicious third parties, but not the service provider. This creates a serious privacy risk for the users. In this paper, we aim to protect the private data against the service provider while preserving the functionality of the system. We propose encrypting private data and processing them under encryption to generate recommendations. By introducing a semitrusted third party and using data packing, we construct a highly efficient system that does not require the active participation of the user. We also present a comparison protocol, which is the first one to the best of our knowledge, that compares multiple values that are packed in one encryption. Conducted experiments show that this work opens a door to generate private recommendations in a privacy-preserving manner.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A public key cryptosystem and a signature scheme based on discrete logarithms
Elgamal, T. (1985) · IEEE Transactions on Information Theory · doi:10.1109/tit.1985.1057074 · Cited by 8,059
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
Paillier, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48910-x_16 · Cited by 7,250
Privacy Preserving Data Mining
Lindell, Y., & Pinkas, B. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44598-6_3 · Cited by 1,077
Cited by
Secure Medical Data Transmission Model for IoT-Based Healthcare Systems
Elhoseny, M., Ramirez-Gonzalez, G., Abu-Elnasr, O. M., Shawkat, S. A., Arunkumar, N., & Farouk, A. (2018) · IEEE Access · doi:10.1109/access.2018.2817615 · Cited by 546
Privacy-Preserving Machine Learning: Threats and Solutions
Al-Rubaie, M., & Chang, J. M. (2019) · IEEE Security & Privacy · doi:10.1109/msec.2018.2888775 · Cited by 444
Lagendijk, R. L., & Barni, M. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2219653 · Cited by 336
Self-citationPrivacy in the Smart City—Applications, Technologies, Challenges, and Solutions
Eckhoff, D., & Wagner, I. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2748998 · Cited by 287
Zhou, J., Liu, X., Au, O. C., & Tang, Y. Y. (2014) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2013.2291625 · Cited by 192
Making AI Forget You: Data Deletion in Machine Learning
Ginart, A., Guan, M. Y., Valiant, G., & Zou, J. (2019) · arXiv · doi:10.48550/arxiv.1907.05012 · Cited by 175
Himeur, Y., Sohail, S. S., Bensaali, F., Amira, A., & Alazab, M. (2022) · Computers & Security · doi:10.1016/j.cose.2022.102746 · Cited by 139
Toward Privacy-Preserving Personalized Recommendation Services
Wang, C., Zheng, Y., Jiang, J., & Ren, K. (2018) · Engineering · doi:10.1016/j.eng.2018.02.005 · Cited by 101
Kim, J., Koo, D., Kim, Y., Yoon, H., Shin, J., & Kim, S. (2018) · ACM Transactions on Privacy and Security · doi:10.1145/3212509 · Cited by 74
Privacy Preserving User-Based Recommender System
Badsha, S., Yi, X., Khalil, I., & Bertino, E. (2017) · 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2017.248 · Cited by 72
“To generate recommendations, the protocols proposed by [10], [17] compute the average rating of those users who are similar (above a threshold) to a target user, whereas we use a weighted sum approach which is a more efficient approach to generate recommendations.”
BackgroundMethodResultInfluentialPrivacy Preserving Location-Aware Personalized Web Service Recommendations
Badsha, S., Yi, X., Khalil, I., Liu, D., Nepal, S., Bertino, E., & Lam, K. Y. (2021) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2018.2839587 · Cited by 56
“…of location aware Web service recommendation, the privacy issues in service computing i.e., especially in Web service recommendations and finally privacy preserving CF [21], [22], [23], [24], [25], we propose a new framework to preserve users’ privacy in location aware Web service Recommendations.”
BackgroundMethodLiu, X., Liu, A., Zhang, X., Li, Z., Liu, G., Zhao, L., & Zhou, X. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-55753-3_36 · Cited by 42
Horizontal Federated Recommender System: A Survey
Wang, L., Zhou, H., Bao, Y., Yan, X., Shen, G., & Kong, X. (2024) · ACM Computing Surveys · doi:10.1145/3656165 · Cited by 37
Kashani, S. M. Z., & Hamidzadeh, J. (2020) · Soft Computing · doi:10.1007/s00500-019-04605-z · Cited by 25
Privacy-Preserving Collaborative Filtering Using Fully Homomorphic Encryption
Jumonji, S., Sakai, K., Sun, M.-T., & Ku, W.-S. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3115776 · Cited by 19
“[4] apply two homomorphic encryption schemes, i.”
BackgroundMethodInfluential
Metadata
- Authors
- Erkin, Z., Veugen, T., Toft, T., & Lagendijk, R. L.
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2012-06
- Volume
- 7
- Issue
- 3
- Pages
- 1053-1066
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2166939545
- Cited by
- 238
- References
- 3
- FWCI
- 12.67
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.