Privacy-Preserving Query over Encrypted Graph-Structured Data in Cloud Computing

Distributed Computing Systems(2011)

引用 181|浏览0
暂无评分
摘要
In the emerging cloud computing paradigm, data owners become increasingly motivated to outsource their complex data management systems from local sites to the commercial public cloud for great flexibility and economic savings. For the consideration of users' privacy, sensitive data have to be encrypted before outsourcing, which makes effective data utilization a very challenging task. In this paper, for the first time, we define and solve the problem of privacy-preserving query over encrypted graph-structured data in cloud computing (PPGQ), and establish a set of strict privacy requirements for such a secure cloud data utilization system to become a reality. Our work utilizes the principle of "filtering-and-verification". We prebuild a feature-based index to provide feature-related information about each encrypted data graph, and then choose the efficient inner product as the pruning tool to carry out the filtering procedure. To meet the challenge of supporting graph query without privacy breaches, we propose a secure inner product computation technique, and then improve it to achieve various privacy requirements under the known-background threat model.
更多
查看译文
关键词
commercial public cloud,data owner,filtering-and-verification principle,data privacy,cryptography,inner product computation technique,ppgq,data structures,effective data utilization,data utilization,privacy-preserving query,sensitive data,complex data management system,complex data management systems,privacy-preserving query problem,known-background threat model,graph theory,cloud computing paradigm,cloud computing,encrypted graph-structured data,encrypted data graph,secure cloud data utilization,query processing,economic savings,indexation,indexes,complex data,management system,structured data,privacy,encryption,inner product,servers
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要