支持邻接关系查询的图结构密文搜索方案

Searchable Encryption for Graph Data with Adjacency Query

现有的密文搜索方案不支持复杂数据结构,因此,提出一个针对图结构的密文搜索模型,给出其算法的形式化定义及安全模型.利用矩阵结构的加密索引提出一个支持邻接关系查询的图结构密文搜索方案,给出了方案算法的具体描述,并对安全性与效率进行分析.方案使用伪随机函数和伪随机置换,保证了用户的图数据和索引信息不被泄露,并通过现实模型实验和理想模型实验的方法进行安全性证明.对比传统密文搜索方案,该方案支持更加灵活的查询,并拥有更高的效率,在大数据环境下拥有广泛的应用前景.

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.