Please use this identifier to cite or link to this item:
|Title:||Verifying completeness of relational query answers from online servers|
|Keywords:||Query answer verification|
Secure database systems
|Citation:||Pang, H., Tan, K.-L. (2008). Verifying completeness of relational query answers from online servers. ACM Transactions on Information and System Security 11 (2). ScholarBank@NUS Repository. https://doi.org/10.1145/1330332.1330337|
|Abstract:||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. © 2008 ACM.|
|Source Title:||ACM Transactions on Information and System Security|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 21, 2019
WEB OF SCIENCETM
checked on Mar 12, 2019
checked on Feb 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.