IDEAS home Printed from https://ideas.repec.org/a/gam/jftint/v10y2018i5p38-d144082.html
   My bibliography  Save this article

MinHash-Based Fuzzy Keyword Search of Encrypted Data across Multiple Cloud Servers

Author

Listed:
  • Jingsha He

    (Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China)

  • Jianan Wu

    (Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China)

  • Nafei Zhu

    (Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China)

  • Muhammad Salman Pathan

    (Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China)

Abstract

To enhance the efficiency of data searching, most data owners store their data files in different cloud servers in the form of cipher-text. Thus, efficient search using fuzzy keywords becomes a critical issue in such a cloud computing environment. This paper proposes a method that aims at improving the efficiency of cipher-text retrieval and lowering storage overhead for fuzzy keyword search. In contrast to traditional approaches, the proposed method can reduce the complexity of Min-Hash-based fuzzy keyword search by using Min-Hash fingerprints to avoid the need to construct the fuzzy keyword set. The method will utilize Jaccard similarity to rank the results of retrieval, thus reducing the amount of calculation for similarity and saving a lot of time and space overhead. The method will also take consideration of multiple user queries through re-encryption technology and update user permissions dynamically. Security analysis demonstrates that the method can provide better privacy preservation and experimental results show that efficiency of cipher-text using the proposed method can improve the retrieval time and lower storage overhead as well.

Suggested Citation

  • Jingsha He & Jianan Wu & Nafei Zhu & Muhammad Salman Pathan, 2018. "MinHash-Based Fuzzy Keyword Search of Encrypted Data across Multiple Cloud Servers," Future Internet, MDPI, vol. 10(5), pages 1-18, May.
  • Handle: RePEc:gam:jftint:v:10:y:2018:i:5:p:38-:d:144082
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1999-5903/10/5/38/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1999-5903/10/5/38/
    Download Restriction: no
    ---><---

    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:gam:jftint:v:10:y:2018:i:5:p:38-:d:144082. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.