A Survey of Privacy Preserving Subgraph Matching Methods
摘要
Due to the widespread of large-scale graph data and the increasing popularity of cloud computation, more and more graph processing tasks are outsourced to the cloud. Since graph data has rich information such as node information and edge information, a fundamental challenge is to minimize the overhead of subgraph matching without leakage of the sensitive information of graphs. This paper presents a survey of recent methods for privacy-preserving subgraph matching. Finally, this paper provides valuable insights and possible future directions.