Author
Listed:
- Abdul Nasir Khan
- Ayesha Naveed
- Abid Mehmood
- Deepak Arora
- Atta ur Rehman Khan
- Javid Ali
Abstract
The utilization of on-demand remote cloud services provides a flexible way to fulfill the demands of emerging resource-intensive applications. However, migrating data to the cloud also introduced security threats, including unauthorized access and information theft. To resolve this issue, the existing solutions encrypt information locally before uploading it to the server. This process provides information protection with the limitation of non-searchable data. To overcome this limitation, searchable encryption has emerged as a promising cryptographic technique. Some existing searchable encryption techniques are facing data leakage issues by exposing search queries or data to the cloud service provider. Another class of existing searchable schemes introduces processing cost or communication overhead for the data user. The recent searchable solution that is both secure and efficient for data users is Labeled Searchable Encryption (LSE). However, LSE cannot manage large datasets effectively and introduces communication overhead on the data user side. To ensure that Secure Searchable Encryption (SSE) can meet the demands of modern data-driven applications without compromising security and performance, this study aims to investigate and develop novel approaches to enhance the efficiency and security of SSE for large datasets. Experimental findings have proved that the proposed BloomSec is much more efficient and scalable than the classic method of Labeled Searchable Encryption (LSE), consuming significantly less overhead for users, which makes it practically useful for a large dataset without compromising security.
Suggested Citation
Abdul Nasir Khan & Ayesha Naveed & Abid Mehmood & Deepak Arora & Atta ur Rehman Khan & Javid Ali, 2025.
"BloomSec: Scalable and privacy-preserving searchable encryption for cloud environments,"
PLOS ONE, Public Library of Science, vol. 20(12), pages 1-21, December.
Handle:
RePEc:plo:pone00:0336944
DOI: 10.1371/journal.pone.0336944
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0336944. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.