Enhancing Privacy in Graph Algorithms: Data-Oblivious Approaches to DFS and Dijkstra's Algorithm

Abstract

Data obliviousness is characterized by a consistent sequence of operations irrespective of input data and data-independent memory accesses, making it a suitable solution for users utilizing outsourced storage data services who aim to conceal their data access patterns. In ACM SIGSAC 2013, data-oblivious algorithms were introduced for breadth-first search, single-source single-destination (SSSD) algorithms, maximum flow, and minimum spanning tree. In this study, we present novel data-oblivious algorithms designed for depth-first search and single-source shortest path (Dijkstra’s algorithm). Our proposed data-oblivious algorithms demonstrate efficiency comparable to non-data-oblivious counterparts, particularly for graphs containing fewer than 1000 nodes. This research contributes to advancing data privacy in outsourced storage services by providing effective data-oblivious solutions for common graph algorithms.