Verification of Boolean Queries over Outsourced Encrypted Data Based on Counting Bloom Filter

Recent years witness the rapid development of cloud computing and more and more data owners outsource their data to the cloud. To eliminate the disclosure of authorized data users´ privacy in cloud services (e.g., cloud storage or cloud-assisted computing)-since the cloud providers cannot be fully trustworthy-several previous works have proposed considerable privacy-preserving schemes by exploiting searchable encryption. However, owing to its feature of untrusty, issue arises on how data users can verify whether the cloud has faithfully executed the search operations or not. Motivated by this question, in this paper, we propose a searchable and verifiable query scheme over encrypted data based on Counting Bloom Filter (CBF). Specifically, we deploy counting bloom filters to generate proofs for data users´ queries in the private cloud; using the consistence between algebra operations on counting bloom filters and on data sets, we can verify the integrity of search result. The security analysis and performance evaluation show that the proposed scheme is privacy-preserving and is feasible to implement.