Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption: Extended Abstract
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Recommendation systems become popular in our daily life. It is well known that the more the release of users' personal data, the better the quality of recommendation. However, such services raise serious privacy concerns for users. In this paper, focusing on matrix factorization-based recommendation systems, we propose the first privacy-preserving matrix factorization using fully homomorphic encryption. On inputs of encrypted users' ratings, our protocol performs matrix factorization over the encrypted data and returns encrypted outputs so that the recommendation system knows nothing on rating values and resulting user/item profiles. It provides a way to obfuscate the number and list of items a user rated without harming the accuracy of recommendation, and additionally protects recommender's tuning parameters for business benefit and allows the recommender to optimize the parameters for quality of service. To overcome performance degradation caused by the use of fully homomorphic encryption, we introduce a novel data structure to perform computations over encrypted vectors, which are essential operations for matrix factorization, through secure 2-party computation in part. With the data structure, the proposed protocol requires dozens of times less computation cost over those of previous works. Our experiments on a personal computer with 3.4 GHz 6-cores 64 GB RAM show that the proposed protocol runs in 1.5 minutes per iteration. It is more efficient than Nikolaenko et al.'s work proposed in CCS 2013, in which it took about 170 minutes on two servers with 1.9 GHz 16-cores 128 GB RAM.
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
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 1×
“It has been discovered that anonymization of users’ data is not sufficient to protect the privacy [6, 26, 37].”
BackgroundCalibrating Noise to Sensitivity in Private Data Analysis
Dwork, C., McSherry, F., Nissim, K., & Smith, A. (2006) · Lecture Notes in Computer Science · doi:10.1007/11681878_14 · Cited by 7,272
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
Robust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372
(2012) · doi:10.1145/2365952.2365989 · Cited by 170 · cited 2×
“In [40], it has been shown that one can infer user’s gender from which items the user rated.”
Background
Cited by
Secure Federated Matrix Factorization
Chai, D., Wang, L., Chen, K., & Yang, Q. (2021) · IEEE Intelligent Systems · doi:10.1109/mis.2020.3014880 · Cited by 449
Himeur, Y., Sohail, S. S., Bensaali, F., Amira, A., & Alazab, M. (2022) · Computers & Security · doi:10.1016/j.cose.2022.102746 · Cited by 139
InPrivate Digging: Enabling Tree-based Distributed Data Mining with Differential Privacy
Zhao, L., Ni, L., Hu, S., Chen, Y., Zhou, P., Xiao, F., & Wu, L. (2018) · IEEE INFOCOM 2018 - IEEE Conference on Computer Communications · doi:10.1109/infocom.2018.8486352 · Cited by 108
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
Self-citation
Metadata
- Authors
- Kim, S., Kim, J., Koo, D., Kim, Y., Yoon, H., & Shin, J.
- Venue
- Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security
- Publisher
- ACM
- Published
- 2016-05-30
- Volume
- 2016
- Pages
- 617-628
- OpenAlex
- W2406176316
- Cited by
- 59
- References
- 5
- FWCI
- 3.27
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption: Extended Abstract. https://app.cochat.ai/papers/10.1145/2897845.2897875
- The paper
- Kim, S., Kim, J., Koo, D., Kim, Y., Yoon, H., & Shin, J. (2016). Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption: Extended Abstract. Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security. https://doi.org/10.1145/2897845.2897875
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.