Journal of Northeastern University Natural Science ›› 2018, Vol. 39 ›› Issue (8): 1092-1097.DOI: 10.12068/j.issn.1005-3026.2018.08.006

• Information & Control • Previous Articles     Next Articles

Searchable Encryption for Graph Data with Adjacency Query

XU Zi-feng, ZHOU Fu-cai, LI Yu-xi, QIN Shi-yue   

  1. School of Software, Northeastern University, Shenyang 110169, China.
  • Received:2017-04-19 Revised:2017-04-19 Online:2018-08-15 Published:2018-09-12
  • Contact: ZHOU Fu-cai
  • About author:-
  • Supported by:
    -

Abstract: This paper proposes a searchable encryption model for graph data to address the problem that most of the current searchable encryption schemes cannot deal with complex data structures. The algorithms and security models of the scheme are described. Taking the encryption index of matrix structure into account, the detailed description of the searchable encryption scheme for graph data that supports adjacency queries is presented. The scheme utilizes pseudo-random functions and pseudo-random permutations to protect the privacy of the graph data and the encrypted index. Real models and ideal models test the security of the scheme. Compared with traditional searchable encryption schemes, the proposed scheme has more flexible searching ability and higher efficiency, which promotes broader application under big data environment.

Key words: cloud storage, searchable encryption, graph encryption, adjacency matrix, encrypted index

CLC Number: