Multi-writer Multi-reader Boolean Keyword Searchable Encryption
- PDF / 1,203,593 Bytes
- 21 Pages / 595.276 x 790.866 pts Page_size
- 1 Downloads / 229 Views
RESEARCH ARTICLE-COMPUTER ENGINEERING AND COMPUTER SCIENCE
Multi-writer Multi-reader Boolean Keyword Searchable Encryption Dhruti Sharma1
· Devesh Jinwala2
Received: 1 January 2020 / Accepted: 23 July 2020 © King Fahd University of Petroleum & Minerals 2020
Abstract In traditional public key searchable encryption (PKSE), a data owner (writer) utilizes data user’s (reader) public key to build ciphertexts. Thus, to share D data items (W keywords per item) with R readers, a writer suffers from O(R · D · W ) computational overhead. Researchers then offer numerous schemes supporting multiple readers with optimal overhead, i.e., O(D · W ). However, these schemes support either a single-keyword search or multi-keyword search in single-writer multireader (SWMR) setting where a writer could share data with the known set of readers. On the other hand, the existing multi-writer multi-reader (MWMR) PKSE offers Boolean search but suffers from O(R · D · W ) computational overhead for each writer. We observe applications desiring PKSE where writers could share data with the unknown set of readers and readers could perform search across data for Boolean query. Since the existing literature lacks such schemes, we propose a multi-writer multi-reader Boolean keyword searchable encryption (MWMR-BKSE) where the separate sets of registered readers and writers are prepared. Once registered, the writer could compute ciphertexts without knowing the potential readers and the readers could search across data at any time. The computational overhead on each writer is optimal O(D · W ). Additionally, a deregistered client would not be able to further write or read data. With MWMR-BKSE, we offer a Boolean keyword search utilizing key policy attribute-based encryption. The security of ciphertext against chosen keyword attack is proved using full security model. With the detailed theoretical analysis and extensive simulations on real-world datasets, we demonstrate the effectiveness of MWMR-BKSE. Keywords Multi-user searchable encryption · Multi-keyword search · Key policy attribute-based searchable encryption · Full security
1 Introduction 1.1 Background Cloud computing offers an economical platform for data storage and easy data sharing. With cloud technology, a data owner uploads data viz. emails, personalized files (pictures/videos), healthcare records, financial information, etc. onto cloud storage server to share it with the potential data users. However, data owner and cloud service provider may not be in the same trusted domain, and hence, security and privacy of the stored data would be a critical issue. Though data encryption ensures security, it makes a simple data pro-
B
Dhruti Sharma [email protected]
1
Information Technology Department, Sarvajanik College of Engineering and Technology, Surat, Gujarat, India
2
Computer Engineering Department, S. V. National Institute of Technology, Surat, Gujarat, India
cessing such as search across data more complex. To resolve the issue, the notion of searchable encryption (SE) has
Data Loading...
