Efficient keyword search using encrypted text in grid computing architecture
by S. Gomathi; D. Manimegalai
International Journal of Business Information Systems (IJBIS), Vol. 21, No. 2, 2016

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.

Online publication date: Wed, 20-Jan-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Information Systems (IJBIS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com