SecGraph: Towards SGX-based Efficient and Confidentiality-Preserving Graph Search

arXiv:2403.19531v1 Announce Type: new
Abstract: Graphs have more expressive power and are widely researched in various search demand scenarios, compared with traditional relational and XML models. Today, many graph search services have been deployed on a third-party server, which can alleviate users from the burdens of maintaining large-scale graphs and huge computation costs. Nevertheless, outsourcing graph search services to the third-party server may invade users' privacy. PeGraph was recently proposed to achieve the encrypted search over the social graph. The …

arxiv can computation confidentiality cs.cr cs.db cs.si demand graph graphs large party power scale search server services sgx third third-party today xml