Skip to main content
Article
Verifying Completeness of Relational Query Answers from Online Servers
ACM Transactions on Information and System Security
  • Hwee Hwa PANG, Singapore Management University
  • Kian-Lee TAN, National University of Singapore
Publication Type
Journal Article
Version
publishedVersion
Publication Date
5-2008
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.

Keywords
  • Query answer verification,
  • Secure database systems
Identifier
10.1145/1330332.1330337
Publisher
ACM
Creative Commons License
Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International
Additional URL
http://doi.org/10.1145/1330332.1330337
Citation Information
Hwee Hwa PANG and Kian-Lee TAN. "Verifying Completeness of Relational Query Answers from Online Servers" ACM Transactions on Information and System Security Vol. 11 Iss. 2 (2008) p. 1 - 50 ISSN: 1094-9224
Available at: http://works.bepress.com/hweehwa-pang/3/