IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0301277.html
   My bibliography  Save this article

A provably lightweight and secure DSSE scheme, with a constant storage cost for a smart device client

Author

Listed:
  • Salim Sabah Bulbul
  • Zaid Ameen Abduljabbar
  • Rana Jassim Mohammed
  • Mustafa A Al Sibahee
  • Junchao Ma
  • Vincent Omollo Nyangaresi
  • Iman Qays Abduljaleel

Abstract

Outsourcing data to remote cloud providers is becoming increasingly popular amongst organizations and individuals. A semi-trusted server uses Searchable Symmetric Encryption (SSE) to keep the search information under acceptable leakage levels whilst searching an encrypted database. A dynamic SSE (DSSE) scheme enables the adding and removing of documents by performing update queries, where some information is leaked to the server each time a record is added or removed. The complexity of structures and cryptographic primitives in most existing DSSE schemes makes them inefficient, in terms of storage, and query requests generate overhead costs on the Smart Device Client (SDC) side. Achieving constant storage cost for SDCs enhances the viability, efficiency, and easy user experience of smart devices, promoting their widespread adoption in various applications while upholding robust privacy and security standards. DSSE schemes must address two important privacy requirements: forward and backward privacy. Due to the increasing number of keywords, the cost of storage on the client side is also increasing at a linear rate. This article introduces an innovative, secure, and lightweight Dynamic Searchable Symmetric Encryption (DSSE) scheme, ensuring Type-II backward and forward privacy without incurring ongoing storage costs and high-cost query generation for the SDC. The proposed scheme, based on an inverted index structure, merges the hash table with linked nodes, linking encrypted keywords in all hash tables. Achieving a one-time O(1) storage cost without keyword counters on the SDC side, the scheme enhances security by generating a fresh key for each update. Experimental results show low-cost query generation on the SDC side (6,460 nanoseconds), making it compatible with resource-limited devices. The scheme outperforms existing ones, reducing server-side search costs significantly.

Suggested Citation

  • Salim Sabah Bulbul & Zaid Ameen Abduljabbar & Rana Jassim Mohammed & Mustafa A Al Sibahee & Junchao Ma & Vincent Omollo Nyangaresi & Iman Qays Abduljaleel, 2024. "A provably lightweight and secure DSSE scheme, with a constant storage cost for a smart device client," PLOS ONE, Public Library of Science, vol. 19(4), pages 1-23, April.
  • Handle: RePEc:plo:pone00:0301277
    DOI: 10.1371/journal.pone.0301277
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0301277
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0301277&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0301277?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Mustafa A Al Sibahee & Songfeng Lu & Zaid Ameen Abduljabbar & Ayad Ibrahim & Zaid Alaa Hussien & Keyan Abdul-Aziz Mutlaq & Mohammed Abdulridha Hussain, 2018. "Efficient encrypted image retrieval in IoT-cloud with multi-user authentication," International Journal of Distributed Sensor Networks, , vol. 14(2), pages 15501477187, February.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      More about this item

      Statistics

      Access and download statistics

      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:0301277. 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.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.