Abstract
We explore the area of searchable encryption aiming to identify the schemes supporting multiple data owner (writers) and multiple data users (readers). Especially, we observe multi-writer multi-reader (MWMR) searchable encryption schemes focusing on multi-keyword search. However, such MWMR schemes offer a centralised token generation approach whereby an enterprise trusted authority (ETA) issues a search token to each reader in system, and thus introduce two serious issues, viz. leakage of keywords to ETA and O(q · R) communication overhead for R readers and q queries per reader. In this paper, we alleviate these issues by proposing an MWMR scheme with a decentralised token generation approach. With such an approach, a registered data reader constructs a search token without interacting with ETA and thus provides an efficient token generation with keyword privacy from ETA. Additionally, we incorporate a more expressive especially, conjunctive keyword search with the scheme. With formal security analysis, we prove that the scheme effectively stands against chosen keyword attack performed by inside or outside attacker. With theoretical and empirical analysis, we justify the effectiveness of the proposed scheme.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Information and Computer Security
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
