Efficient Fine Grained Access Control with Semantic Keyword Search on Encrypted Cloud Storage

Using cloud computing, multi data owner can store their data on remote servers and allow data access to private users through the cloud servers.The cloud characteristics are on-demand self-service, location independent network access, ubiquitous network access and usage based pay. Due to this charming features private and public organization are outsourcing their large amount of data on cloud storage. First, we introduce in the cloud framework for multi data owners. Multi data owners upload the files in encrypted form using ECC algorithm. User can register the aadhar card number to the cloud multi data owner. The multi data owner can generate the two keys to allow access the data. User can request to multi data owner. Cloud data storage can provide the encrypted data. This encrypted data is strong protection for data backup and recovery purposes. There are two keys are used in the plaintext form to be converted in the cipher text form. Another key will generate and converted in the decrypt form using fuzzy method and semantic search. Finally user can retrieve the data from the server and access our data.The existing solutions supports only identical keyword search, semantic search is not supported. In the project we proposed semantic multi-keyword ranked search system with verifiable outsourced decryption. To improve search efficiency this system includes semantic search by using fuzzy search

Achieving Secure and Efficient Cloud Search Services: Cross-Lingual Multi-Keyword Rank Search over Encrypted Cloud Data

Multi-user multi-keyword ranked search scheme in arbitrary language is a novel multi-keyword rank searchable encryption (MRSE) framework based on Paillier Cryptosystem with Threshold Decryption (PCTD). Compared to previous MRSE schemes constructed based on the k-nearest neighbor searcha-ble encryption (KNN-SE) algorithm, it can mitigate some draw-backs and achieve better performance in terms of functionality and efficiency. Additionally, it does not require a predefined keyword set and support keywords in arbitrary languages. However, due to the pattern of exact matching of keywords in the new MRSE scheme, multilingual search is limited to each language and cannot be searched across languages. In this pa-per, we propose a cross-lingual multi-keyword rank search (CLRSE) scheme which eliminates the barrier of languages and achieves semantic extension with using the Open Multilingual Wordnet. Our CLRSE scheme also realizes intelligent and per-sonalized search through flexible keyword and language prefer-ence settings. We evaluate the performance of our scheme in terms of security, functionality, precision and efficiency, via extensive experiments

Efficient Public Key Searchable Encryption Schemes from Standard Hard Lattice Problems for Cloud Computing

Cloud storage and computing offers significant convenience and management efficiency in the information era. Privacy protection is a major challenge in cloud computing. Public key encryption with keyword search (PEKS) is an ingenious tool for ensuring privacy and functionality in certain scenario, such as ensuring privacy for data retrieval appearing in the cloud computing. Despite many attentions received, PEKS schemes still face several challenges in practical applications, such as low computational efficiency, high end-to-end delay, vulnerability to inside keyword guessing attacks(IKGA) and key management defects in the multi-user environment. In this work, we introduce three Ring-LWE/ISIS based PEKS schemes: (1) Our basic PEKS scheme achieves high level security in the standard model. (2) Our PAEKS scheme utilizes the sender\u27s private key to generate an authentication when encrypting, which can resist IKGA. (3) Our IB-PAEKS scheme not only can resist IKGA, but also significantly reduces the complexity of key management in practical applications. Experimental results indicate that the first scheme provides lower end-to-end delay and higher computational efficiency compared to similar ones, and that our last two schemes can provide more secure properties with little additional overhead