Enabling Privacy-Preserving Shortest Distance Queries on Encrypted Graph Data
暂无分享,去创建一个
Xiangjian He | Jinjun Chen | Chang Liu | Liehuang Zhu | Chang Liu | Jinjun Chen | Xiangjian He | Liehuang Zhu
[1] Ya Wang,et al. Cloud Storage as the Infrastructure of Cloud Computing , 2010, 2010 International Conference on Intelligent Computing and Cognitive Informatics.
[2] Shiri Chechik,et al. Approximate Distance Oracle with Constant Query Time , 2013, ArXiv.
[3] Kyriakos Mouratidis,et al. Shortest Path Computation with No Information Leakage , 2012, Proc. VLDB Endow..
[4] Jianliang Xu,et al. Privacy-Preserving Reachability Query Services , 2014, DASFAA.
[5] George Kollios,et al. GRECS: Graph Encryption for Approximate Shortest Distance Queries , 2015, IACR Cryptol. ePrint Arch..
[6] Carl A. Gunter,et al. Dynamic Searchable Encryption via Blind Storage , 2014, 2014 IEEE Symposium on Security and Privacy.
[7] Haixun Wang,et al. Toward a Distance Oracle for Billion-Node Graphs , 2013, Proc. VLDB Endow..
[8] Rafail Ostrovsky,et al. Searchable symmetric encryption: improved definitions and efficient constructions , 2006, CCS '06.
[9] K. Liu,et al. Towards identity anonymization on graphs , 2008, SIGMOD Conference.
[10] Nickolai Zeldovich,et al. An Ideal-Security Protocol for Order-Preserving Encoding , 2013, 2013 IEEE Symposium on Security and Privacy.
[11] Hugo Krawczyk,et al. Dynamic Searchable Encryption in Very-Large Databases: Data Structures and Implementation , 2014, NDSS.
[12] Melissa Chase,et al. Structured Encryption and Controlled Disclosure , 2010, IACR Cryptol. ePrint Arch..
[13] Takuya Akiba,et al. Fast exact shortest-path distance queries on large networks by pruned landmark labeling , 2013, SIGMOD '13.
[14] Berthier A. Ribeiro-Neto,et al. Efficient search ranking in social networks , 2007, CIKM '07.
[15] Hugo Krawczyk,et al. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries , 2013, IACR Cryptol. ePrint Arch..
[16] Andreas Peter,et al. A Survey of Provably Secure Searchable Encryption , 2014, ACM Comput. Surv..
[17] Brighten Godfrey,et al. Approximate distance queries and compact routing in sparse graphs , 2011, 2011 Proceedings IEEE INFOCOM.
[18] Dan Boneh,et al. Evaluating 2-DNF Formulas on Ciphertexts , 2005, TCC.
[19] Elaine Shi,et al. Practical Dynamic Searchable Encryption with Small Leakage , 2014, NDSS.
[20] Yang Xiang,et al. A highway-centric labeling approach for answering distance queries on large sparse graphs , 2012, SIGMOD Conference.
[21] Charalampos Papamanthou,et al. Dynamic searchable symmetric encryption , 2012, IACR Cryptol. ePrint Arch..
[22] Jian Pei,et al. Preserving Privacy in Social Networks Against Neighborhood Attacks , 2008, 2008 IEEE 24th International Conference on Data Engineering.
[23] Toby Velte,et al. Cloud Computing, A Practical Approach , 2009 .
[24] Ken C. K. Lee,et al. Navigational path privacy protection: navigational path privacy protection , 2009, CIKM.
[25] Jure Leskovec,et al. {SNAP Datasets}: {Stanford} Large Network Dataset Collection , 2014 .
[26] Hugo Krawczyk,et al. Outsourced symmetric private information retrieval , 2013, IACR Cryptol. ePrint Arch..
[27] Jeffrey Xu Yu,et al. Neighborhood-privacy protected shortest distance computing in cloud , 2011, SIGMOD '11.
[28] Kristin E. Lauter,et al. Cryptographic Cloud Storage , 2010, Financial Cryptography Workshops.
[29] Andrew V. Goldberg,et al. Hierarchical Hub Labelings for Shortest Paths , 2012, ESA.