Privacy-Preserving Reachability Query Services for Massive Networks
暂无分享,去创建一个
[1] Byron Choi,et al. Incremental Maintenance of 2-Hop Labeling of Large Graphs , 2010, IEEE Transactions on Knowledge and Data Engineering.
[2] Jianliang Xu,et al. Privacy-Preserving Reachability Query Services , 2014, DASFAA.
[3] Edith Cohen,et al. Reachability and distance queries via 2-hop labels , 2002, SODA '02.
[4] Jeffrey Xu Yu,et al. Reachability querying: an independent permutation labeling approach , 2014, The VLDB Journal.
[5] Zhe Fan,et al. Privacy-preserving reachability query services for sparse graphs , 2014, 2014 IEEE 30th International Conference on Data Engineering Workshops.
[6] Gerhard Weikum,et al. FERRARI: Flexible and efficient reachability range assignment for graph indexing , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).
[7] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[8] Elisa Bertino,et al. Leakage-free redactable signatures , 2012, CODASPY '12.
[9] Oege de Moor,et al. A memory efficient reachability data structure through bit vector compression , 2011, SIGMOD '11.
[10] James Cheng,et al. TF-Label: a topological-folding labeling scheme for reachability querying in a large graph , 2013, SIGMOD '13.
[11] Elisa Bertino,et al. Efficient Leakage-free Authentication of Trees, Graphs and Forests , 2012, IACR Cryptol. ePrint Arch..
[12] Elisa Bertino,et al. Efficient tree pattern queries on encrypted XML documents , 2013, EDBT '13.
[13] Mohammed J. Zaki,et al. GRAIL , 2010, Proc. VLDB Endow..
[14] Yang Xiang,et al. 3-HOP: a high-compression indexing scheme for reachability query , 2009, SIGMOD Conference.
[15] Jeffrey Xu Yu,et al. SCARAB: scaling reachability computation on large graphs , 2012, SIGMOD Conference.
[16] Kyriakos Mouratidis,et al. Shortest Path Computation with No Information Leakage , 2012, Proc. VLDB Endow..
[17] Gerhard Weikum,et al. HOPI: An Efficient Connection Index for Complex XML Document Collections , 2004, EDBT.
[18] Yang Xiang,et al. Path-tree: An efficient reachability indexing scheme for large directed graphs , 2011, TODS.
[19] Lei Zou,et al. Privacy Preserving Subgraph Matching on Large Graphs in Cloud , 2016, SIGMOD Conference.
[20] Eyal Kushilevitz,et al. Private information retrieval , 1998, JACM.
[21] Philip S. Yu,et al. Fast computing reachability labelings for large graphs with high compression rate , 2008, EDBT '08.
[22] Jianliang Xu,et al. Structure-Preserving Subgraph Query Services , 2015, IEEE Transactions on Knowledge and Data Engineering.
[23] Xiaodong Lin,et al. Reachability Analysis in Privacy-Preserving Perturbed Graphs , 2010, 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology.
[24] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[25] Nikos Mamoulis,et al. Secure kNN computation on encrypted databases , 2009, SIGMOD Conference.
[26] Elisa Bertino,et al. How to authenticate graphs without leaking , 2010, EDBT '10.
[27] Jing Cai,et al. Path-hop: efficiently indexing large graphs for reachability queries , 2010, CIKM.
[28] Ulf Leser,et al. Fast and practical indexing and querying of very large graphs , 2007, SIGMOD '07.
[29] Cong Wang,et al. Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing , 2011, 2011 31st International Conference on Distributed Computing Systems.
[30] Jeffrey Xu Yu,et al. Neighborhood-privacy protected shortest distance computing in cloud , 2011, SIGMOD '11.
[31] Lei Zou,et al. Answering label-constraint reachability in large graphs , 2011, CIKM '11.
[32] Yun Peng,et al. Towards Efficient Authenticated Subgraph Query Service in Outsourced Graph Databases , 2014, IEEE Transactions on Services Computing.