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

被引:101
作者
Cao, Ning [1 ]
Yang, Zhenyu [1 ]
Wang, Cong [2 ]
Ren, Kui [2 ]
Lou, Wenjing [1 ]
机构
[1] Worcester Polytech Inst, Dept ECE, Worcester, MA 01609 USA
[2] IIT, Dept ECE, Chicago, IL 60616 USA
来源
31ST INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2011) | 2011年
基金
美国国家科学基金会;
关键词
D O I
10.1109/ICDCS.2011.84
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 pre-build 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.
引用
收藏
页码:393 / 402
页数:10
相关论文
共 28 条
[1]  
[Anonymous], 1999, AIDS ANTIVIRAL SCREE
[2]  
Armbrust M, 2009, UCBEECS200928
[3]  
Berreti S., 2001, IEEE T PATTERN ANAL, P2001
[4]  
Boneh D., 2004, P EUROCRYPT
[5]  
Boneh D, 2007, LECT NOTES COMPUT SC, V4392, P535
[6]  
Brinkman, 2007, THESIS U TWENTE
[7]  
Cao N., 2011, P INFOCOM
[8]  
Cheng J., 2007, P SIGMOD
[9]  
Curtmola Reza, 2006, P 13 ACM C COMP COMM, DOI DOI 10.1145/1180405.1180417
[10]  
Garey M. R., 1979, Computers and intractability. A guide to the theory of NP-completeness