The Community for Technology Leaders
2015 IEEE 31st International Conference on Data Engineering (ICDE) (2015)
Seoul, South Korea
April 13, 2015 to April 17, 2015
ISBN: 978-1-4799-7964-6
pp: 339-350
Zhe Fan , Department of Computer Science, Hong Kong Baptist University, China
Byron Choi , Department of Computer Science, Hong Kong Baptist University, China
Jianliang Xu , Department of Computer Science, Hong Kong Baptist University, China
Sourav S Bhowmick , School of Computer Engineering, Nanyang Technological University, Singapore
ABSTRACT
One fundamental type of query for graph databases is subgraph isomorphism queries (a.k.a subgraph queries). Due to the computational hardness of subgraph queries coupled with the cost of managing massive graph data, outsourcing the query computation to a third-party service provider has been an economical and scalable approach. However, confidentiality is known to be an important attribute of Quality of Service (QoS) in Query as a Service (QaaS). In this paper, we propose the first practical private approach for subgraph query services, asymmetric structure-preserving subgraph query processing, where the data graph is publicly known and the query structure/topology is kept secret. Unlike other previous methods for subgraph queries, this paper proposes a series of novel optimizations that only exploit graph structures, not the queries. Further, we propose a robust query encoding and adopt the novel cyclic group based encryption so that query processing is transformed into a series of private matrix operations. Our experiments confirm that our techniques are efficient and the optimizations are effective.
INDEX TERMS
Cascading style sheets, Encoding, Encryption, Privacy, Optimization, Computational modeling
CITATION

Z. Fan, B. Choi, J. Xu and S. S. Bhowmick, "Asymmetric structure-preserving subgraph queries for large graphs," 2015 IEEE 31st International Conference on Data Engineering (ICDE), Seoul, South Korea, 2015, pp. 339-350.
doi:10.1109/ICDE.2015.7113296
85 ms
(Ver 3.3 (11022016))