Verifying Completeness of Relational Query Answers from Online Servers

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...

Full description

Saved in:
Bibliographic Details
Main Authors: PANG, Hwee Hwa, TAN, Kian-Lee
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2008
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/778
https://ink.library.smu.edu.sg/context/sis_research/article/1777/viewcontent/Verifying_Completeness_of_Relational_Query_Answers_from_Online_Servers__edited_.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-1777
record_format dspace
spelling sg-smu-ink.sis_research-17772017-07-11T13:13:15Z Verifying Completeness of Relational Query Answers from Online Servers PANG, Hwee Hwa TAN, Kian-Lee 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-05-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/778 info:doi/10.1145/1330332.1330337 https://ink.library.smu.edu.sg/context/sis_research/article/1777/viewcontent/Verifying_Completeness_of_Relational_Query_Answers_from_Online_Servers__edited_.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Query answer verification Secure database systems Databases and Information Systems Numerical Analysis and Scientific Computing
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Query answer verification
Secure database systems
Databases and Information Systems
Numerical Analysis and Scientific Computing
spellingShingle Query answer verification
Secure database systems
Databases and Information Systems
Numerical Analysis and Scientific Computing
PANG, Hwee Hwa
TAN, Kian-Lee
Verifying Completeness of Relational Query Answers from Online Servers
description 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.
format text
author PANG, Hwee Hwa
TAN, Kian-Lee
author_facet PANG, Hwee Hwa
TAN, Kian-Lee
author_sort PANG, Hwee Hwa
title Verifying Completeness of Relational Query Answers from Online Servers
title_short Verifying Completeness of Relational Query Answers from Online Servers
title_full Verifying Completeness of Relational Query Answers from Online Servers
title_fullStr Verifying Completeness of Relational Query Answers from Online Servers
title_full_unstemmed Verifying Completeness of Relational Query Answers from Online Servers
title_sort verifying completeness of relational query answers from online servers
publisher Institutional Knowledge at Singapore Management University
publishDate 2008
url https://ink.library.smu.edu.sg/sis_research/778
https://ink.library.smu.edu.sg/context/sis_research/article/1777/viewcontent/Verifying_Completeness_of_Relational_Query_Answers_from_Online_Servers__edited_.pdf
_version_ 1770570709689434112