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

Searchable and revocable multi-data owner attribute-based encryption scheme with hidden policy in cloud storage

Author

Listed:
  • Shangping Wang
  • Tingting Gao
  • Yaling Zhang

Abstract

With the development of outsourcing data services, data security has become an urgent problem that needs to be solved. Attribute-based encryption is a valid solution to data security in cloud storage. There is no existing scheme that can guarantee the privacy of access structures and achieve attribute-based encryption with keyword search and attribute revocation. In this article, we propose a new searchable and revocable multi-data owner attribute-based encryption scheme with a hidden policy in cloud storage. In the new scheme, the same access policy is used in both the keyword index and message encryption. The advantage of keyword index with access policy is that as long as a user’s attributes satisfy the access policy, the searched ciphertext can be correctly decrypted. This property improves the accuracy of the search results. The hidden policy is used in both the ciphertext and the keyword index to protect users’ privacy. The new scheme contains attribute revocation, which is suitable for the actual situation that a user’s attributes maybe changed over time. In the general bilinear group model, the security of the scheme is demonstrated, and the efficiency of the scheme is analyzed.

Suggested Citation

  • Shangping Wang & Tingting Gao & Yaling Zhang, 2018. "Searchable and revocable multi-data owner attribute-based encryption scheme with hidden policy in cloud storage," PLOS ONE, Public Library of Science, vol. 13(11), pages 1-19, November.
    • Handle: RePEc:plo:pone00:0206126
    DOI: 10.1371/journal.pone.0206126
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0206126
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0206126&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0206126?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. Dingde Jiang & Zhengzheng Xu & Jindi Liu & Wenhui Zhao, 2016. "An optimization-based robust routing algorithm to energy-efficient networks for cloud computing," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 63(1), pages 89-98, September.
    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.
    1. S. M. Reza Dibaj & Ali Miri & SeyedAkbar Mostafavi, 2020. "A cloud dynamic online double auction mechanism (DODAM) for sustainable pricing," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 75(4), pages 461-480, December.
    2. Wenyi Tang & Ke Zhang & Dingde Jiang, 2018. "Physarum-inspired routing protocol for energy harvesting wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 67(4), pages 745-762, April.
    3. Mohammed Joda Usman & Abdul Samad Ismail & Gaddafi Abdul-Salaam & Hassan Chizari & Omprakash Kaiwartya & Abdulsalam Yau Gital & Muhammed Abdullahi & Ahmed Aliyu & Salihu Idi Dishing, 2019. "Energy-efficient Nature-Inspired techniques in Cloud computing datacenters," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 71(2), pages 275-302, June.

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