IDEAS home Printed from https://ideas.repec.org/a/ids/ijbisy/v21y2016i2p195-205.html
   My bibliography  Save this article

Efficient keyword search using encrypted text in grid computing architecture

Author

Listed:
  • S. Gomathi
  • D. Manimegalai

Abstract

Searching needs effective key-based cryptographic algorithms. The retrieval of encrypted data from huge set of distributed databases leads to complexity. This study is based on certain set of keywords. Most of the key-based cryptographic algorithms are more effective but each and every algorithm has its own limitations. Sometimes, there arises a huge need to direct the data to grid computing system in the cryptic form. No algorithm in an intelligible form has been made available to the intruders. Complexity and computational overhead attached with these algorithms make the retrieval task more complex and ineffective. To overcome these problems, it is proposed to introduce a novel keyword search technique in the grid computing environment. The result so obtained in keyword search using this novel technique was most effective and with the reduction of retrieval time in the grid computing environment.

Suggested Citation

  • S. Gomathi & D. Manimegalai, 2016. "Efficient keyword search using encrypted text in grid computing architecture," International Journal of Business Information Systems, Inderscience Enterprises Ltd, vol. 21(2), pages 195-205.
  • Handle: RePEc:ids:ijbisy:v:21:y:2016:i:2:p:195-205
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=74258
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijbisy:v:21:y:2016:i:2:p:195-205. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=172 .

    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.