Homomorphic Encryption and Prim's Process for Multi-Keyword Exploration in Encrypted Cloud Data for Trades

Authors:

Abstract
Due to its low administration costs and convenient accessibility, cloud storage is quickly becoming the norm in today's online infrastructure. By letting cloud users save their massive data in the cloud, the cloud storage system offers crucial advantages. Improving cloud storage's performance at data retrieval requires addressing concerns about data privacy and security. This study presents a new algorithm for bolstering security, called Modified Ring-based Fully Homomorphic Encryption and Prim's (MRFHE-P). The ranking function determines how the index is built for keywords and files. Prim's algorithm generates the dynamic tree based on the ordered keywords. The document is encrypted using a variant of the RSA technique called the Modified Ring-Based Fully Homomorphic Encryption Algorithm (MRFHEP). The encrypted files are indexed in a Two-way Hash Table so that users can quickly get the necessary data. Afterwards, the cloud user uses a shared symmetric key and private key to decrypt the encrypted data. The experimental results show that the suggested technique significantly reduces the time needed to encrypt and decrypt data compared to the current standard. The proposed technique also speeds up indexing and searches for a variety of documents. There was also a decrease in the amount of time spent searching and indexing, and an increase in the efficiency with which keywords could be extracted.

This publication has 13 references indexed in Scilit: