Visible to the public Probably Secure Multi-User Multi-Keyword Searchable Encryption Scheme in Cloud Storage

TitleProbably Secure Multi-User Multi-Keyword Searchable Encryption Scheme in Cloud Storage
Publication TypeConference Paper
Year of Publication2019
AuthorsLi, S., Wang, F., Shi, T., Kuang, J.
Conference Name2019 IEEE 3rd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC)
Keywordscipher text keyword, cloud computing, cloud storage, composability, cryptography, data owner, data privacy, data user, decisional Diffie-Hellman, Encryption, encryption workload, Indexes, multi-keyword, Multi-user, privacal data, pubcrawl, Public key, public key cryptography, random oracle model, Receivers, resilience, Resiliency, Searchable encryption, searchable encryption server, secure multiuser multikeyword searchable encryption scheme, security, Servers, simulation program, Trapdoor indistinguishability

Searchable encryption server protects privacal data of data owner from leaks. This paper analyzes the security of a multi-user searchable encryption scheme and points out that this scheme does not satisfy the invisibility of trapdoors. In order to improve the security of the original scheme, this paper proposes a probably secure multi-user multi-keyword searchable encryption scheme. New secheme not only ensures the confidentiality of the cipher text keyword, but also does not increase the encryption workload of the data owner when the new data user joins. In the random oracle model, based on the hard problem of decisional Diffie-Hellman, it is proved that the scheme has trapdoor indistinguishability. In the end, obtained by the simulation program to achieve a new computationally efficient communication at low cost.

Citation Keyli_probably_2019