Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs

Differentially Private All-Pairs Shortest Distances for Low Tree-Width Graphs

In this paper, we present a polynomial time algorithm for the problem of differentially private all pair shortest distances over the class of low tree-width graphs. Our result generalizes the result of Sealfon 2016 for the case of trees to a much larger family of graphs. Furthermore, if we restrict...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ebrahimi, Javad B, Mohammadi, Alireza Tofighi, Kermani, Fatemeh
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Cryptography and Security
Computer Science - Data Structures and Algorithms
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we present a polynomial time algorithm for the problem of differentially private all pair shortest distances over the class of low tree-width graphs. Our result generalizes the result of Sealfon 2016 for the case of trees to a much larger family of graphs. Furthermore, if we restrict to the class of low tree-width graphs, the additive error of our algorithm is significantly smaller than that of the best known algorithm for this problem, proposed by Chen et. al. 2023.
DOI:10.48550/arxiv.2306.05916