Privacy-Preserving Dijkstra

ePrint Report: Privacy-Preserving Dijkstra

Benjamin Ostrovsky

Given a graph $G(V,E)$, represented as a secret-sharing of an adjacency list, we show how to obliviously convert it into an alternative, MPC-friendly secret-shared representation, so-called $d$-normalized replicated adjacency list (which we abbreviate to $d$-normalized), where the size of our new data-structure is only 4x larger -- compared to the original (secret-shared adjacency list) representation of $G$. Yet, this new data structure enables us to execute oblivious graph algorithms that simultaneously improve underlying graph …

called data eprint report graph list mpc privacy report representation secret shared sharing size structure