Efficient algorithms for the key representation auditing scheme.

Asim Abdallah, Elshiekh and Dominic P, Dhanapal Durai (2009) Efficient algorithms for the key representation auditing scheme. [Citation Index Journal]

[img] PDF (Journal paper in IJCEE) - Published Version
Restricted to Registered users only



Abstract—A statistical database (SDB) publishes statistical queries (such as sum, average, count, etc) on subsets of records. Sometimes by stitching the answers of some statistics, a malicious user (snooper) may be able to deduce confidential information about some individuals. The key representation auditing scheme is proposed to guarantee the security of online and dynamic SDBs. The core idea is to convert the original database into key representation database (KRDB), also this scheme involves converting each new user query from string representation into key representation query (KRQ), and stores it in the Audit Query table (AQ table). Three audit stages are proposed to repel the attacks of the snooper to the confidentiality of the individuals. In this paper, efficient algorithms for these stages are presented, namely the First Stage Algorithm (FSA), the Second Stage Algorithm (SSA), and the Third Stage Algorithm (TSA). These algorithms enable the key representation auditor (KRA) to conveniently specify the illegal queries which could lead to disclosing the SDB. Also, cost estimation for this scheme is performed, and we illustrate the saving in block accesses (CPU time) and storage space that are attainable when a KRDB is used.

Item Type:Citation Index Journal
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments / MOR / COE:Departments > Computer Information Sciences
ID Code:3226
Deposited By: Assoc Prof Dr Dhanapal Durai Dominic P
Deposited On:16 Nov 2010 04:01
Last Modified:19 Jan 2017 08:25

Repository Staff Only: item control page

Document Downloads

More statistics for this item...