Secure Queryable Dynamic Graphs using Blockchain

Abstract

A graph is a non-linear data structure with nodes and edges for depicting relationships between nodes in a wide range of systems such as social networks, maps, dependency network, electronic circuits, etc. Graphs are often inputs to various computational processes such as those for finding shortest paths between nodes, minimum spanning tree, graph coloring, etc. Such algorithms are essential components of many large-scale information systems. Guaranteeing the integrity of responses to various graph queries (like shortest path, number of disjoint sets, etc.) becomes especially challenging for graphs with very large numbers of nodes and/or edges. The goal of the blockchain-based Secure Queryable Dynamic Graphs (SQDG) protocol is to assure the correctness of responses to various types of graph queries, irrespective of the scale of the graph, without the need to rely on trusted third parties.