Loading

VOTE: Verifiable Auditing for Outsourced Database with Token Enforced Cloud Storage
Geeta C M1, Rashmi B N2, Nikhil R C3, Rajkumar Buyya4, Venugopal K R5

1Geeta C Mara*, CSE, University Visvesvaraya College of Engg, Bangalore University, Bangalore, India.
2Rashmi B N, CSE, University Visvesvaraya College of Engg, Bangalore University, Bangalore, India.
3Nikhil R C, ASE, Jain University, Bengaluru, India.
4Rajkumar Buyya, CSE, The University of Melbourne, Australia.
5Venugopal K R, Bangalore University, Bangalore, India.
Manuscript received on November 21, 2019. | Revised Manuscript received on December 15, 2019. | Manuscript published on December 30, 2019. | PP: 5156-5166  | Volume-9 Issue-2, December, 2019. | Retrieval Number: B3930129219/2019©BEIESP | DOI: 10.35940/ijeat.B3930.129219
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: Database deploying is one of the remarkable utilities in cloud computing where the Information Proprietor (IP) assigns the database administration to the Cloud Service Provider (CSP) in order to lower the administration overhead and preservation expenditures of the database. Regardless of its overwhelming advantages, it experiences few security problems such as confidentiality of deployed database and auditability of search outcome. In recent past, survey has been carried out on the auditability of search outcome of deployed database that gives preciseness and intactness of search outcome. But in the prevailing schemes, since there is flow of data between IP and the clients repeatedly, huge communication cost is incurred at the Information Proprietor side. To address this challenge, we introduce Verifiable Auditing of Outsourced Database with Token Enforced Cloud Storage (VOTE) mechanism based on Merkle Hash Tree (MHT), Invertible Bloom Filter(IBF) and Counting Bloom Filter(CBF). The proposed scheme reduces the huge communication cost at the Information Proprietor side and achieves preciseness and intactness of the search outcome. Experimental analysis show that the proposed scheme has totally reduced the huge communication cost at the Information Proprietor side, and simultaneously achieves the preciseness and intactness of search outcome though the semi- trusted CSP deliberately sends a null set.
Keywords: Cloud Computing, Database Encryption, Integrity Auditing, Invertible Bloom Filter, Outsourcing Computation, Query Auditing.