基于可搜索加密的密态知识图谱存储和检索方案  

An encrypted knowledge graph storage and retrieval scheme based on searchable encryption

作　　者：林庆 滕飞[1] 田波 赵越[1,2] 祝锦烨[1] 冯力 LIN Qing;TENG Fei;TIAN Bo;ZHAO Yue;ZHU Jin-ye;FENG Li(School of Computing and Artificial Intelligence,Southwest Jiaotong University,Chengdu 611756;Science and Technology on Communication Security Laboratory,Chengdu 610041,China)

机构地区：[1]西南交通大学计算机与人工智能学院,四川成都611756 [2]保密通信重点实验室,四川成都610041

出　　处：《计算机工程与科学》2023年第1期66-76,共11页Computer Engineering & Science

基　　金：国家自然科学基金(U20B2049);保密通信重点实验室基金(6142103022204)。

摘　　要：随着云计算的快速发展,知识图谱数据外包成为一种流行的趋势。医疗、金融等诸多领域中的知识图谱有着隐私敏感特性,然而云服务器并不是完全可信的,为了保护数据在云服务器上的机密性和完整性,需要使用加密等方式来保护知识图谱数据的安全。提出了一种基于可搜索加密的密态知识图谱存储方案,可以有效保护数据的机密性和完整性,并且支持在密态数据上的检索。该方案充分考虑了知识图谱实体及其关系顺序读取的必要性,从而对密态索引设计进行优化,加快检索效率。实验结果显示,密态知识图谱的一跳子图查询平均时间为非密态知识图谱的2.09倍,表明该方案在安全性和查询效率上取得了良好的平衡。With the rapid development of cloud computing,knowledge graph data outsourcing has become a popular trend.Knowledge graphs in many fields such as medical and finance have privacy-sensitive characteristics.However,cloud servers are not completely credible.In order to protect the confidentiality and integrity of data on cloud servers,encryption and other methods are used to protect the security of knowledge graph data.This paper proposes an encrypted knowledge graph storage and retrieval scheme based on searchable encryption,which can effectively protect the confidentiality and integrity of data and support retrieval on encrypted data.This scheme fully considers the necessity of sequential reading of knowledge graph entities and their relationships,thereby optimizing the encrypted index design and speeding up the retrieval efficiency.The experimental results show that the average query time of the one-hop subgraph of the encrypted knowledge graph is 2.09 times that of the non-encrypted knowledge graph,which verifies that the scheme achieves a good balance between security and query efficiency.

关 键 词：知识图谱 可搜索加密 属性图 一跳子图查询 密态索引 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]