Verifying completeness of relational query answers from online servers

被引:36
作者
Pang, Hweehwa [1 ]
Tan, Kian-Lee [2 ]
机构
[1] Singapore Management Univ, Sch Informat Syst, Singapore 178902, Singapore
[2] Natl Univ Singapore, Dept Comp Sci, Singapore 117543, Singapore
关键词
query answer verification; secure database systems;
D O I
10.1145/1330332.1330337
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The number of successful attacks on the Internet shows that it is very difficult to guarantee the security of online servers over extended periods of time. A breached server that is not detected in time may return incorrect query answers to users. In this article, we introduce authentication schemes for users to verify that their query answers from an online server are complete ( i. e., no qualifying tuples are omitted) and authentic ( i. e., all the result values are legitimate). We introduce a scheme that supports range selection, projection as well as primary key- foreign key join queries on relational databases. We also present authentication schemes for single- and multi- attribute range aggregate queries. The schemes complement access control mechanisms that rewrite queries dynamically, and are computationally secure. We have implemented the proposed schemes, and experiment results showed that they are practical and feasible schemes with low overheads.
引用
收藏
页码:9:1 / 9:50
页数:50
相关论文
共 42 条
[1]  
Anderson R., 1998, INFORM HIDING
[2]  
[Anonymous], 2003, PROC 1 INT C EMBEDDE
[3]  
Boneh D, 2003, LECT NOTES COMPUT SC, V2656, P416
[4]  
CHENG W, 2006, P 20 ANN IFIP WG 11
[5]   TRUSTED PRODUCTS EVALUATION [J].
CHOKHANI, S .
COMMUNICATIONS OF THE ACM, 1992, 35 (07) :64-76
[6]  
CHUN SJ, 2001, P INT C VER LARG DAT, P521
[7]  
DAMIANI E, 2005, P 2 VLDB WORKSH SEC
[8]  
DAMIANI E, 2005, P 1 WORKSH QUAL PROT
[9]  
DAMIANI E, 2005, P 2 VLDE WORKSH SEC
[10]  
Devanbu P., 2003, Journal of Computer Security, V11, P291