FIND KEY TO EFFICIENT AND EXPRESSIVE WAY AROUND DATA ENCRYPTION IN THE CLOUD

We propose a file encryption scheme with a hierarchical attribute for specialized files in cloud computing. We recommend the layer type of the access structure to solve the problem of multiple series files that are discussed. We carry out and implement a comprehensive test of the FH-Club penguin-ABE plan. In the existing system, the cost and time to encrypt files is high, the system understands some time and the cost of the expenses is too high. The access structure to the layer is integrated into a single access structure, and then the hierarchical files are encrypted using the integrated access architecture. The encrypted text components associated with the attributes can be shared through files. The penguin-ABE systems of the club are achievable and have a lot of versatility and, therefore, are more suitable for general applications. Several hierarchical discussion files are resolved using the Layer Type access structure. In the proposed system, the encryption text storage and the file encryption time are stored. As the files grow, the benefits of our plan become clearer. Therefore, the storage of encryption text and the price of encryption time of the files are stored. In addition, the proposed plan has proven to be safe under the normative assumption

PROTECTED CLOUD RECORDS UNDER KEY COVERAGE

Improved databases use data as a technical application for many applications. In recent efforts, previous efforts have been completely improved to reduce communication talks. In the firmware system, the basic problem is the privacy of the data to perform encryption services multiple times. We analyse key decryption in control and can decrypt multiple blade words, which have not increased their size. We start by calculating the basic component known as the shared encryption scheme. IMs use less efficient efficiency and manage keyboards for maximum digital use. We learned the cryptographic declaration system which made the keyboard containing encrypted text numbers for decryption representatives or encoded words. Our method is compressed when comparing the function of providing high performance space in all distributed versions related to the control

THE SEAL OF SEARCH WORDS IN MANY DESCRIPTIVE DATASETS

Unlike the tree indicators used in existing companies, our index is less receptive when it comes to increasing dimensions and metrics with multidimensional data. The unwanted candidates are cut in line with the distances between the MBR of the points or keywords and also with the best diameter. NKS queries are useful for many applications, for example, to analyze images in social systems, search for graphics patterns, perform geographic searches in GIS systems, etc. We produce exactly as well as the approximate form of formula. In this document, we consider that objects marked with keywords are baked in a vector space. Keyword-based search in rich, multidimensional data sets helps with many new applications and tools. From these data sets, we observe the queries that request the most precise categories of points that comply with the set of confirmed keywords. Our experimental results in real and synthetic datasets reveal that ProMiSH has up to 60 times more acceleration in tree-based art techniques. We recommend a unique method known as ProMiSH that uses random index structures and random fragmentation and achieves high scalability and acceleration. We carry out extensive experimental studies to demonstrate the performance of the proposed techniques