IDEAS home Printed from https://ideas.repec.org/a/hin/jijmms/3223509.html
   My bibliography  Save this article

A Survey on Public Key Encryption with Keyword Search: Taxonomy and Methods

Author

Listed:
  • M.H. Noorallahzade
  • R. Alimoradi
  • A. Gholami
  • Ram N. Mohapatra

Abstract

Given the many benefits that cloud computing brings, organizations tend to outsource most of their data to reduce a large portion of their costs, but concern about the privacy of data is a major obstacle to outsourcing sensitive data. To solve this problem, public key encryption with keyword search (PEKS) is suggested, which is a widely used method. Addressing this issue separately is beneficial because PEKS does not require a secure communication channel and key distribution. Therefore, at first glance, it seems that PEKS schemes should be used more in practical applications. Thus, reviewing and categorizing PEKS schemes are very important and necessary. In this article, we have tried to help reviewing the public key searchable encryption and categorizing these designs.

Suggested Citation

  • M.H. Noorallahzade & R. Alimoradi & A. Gholami & Ram N. Mohapatra, 2022. "A Survey on Public Key Encryption with Keyword Search: Taxonomy and Methods," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2022, pages 1-10, March.
    • Handle: RePEc:hin:jijmms:3223509
    DOI: 10.1155/2022/3223509
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/ijmms/2022/3223509.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/ijmms/2022/3223509.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/3223509?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ivone Amorim & Ivan Costa, 2023. "Leveraging Searchable Encryption through Homomorphic Encryption: A Comprehensive Analysis," Mathematics, MDPI, vol. 11(13), pages 1-29, July.

    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:hin:jijmms:3223509. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.