Shielding Graph for eXact Analytics With SGX

Published: 2023, Last Modified: 03 Aug 2025IEEE Trans. Dependable Secur. Comput. 2023EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Graphs nicely capture data from various domains, allowing the computations of many analytic tasks via graph queries. Graphs of real-world data are often large, albeit useful, and the involved computation can be too heavyweight for commodity computers. For secure outsourcing, we propose (SGX)$^{2}$, a forward-secure structured encryption scheme for graph data, which uses lightweight cryptographic techniques with a trusted execution environment such as SGX. To process million-scale graphs by the limited memory of SGX, we load data on-demand using Dijkstra's algorithm and Fibonacci heap. Compared with most prior graph encryption schemes, (SGX)$^{2}$ supports exact shortest-distance queries instead of approximation and can be easily extended to other graph-based analytics.
Loading