Abstract

Searchable encryption enables users to search the encrypted data outsourced in a third party. Recently, to serve a wide scenario of data sharing application, multi-user searchable encryption (MUSE) is proposed to realize the encrypted data search for multiple users. In this paper, we concentrate on addressing the authorized keyword search problem for a team with fixed unauthorized members and propose a novel puncture public key encryption with keyword search (PPEKS) scheme with designed access policy. Compared with the existing schemes, our proposal has the following features: our scheme supports team authorized search rather than single-user authorization; the data owner only needs one encrypted copy for all authorized members which is one copy one user in traditional MUSE schemes. In addition, we also conduct a rigorous security analysis on our scheme and make a functional comparison of our scheme with other MUSE schemes. Finally, we perform comprehensive efficiency evaluations on a laptop.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call