Shielding Graph for eXact Analytics with SGX

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on dependable and secure computing 2023-11, Vol.20 (6), p.1-11
Main Authors: Du, Minxin, Jiang, Peipei, Wang, Qian, Chow, Sherman S. M., Zhao, Lingchen
Format: Article
Language:English
Subjects:
Cryptography
Dijkstra's algorithm
Encryption
graph encryption
Graphs
Mathematical analysis
Probabilistic logic
Program processors
Queries
Searchable encryption
Servers
shortest distance query
Software
structured encryption
Trusted computing
trusted execution environment
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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. Finally, we discuss some generic enhancements addressing active adversaries trying to exploit leakages originating from SGX.
ISSN:1545-5971
1941-0018
DOI:10.1109/TDSC.2023.3241164