The public verifiability of public key encryption with keyword search

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cloud computing has been widely recognized as the next big thing in this era. Users outsourced data to cloud server and cloud server provided service economic savings and various convenience for users. Public key encryption with keyword search (PEKS) which provides a solution for a third party user to search on remote data encrypted by data owner. Since the server may be dishonest, it can perform search operation on encrypted data and only return partial results. Therefore, it is necessary to verify the correctness and completeness of the search result. Existing PEKS schemes only support data receiver’s private verification, however, in practice, we usually need anyone can verify the server’s search result. In this paper, we propose a PEKS with public verifiability scheme, which can achieve the security of ciphertext indistinguishability, trapdoor indistinguishability, keyword guessing attack and public verifiability. Comparing previous PEKS schemes, our scheme is public verifiability, while keeping the encrypted data security in cloud server and search operation privately over the encrypted data.

Cite

CITATION STYLE

APA

Zhu, B., Sun, J., Qin, J., & Ma, J. (2018). The public verifiability of public key encryption with keyword search. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 235, pp. 299–312). Springer Verlag. https://doi.org/10.1007/978-3-319-90775-8_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free