{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T23:21:46Z","timestamp":1771024906952,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319058092","type":"print"},{"value":"9783319058108","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05810-8_14","type":"book-chapter","created":{"date-parts":[[2014,4,16]],"date-time":"2014-04-16T03:31:25Z","timestamp":1397619085000},"page":"203-219","source":"Crossref","is-referenced-by-count":10,"title":["Privacy-Preserving Reachability Query Services"],"prefix":"10.1007","author":[{"given":"Shuxiang","family":"Yin","sequence":"first","affiliation":[]},{"given":"Zhe","family":"Fan","sequence":"additional","affiliation":[]},{"given":"Peipei","family":"Yi","sequence":"additional","affiliation":[]},{"given":"Byron","family":"Choi","sequence":"additional","affiliation":[]},{"given":"Jianliang","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Shuigeng","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Borgida, A., Jagadish, H.V.: Efficient management of transitive relationships in large data and knowledge bases. SIGMOD (1989)","DOI":"10.1145\/67544.66950"},{"issue":"suppl. 1","key":"14_CR2","doi-asserted-by":"crossref","first-page":"D504","DOI":"10.1093\/nar\/gkj126","volume":"34","author":"G.D. Bader","year":"2006","unstructured":"Bader, G.D., Cary, M.P., Sander, C.: Pathguide: a pathway resource list. Nucleic Acids Research 34(suppl. 1), D504\u2013D506 (2006)","journal-title":"Nucleic Acids Research"},{"issue":"5","key":"14_CR3","first-page":"682","volume":"22","author":"R. Bramandia","year":"2010","unstructured":"Bramandia, R., Choi, B., Ng, W.K.: Incremental maintenance of 2-hop labeling of large graphs. TKDE\u00a022(5), 682\u2013698 (2010)","journal-title":"TKDE"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Cai, J., Poon, C.K.: Path-hop: efficiently indexing large graphs for reachability queries. CIKM, pp. 119\u2013128 (2010)","DOI":"10.1145\/1871437.1871457"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013402 (2011)","DOI":"10.1109\/ICDCS.2011.84"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013204 (2013)","DOI":"10.1145\/2463676.2465286"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1007\/11687238_56","volume-title":"Advances in Database Technology - EDBT 2006","author":"J. Cheng","year":"2006","unstructured":"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\u00f6hm, K., Kemper, A., Grust, T., B\u00f6hm, C. (eds.) EDBT 2006. LNCS, vol.\u00a03896, pp. 961\u2013979. Springer, Heidelberg (2006)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013204 (2008)","DOI":"10.1145\/1353343.1353370"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/293347.293350","volume":"45","author":"B. Chor","year":"1998","unstructured":"Chor, B., et al.: Private information retrieval. J. ACM\u00a045, 965\u2013981 (1998)","journal-title":"J. ACM"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Cohen, E., et al.: Reachability and distance queries via 2-hop labels. In: SODA (2002)","DOI":"10.1137\/S0097539702403098"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. El Gamal","year":"1985","unstructured":"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.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"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\u00a099 (2013)","DOI":"10.1109\/TSC.2013.42"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013420 (2011)","DOI":"10.1145\/1989323.1989367"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"He, X., Vaidya, J., Shafiq, B., Adam, N., Lin, X.: Reachability analysis in privacy-preserving perturbed graphs. In: WI-IAT, pp. 691\u2013694 (2010)","DOI":"10.1109\/WI-IAT.2010.216"},{"key":"14_CR15","unstructured":"Informatics Outsourcing. Outsourcing Solution Service, http:\/\/www.informaticsoutsourcing.com\/"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Jin, R., Ruan, N., Dey, S., Xu, J.Y.: Scarab: scaling reachability computation on large graphs. In: SIGMOD, pp. 169\u2013180 (2012)","DOI":"10.1145\/2213836.2213856"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Jin, R., Ruan, N., Xiang, Y., Wang, H.: Path-tree: An efficient reachability indexing scheme for large directed graphs. TODS, 7:1\u20137:44 (2011)","DOI":"10.1145\/1929934.1929941"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Jin, R., Xiang, Y., Ruan, N., Fuhry, D.: 3-hop: a high-compression indexing scheme for reachability query. In: SIGMOD, pp. 813\u2013826 (2009)","DOI":"10.1145\/1559845.1559930"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Karwa, V., Raskhodnikova, S., Smith, A., Yaroslavtsev, G.: Private analysis of graph structure. In: VLDB, pp. 1146\u20131157 (2011)","DOI":"10.14778\/3402707.3402749"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall\/CRC (2007)","DOI":"10.1201\/9781420010756"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Kundu, A., et al.: How to authenticate graphs without leaking. In: EDBT, pp. 609\u2013620 (2010)","DOI":"10.1145\/1739041.1739114"},{"key":"14_CR22","unstructured":"Kundu, A., et al.: Efficient leakage-free authentication of trees, graphs and forests. IACR Cryptology ePrint Archive, p.\u00a036 (2012)"},{"issue":"6","key":"14_CR23","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/MIC.2002.1067740","volume":"6","author":"D.A. Menasc\u00e9","year":"2002","unstructured":"Menasc\u00e9, D.A.: Qos issues in web services. Internet Computing\u00a06(6), 72\u201375 (2002)","journal-title":"Internet Computing"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Mouratidis et al., K.: Shortest path computation with no information leakage. PVLDB (2012)","DOI":"10.14778\/2212351.2212352"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-540-24741-8_15","volume-title":"Advances in Database Technology - EDBT 2004","author":"R. Schenkel","year":"2004","unstructured":"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\u00f6hm, K. (eds.) EDBT 2004. LNCS, vol.\u00a02992, pp. 237\u2013255. Springer, Heidelberg (2004)"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Seufert, S., Anand, A., Bedathur, S., Weikum, G.: Ferrari: Flexible and efficient reachability range assignment for graph indexing. ICDE, pp. 1009\u20131020 (2013)","DOI":"10.1109\/ICDE.2013.6544893"},{"key":"14_CR27","unstructured":"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,"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Trissl, S., Leser, U.: Fast and practical indexing and querying of very large graphs. In: SIGMOD, pp. 845\u2013856 (2007)","DOI":"10.1145\/1247480.1247573"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"van Schaik, S.J., de Moor, O.: A memory efficient reachability data structure through bit vector compression. In: SIGMOD, pp. 913\u2013924 (2011)","DOI":"10.1145\/1989323.1989419"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Xu, K., Zou, L., Yu, J.X., Chen, L., Xiao, Y., Zhao, D.: Answering label-constraint reachability in large graphs. CIKM, pp. 1595\u20131600 (2011)","DOI":"10.1145\/2063576.2063807"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Yi, P., Fan, Z., Yin, S.: Privacy-preserving reachability query services for sparse graphs. In: GDM (2014)","DOI":"10.1109\/ICDEW.2014.6818298"},{"issue":"1-2","key":"14_CR32","first-page":"276","volume":"3","author":"H. Yildirim","year":"2010","unstructured":"Yildirim, H., Chaoji, V., Zaki, M.J.: Grail: scalable reachability index for large graphs. PVLDB\u00a03(1-2), 276\u2013284 (2010)","journal-title":"PVLDB"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-00887-0_12","volume-title":"Database Systems for Advanced Applications","author":"L. Zhu","year":"2009","unstructured":"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.\u00a05463, pp. 138\u2013152. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Database Systems for Advanced Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05810-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T22:00:22Z","timestamp":1597701622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-05810-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319058092","9783319058108"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05810-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}