EFFICIENT RETRIEVAL OVER DOCUMENTS ENCRYPTED BY ATTRIBUTES IN CLOUD COMPUTING

Paper ID: EIJTEM_2023_10_2_10-17

Author's Name: Kethavath Shoba , Kalal Bhargava Ram , Marishetty Abhiram , P.Sai Ankith and Dr.P. Srinivasa Rao

Volume: 10

Issue: 2

Year: 2023

Page No: 10-17

Abstract:

Efficient Retrieval over Documents Encrypted by Attributes in Cloud Computing is a research paper that addresses the challenges of searching and retrieving documents that are encrypted using attributes in a cloud computing environment. The paper proposes a novel approach that combines the use of TF-IDF, ARF trees, and DFS algorithms to enable efficient retrieval of encrypted documents based on keyword queries. The proposed approach leverages the use of TF-IDF, which is a popular technique for information retrieval that assigns weights to the terms in a document based on their frequency and importance. The ARF tree is used to organize the encrypted documents based on their attributes, and the DFS algorithm is used to efficiently traverse the tree and locate the relevant documents that match the query. The paper describes the architecture of the proposed approach and provides a detailed analysis of its performance. Experimental results show that the proposed approach can achieve efficient retrieval of encrypted documents with high accuracy and low overhead. The approach is also shown to be scalable and able to handle large volumes of encrypted documents. Overall, the proposed approach represents a significant contribution to the field of information retrieval in cloud computing environments. It addresses an important challenge of securely searching and retrieving encrypted documents based on keyword queries and provides a practical solution that can be applied to real-world scenarios including health care, finance, and legal, where data privacy and security are of utmost importance.

Keywords: Cloud computing, encryption, document security, TF-IDF, ARF Trees, DFS algorithm

View PDF