mlsanityData to 7 Oct 2026

Scalable and Privacy-Preserving Synthetic Data Generation on Decentralised Web

arXiv 2310.20062 ↗First posted 30 Oct 2023cs.CR cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Data on the Web has fueled much of the recent progress in AI. As more high-quality data becomes difficult to access, synthetic data is emerging as a promising solution for privacy-friendly data release and complementing real datasets in developing robust and safe AI. But there is limited work on decentralised, scalable and contributor-centric synthetic data generation systems. A recent proposal, called Libertas, allows data contributors to autonomously participate in joint computations over their Web data without relying on a trusted centre. Libertas uses Solid (Social Linked Data) and MPC (Secure Multi-Party Computation) to achieve this goal. Solid is a decentralised Web specification that lets anyone store their data securely in their personal decentralised data stores called Pods and control which applications have access to their data. MPC refers to the set of cryptographic methods for different parties to jointly compute a function over their inputs while keeping those inputs private. Thus, Libertas can also be used to generate synthetic data from otherwise inaccessible Web data in a responsible way, by ensuring contributor autonomy, decentralisation and privacy. However, the scalability of this system remains limited due to the high computation and communication costs in MPC. In this paper, we show how one can improve Libertas using secure enclaves (in addition to MPC) to address the scalability challenge. Secure enclaves such as Intel SGX rely on hardware based features for confidentiality and integrity of code and data. We discuss a principled approach for integrating SGX within the Libertas architecture for scalable differentially private synthetic data generation, and support our analysis with rigorous empirical results on simulated and real datasets and different synthetic data generation algorithms.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 11 of its 35 references that are in the map. First posted on arXiv 30 Oct 2023.

Builds on

11 of 35 references.

References · 11

  1. 2021Winning the NIST Contest: A scalable and general approach to differentially private synthetic datacited by 101
  2. 2022AIM: An Adaptive and Iterative Mechanism for Differentially Private Synthetic Datacited by 88
  3. 2020Local Differential Privacy based Federated Learning for Internet of Thingscited by 74
  4. 2019Graphical-model based estimation and inference for differential privacycited by 73
  5. 2019Collecting and Analyzing Multidimensional Data with Local Differential Privacycited by 46
  6. 2023SoK: Privacy-Preserving Data Synthesiscited by 37
  7. 2020A Survey of Published Attacks on Intel SGXcited by 10
  8. 2018Integrating Remote Attestation with Transport Layer Securitycited by 9
  9. 2022Secure Multiparty Computation for Synthetic Data Generation from Distributed Datacited by 6
  10. 2023Libertas: Privacy-Preserving Collective Computation for Decentralised Personal Data Storescited by 3
  11. 2015Enigma: Decentralized Computation Platform with Guaranteed Privacycited by 1

Built on by

Not cited yet.