Abstract
Due to the massive volume of graph data from a wide range of recent applications and resources required to process numerous queries at large scale, it is becoming economically appealing to outsource graph data to a third-party service provider (\(\mathcal{SP}\)), to provide query services. However, \(\mathcal{SP}\) cannot always be trusted. Hence, data owners and query clients may prefer not to expose their data graphs and queries. This paper studies privacy-preserving query services for a fundamental query for graphs namely the reachability query where both clients’ queries and the structural information of the owner’s data are protected. We propose privacy-preserving 2-hop labeling (pp-2-hop) where the queries are computed in an encrypted domain and the input and output sizes of any queries are indistinguishable. We analyze the security of pp-2-hop with respect to ciphertext only and size based attacks. We verify the performance of pp-2-hop with an experimental study on both synthetic and real-world datasets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. SIGMOD (1989)
Bader, G.D., Cary, M.P., Sander, C.: Pathguide: a pathway resource list. Nucleic Acids Research 34(suppl. 1), D504–D506 (2006)
Bramandia, R., Choi, B., Ng, W.K.: Incremental maintenance of 2-hop labeling of large graphs. TKDE 22(5), 682–698 (2010)
Cai, J., Poon, C.K.: Path-hop: efficiently indexing large graphs for reachability queries. CIKM, pp. 119–128 (2010)
Cao, N., Yang, Z., Wang, C., Ren, K., Lou, W.: Privacy-preserving query over encrypted graph-structured data in cloud computing. In: ICDCS, pp. 393–402 (2011)
Cheng, J., Huang, S., Wu, H., Fu, A.: Tf-label: a topological-folding labeling scheme for reachability querying in a large graph. SIGMOD, pp. 193–204 (2013)
Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computation of reachability labeling for large graphs. In: Ioannidis, Y., Scholl, M.H., Schmidt, J.W., Matthes, F., Hatzopoulos, M., Böhm, K., Kemper, A., Grust, T., Böhm, C. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 961–979. Springer, Heidelberg (2006)
Cheng, J., Yu, J.X., Lin, X., Wang, H., Yu, P.S.: Fast computing reachability labelings for large graphs with high compression rate. In: EDBT, pp. 193–204 (2008)
Chor, B., et al.: Private information retrieval. J. ACM 45, 965–981 (1998)
Cohen, E., et al.: Reachability and distance queries via 2-hop labels. In: SODA (2002)
El Gamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 10–18. Springer, Heidelberg (1985)
Fan, Z., Peng, Y., Choi, B., Xu, J., Bhowmick, S.S.: Towards efficient authenticated subgraph query service in outsourced graph databases. IEEE Transactions on Services Computing 99 (2013)
Gao, J., Yu, J.X., Jin, R., Zhou, J., Wang, T., Yang, D.: Neighborhood-privacy protected shortest distance computing in cloud. In: SIGMOD, pp. 409–420 (2011)
He, X., Vaidya, J., Shafiq, B., Adam, N., Lin, X.: Reachability analysis in privacy-preserving perturbed graphs. In: WI-IAT, pp. 691–694 (2010)
Informatics Outsourcing. Outsourcing Solution Service, http://www.informaticsoutsourcing.com/
Jin, R., Ruan, N., Dey, S., Xu, J.Y.: Scarab: scaling reachability computation on large graphs. In: SIGMOD, pp. 169–180 (2012)
Jin, R., Ruan, N., Xiang, Y., Wang, H.: Path-tree: An efficient reachability indexing scheme for large directed graphs. TODS, 7:1–7:44 (2011)
Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: SIGMOD, pp. 813–826 (2009)
Karwa, V., Raskhodnikova, S., Smith, A., Yaroslavtsev, G.: Private analysis of graph structure. In: VLDB, pp. 1146–1157 (2011)
Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall/CRC (2007)
Kundu, A., et al.: How to authenticate graphs without leaking. In: EDBT, pp. 609–620 (2010)
Kundu, A., et al.: Efficient leakage-free authentication of trees, graphs and forests. IACR Cryptology ePrint Archive, p. 36 (2012)
Menascé, D.A.: Qos issues in web services. Internet Computing 6(6), 72–75 (2002)
Mouratidis et al., K.: Shortest path computation with no information leakage. PVLDB (2012)
Schenkel, R., Theobald, A., Weikum, G.: HOPI: An efficient connection index for complex XML document collections. In: Bertino, E., Christodoulakis, S., Plexousakis, D., Christophides, V., Koubarakis, M., Böhm, K. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 237–255. Springer, Heidelberg (2004)
Seufert, S., Anand, A., Bedathur, S., Weikum, G.: Ferrari: Flexible and efficient reachability range assignment for graph indexing. ICDE, pp. 1009–1020 (2013)
Yin, S., Fan, Z., Yi, P., Choi, B., Xu, J., Zhou, S.: Privacy-Preserving Reachability Query Services, http://www.comp.hkbu.edu.hk/~fan/TR20140201.pdf,
Trissl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD, pp. 845–856 (2007)
van Schaik, S.J., de Moor, O.: A memory efficient reachability data structure through bit vector compression. In: SIGMOD, pp. 913–924 (2011)
Xu, K., Zou, L., Yu, J.X., Chen, L., Xiao, Y., Zhao, D.: Answering label-constraint reachability in large graphs. CIKM, pp. 1595–1600 (2011)
Yi, P., Fan, Z., Yin, S.: Privacy-preserving reachability query services for sparse graphs. In: GDM (2014)
Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: scalable reachability index for large graphs. PVLDB 3(1-2), 276–284 (2010)
Zhu, L., Choi, B., He, B., Yu, J.X., Ng, W.K.: A uniform framework for ad-hoc indexes to answer reachability queries on large graphs. In: Zhou, X., Yokota, H., Deng, K., Liu, Q. (eds.) DASFAA 2009. LNCS, vol. 5463, pp. 138–152. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Yin, S., Fan, Z., Yi, P., Choi, B., Xu, J., Zhou, S. (2014). Privacy-Preserving Reachability Query Services. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds) Database Systems for Advanced Applications. DASFAA 2014. Lecture Notes in Computer Science, vol 8421. Springer, Cham. https://doi.org/10.1007/978-3-319-05810-8_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-05810-8_14
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05809-2
Online ISBN: 978-3-319-05810-8
eBook Packages: Computer ScienceComputer Science (R0)