Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

Performance Study of Cryptography based Dynamic Multi-Keyword Searchable Security Algorithm in Cloud Using CRSA /B+ Tree

Abstract

Today, Cloud computing is a buzz word in IT industry. Cloud, a shared pool of computing resources, allows access to needed resources on demand through internet and web applications. Since data is outsourced to third party, user needs to maintain the accountability of their data in cloud. Hence preserving the confidentiality and securing the sensitive data in cloud is a major concern. Many cryptographic techniques have been proposed by researchers to assure the confidentiality of the user2019;s data in cloud. But, the challenging task is to provide the secure search over this preserved data which has been encrypted so as to retrieve the effective data. Hence, we are proposing a system to have a secure search over the encrypted data on the cloud which preserves its confidentiality. In our system, a noble approach has been made using the Commutative-RSA algorithm, a cryptographic technique where the dual encryption takes place thus reducing the overall computation overhead. The search operation over the encrypted data is based on the tree search algorithm which supports multi-keyword search. Based on the relevance score, the more appropriate data is retrieved on the search operation. Using this approach, the information is not leaked when the encrypted data is searched by users and also the queries are handled in an efficient way. Finally, we demonstrate the effectiveness and efficiency of the proposed schemes through extensive experimental evaluation

Similar works

Full text

thumbnail-image

Global Journal of Computer Science and Technology (GJCST)

redirect
Last time updated on 19/10/2022

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.