PPDA: A Privacy Preserving Framework for Distributed Graph Learning

doi:10.1007/978-981-96-7036-9_21

PPDA: A Privacy Preserving Framework for Distributed Graph Learning

2026-01-01

0

PRE

AI

DOI：10.1007/978-981-96-7036-9_21

Original

Original request for help

Save

Abstract

En 中文

Graph-based learning finds wide application in social networks, robotics, communication, and medicine. However, datasets often contain sensitive information, hindering their use in graph learning applications due to privacy concerns. Existing privacy-preserving methods pre-process the data to extract user-side features, and only these features are used for subsequent learning. Unfortunately, these methods are vulnerable to adversarial attacks to infer private attributes. We present a novel privacy-respecting framework for distributed graph learning and graph-based machine learning. In order to perform graph learning and other downstream tasks on the server side, this framework aims to learn features as well as distances without requiring actual features while preserving the original structural properties of the raw data. The proposed framework is quite generic and highly adaptable. We demonstrate the utility of the Euclidean space, but it can be applied with any existing method of distance approximation and graph learning for the relevant spaces. Through extensive experimentation on both synthetic and real datasets, we demonstrate the efficacy of the framework in terms of comparing the results obtained without data sharing to those obtained with data sharing as a benchmark. This is, to our knowledge, the first privacy-preserving distributed graph learning framework.

Keywords:

Privacy

Distance approximation

anonymized embeddings

Graph learning

Graph-based clustering

PPDA: A Privacy Preserving Framework for Distributed Graph Learning

Abstract

Journal

Organization