mlsanityData to 7 Oct 2026

TEE-based decentralized recommender systems: The raw data sharing redemption

arXiv 2202.11655 ↗First posted 23 Feb 2022cs.DC cs.CR cs.IRcited by 6

Not on the map. Why?

Abstract (arXiv)

Recommenders are central in many applications today. The most effective recommendation schemes, such as those based on collaborative filtering (CF), exploit similarities between user profiles to make recommendations, but potentially expose private data. Federated learning and decentralized learning systems address this by letting the data stay on user's machines to preserve privacy: each user performs the training on local data and only the model parameters are shared. However, sharing the model parameters across the network may still yield privacy breaches. In this paper, we present REX, the first enclave-based decentralized CF recommender. REX exploits Trusted execution environments (TEE), such as Intel software guard extensions (SGX), that provide shielded environments within the processor to improve convergence while preserving privacy. Firstly, REX enables raw data sharing, which ultimately speeds up convergence and reduces the network load. Secondly, REX fully preserves privacy. We analyze the impact of raw data sharing in both deep neural network (DNN) and matrix factorization (MF) recommenders and showcase the benefits of trusted environments in a full-fledged implementation of REX. Our experimental results demonstrate that through raw data sharing, REX significantly decreases the training time by 18.3x and the network load by 2 orders of magnitude over standard decentralized approaches that share only parameters, while fully protecting privacy by leveraging trustworthy hardware enclaves with very little overhead.

Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 22 of its 61 references that are in the map. First posted on arXiv 23 Feb 2022.

Builds on

22 of 61 references.

References · 22

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  4. 2020Inverting Gradients -- How easy is it to break privacy in federated learning?cited by 707
  5. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
  6. 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 361
  7. 2019White-box vs Black-box: Bayes Optimal Strategies for Membership Inferencecited by 265
  8. 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 218
  9. 2018Slalom: Fast, Verifiable and Private Execution of Neural Networks in Trusted Hardwarecited by 101
  10. 2021PPFL: Privacy-preserving Federated Learning with Trusted Execution Environmentscited by 93
  11. 2018Communication Compression for Decentralized Trainingcited by 87
  12. 2019The Architectural Implications of Facebook's DNN-based Personalized Recommendationcited by 83
10 more
  1. 2016Decentralized Collaborative Learning of Personalized Models over Networkscited by 73
  2. 2017Personalized and Private Peer-to-Peer Machine Learningcited by 54
  3. 2019Asynchronous Decentralized SGD with Quantized and Local Updatescited by 35
  4. 2019Helen: Maliciously Secure Coopetitive Learning for Linear Modelscited by 20
  5. 2021Citadel: Protecting Data Privacy and Model Confidentiality for Collaborative Learning with SGXcited by 14
  6. 2020Secure Collaborative Training and Inference for XGBoostcited by 9
  7. 2020Trust Management as a Service: Enabling Trusted Execution in the Face of Byzantine Stakeholderscited by 5
  8. 2018CYCLOSA: Decentralizing Private Web Search Through SGX-Based Browser Extensionscited by 2
  9. 2018SGX-Aware Container Orchestration for Heterogeneous Clusterscited by 1
  10. 2020MAGE: Mutual Attestation for a Group of Enclaves without Trusted Third Partiescited by 1

Built on by

Cited by year

Citing papers per year: 2023: 2; 2024: 3; 2025: 1.

6 papers.