Secure reachability query on private shared graphs

Abstract

Reachability refers to the ability to get from one vertex to another within a graph. In this paper, we investigate the reachability problem on a distributed graph. We consider the scenario where there are two parties, each in possession of a private set of edges, while the vertices are public. The two parties wish to securely determine whether two particular vertices are connected but do not want to reveal any graph information except the result to the other party. Our proposed solution is secure in semi-honest model where each party correctly follows the protocol specification, yet attempts to learn additional information by analyzing the data flow. We discuss the solution for both undirected and directed graph. The experimental result shows that the protocols are efficient and scalable for small and medium size data.

Group Membership Management Framework for Decentralized Collaborative Systems

“…Framework for mngmt. of dec. collaborative applications [22] x SOMEWHERE2 [3] x Dec. authoritative multiplayer architecture [29] x Maintaining transitive closure incrementally [8,23,24,26] x Secure reachability query on private shared graphs [5] x A summary of the discussed related works in relation to the research topics addressed in this paper is presented in Table 3. We take inspiration from different approaches to realizing decentralized collaboration, group management and solving the graph reachability problem using fast, precomputed indices in order to create a novel solution.…”

“…There have been attempts at privacy-preserving reachability algorithms coping with distributed graphs, but they have major limitations. For instance, in [5] the authors show how to perform reachability queries on a distributed graph and private sets of edges. However, the research assumes a two-party system and guarantees security in a semi-honest model, ensuring that only required information is shared between parties.…”