Privacy-assured Boolean Adjacent Vertex Search over Encrypted Graph Data in Cloud Computing

被引:0
|
作者
Zhu, Hong [1 ]
Wu, Bin [1 ]
Xie, Meiyi [1 ]
Cui, Zongmin [2 ]
机构
[1] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan, Peoples R China
[2] Jiujiang Univ, Sch Informat Sci & Technol, Jiujiang, Peoples R China
关键词
encrypted graph; boolean expression; adjacent vertex search; cloud computing; searchable encryption; STRUCTURED DATA; MANAGEMENT; SCHEME; QUERY;
D O I
10.3837/tiis.2016.10.029
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the popularity of cloud computing, many data owners outsource their graph data to the cloud for cost savings. The cloud server is not fully trusted and always wants to learn the owners' contents. To protect the information hiding, the graph data have to be encrypted before outsourcing to the cloud. The adjacent vertex search is a very common operation, many other operations can be built based on the adjacent vertex search. A boolean adjacent vertex search is an important basic operation, a query user can get the boolean search results. Due to the graph data being encrypted on the cloud server, a boolean adjacent vertex search is a quite difficult task. In this paper, we propose a solution to perform the boolean adjacent vertex search over encrypted graph data in cloud computing (BASG), which maintains the query tokens and search results privacy. We use the Gram-Schmidt algorithm and achieve the boolean expression search in our paper. We formally analyze the security of our scheme, and the query user can handily get the boolean search results by this scheme. The experiment results with a real graph data set demonstrate the efficiency of our scheme.
引用
收藏
页码:5171 / 5189
页数:19
相关论文
共 50 条
  • [1] Privacy-assured substructure similarity query over encrypted graph-structured data in cloud
    Zhang, Yingguang
    Su, Sen
    Wang, Yulong
    Chen, Weifeng
    Yang, Fangchun
    SECURITY AND COMMUNICATION NETWORKS, 2014, 7 (11) : 1933 - 1944
  • [2] Achieving Usable and Privacy-assured Similarity Search over Outsourced Cloud Data
    Wang, Cong
    Ren, Kui
    Yu, Shucheng
    Urs, Karthik Mahendra Raje
    2012 PROCEEDINGS IEEE INFOCOM, 2012, : 451 - 459
  • [3] Privacy-Assured Similarity Query over Graph-Structured Data in Mobile Cloud
    Zhang, Yingguang
    Su, Sen
    Chen, Weifeng
    Wang, Yulong
    Xu, Peng
    Yang, Fangchun
    2013 33RD IEEE INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS WORKSHOPS (ICDCSW 2013), 2013, : 398 - 403
  • [4] Enabling Efficient Privacy-Assured Outlier Detection Over Encrypted Incremental Data Sets
    Lai, Shangqi
    Yuan, Xingliang
    Sakzad, Amin
    Salehi, Mahsa
    Liu, Joseph K.
    Liu, Dongxi
    IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (04) : 2651 - 2662
  • [5] Enabling Privacy-Assured Similarity Retrieval over Millions of Encrypted Records
    Yuan, Xingliang
    Cui, Helei
    Wang, Xinyu
    Wang, Cong
    COMPUTER SECURITY - ESORICS 2015, PT II, 2015, 9327 : 40 - 60
  • [6] Practical and Privacy-assured Data Indexes for Outsourced Cloud Data
    Zhang, Hongli
    Zhou, Zhigang
    Du, Xiaojiang
    Li, Panpan
    Yu, Xiangzhan
    2013 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2013, : 671 - 676
  • [7] Toward Privacy-Assured and Searchable Cloud Data Storage Services
    Li, Ming
    Yu, Shucheng
    Ren, Kui
    Lou, Wenjing
    Hou, Y. Thomas
    IEEE NETWORK, 2013, 27 (04): : 56 - 62
  • [8] Attribute based Range Search over Encrypted Data for Privacy Preserving in Cloud Computing
    Maseedu, Jeswanth
    Pasupuleti, Syam Kumar
    2018 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2018, : 323 - 329
  • [9] Secure Search Over Encrypted Data in Cloud Computing
    Bakhtiari, Majid
    Nateghizad, Majid
    Zainal, Anazida
    2013 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTER SCIENCE APPLICATIONS AND TECHNOLOGIES (ACSAT), 2014, : 290 - 295
  • [10] Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing
    Cao, Ning
    Yang, Zhenyu
    Wang, Cong
    Ren, Kui
    Lou, Wenjing
    31ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2011), 2011, : 393 - 402