Encrypted matrix factorization using Compressed Sparse Row representation and CKKS fully homomorphic encryption is claimed to reduce communication cost to M/L ciphertexts while keeping accuracy, but the evaluation lacks a held-out test set.
Efficient privacy-preserving matrix factorization via fully homomorphic encryption
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
cs.CR 1years
2025 1verdicts
REJECT 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Efficient Privacy-Preserving Recommendation on Sparse Data using Fully Homomorphic Encryption
Encrypted matrix factorization using Compressed Sparse Row representation and CKKS fully homomorphic encryption is claimed to reduce communication cost to M/L ciphertexts while keeping accuracy, but the evaluation lacks a held-out test set.