Verifiable Public Key Encryption With Keyword Search Based on Homomorphic Encryption in Multi-User Setting

Data security and privacy concerns are important issues in cloud storage. In this paper, we propose a verifiable public key encryption with keyword search based on homomorphic encryption in multi-user setting. By employing van Dijk, Gentry, Halevi, and Vaikuntanathan homomorphic encryption, the proposed scheme enables the cloud server to generate an inverted encryption index structure without using a query trapdoor, which significantly improves the efficiency of search. On the other hand, the proposed scheme presents a new authenticated data structure based on the inverted encryption index structure, and shows how to apply it to verify the correctness and completeness of search results. Moreover, the proposed scheme allows multiple users to perform encrypted keyword search over encrypted data. Finally the proposed scheme is proved secure based on the approximate-GCD problem. The experiment results demonstrate the proposed scheme has less computation overhead than the existing schemes.

Abstract licence: CC BY-NC-ND

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.