scholarly journals Multi-keyword Ranked Search with Fine-grained Access Control over Encrypted Cloud Data

Author(s):  
Jingyu Lei ◽  
Jiao Mo
Author(s):  
Jiayi Li ◽  
Jianfeng Ma ◽  
Yinbin Miao ◽  
Yang Ruikang ◽  
Ximeng Liu ◽  
...  

Author(s):  
Yanjiang Yang ◽  
Xuhua Ding ◽  
Haibing Lu ◽  
Zhiguo Wan ◽  
Jianying Zhou

2018 ◽  
Vol 7 (4.6) ◽  
pp. 1
Author(s):  
Krishna Keerthi Chennam ◽  
Lakshmi Mudda

The Data Base as a Service is a great example where the database engine and storage devices are in cloud data. This scheme allows customers to outsource data and store in cloud database on pay per user, scalable and flexible. But data confidentiality is in high risk when data is outsourced and stored in third party database. A trusted third party server must be maintaining the third party data base. There is a possibility of malicious administrator who can leaks the data which is stored in third party database. The best method is to encrypt the data and store in third party database but alone encryption is not sufficient. Even authorization is another problem that who can access the data. For data security and authorized of users, the fine grained access control policy Cipher text policy Attribute Based encryption (CP-ABE) is used to give access to authorized users only and the best symmetric encryption Advanced Encryption Standard(AES) is applied on data before outsourcing the data in cloud. 


Author(s):  
G. Sravan Kumar ◽  
A. Sri Krishna

Cloud data storage environments allow the data providers to store and share large amounts of datasets generated from various resources. However, outsourcing private data to a cloud server is insecure without an efficient access control strategy. Thus, it is important to protect the data and privacy of user with a fine-grained access control policy. In this article, a Bloom Filter-based Ciphertext-Policy Attribute-Based Encryption (BF-CP-ABE) technique is presented to provide data security to cloud datasets with a Linear Secret Sharing Structure (LSSS) access policy. This fine-grained access control scheme hides the whole attribute set in the ciphertext, whereas in previous CP-ABE methods, the attributes are partially hidden in the ciphertext which in turn leaks private information about the user. Since the attribute set of the BF-CP-ABE technique is hidden, bloom filters are used to identify the authorized users during data decryption. The BF-CP-ABE technique is designed to be selective secure under an Indistinguishable-Chosen Plaintext attack and the simulation results show that the communication overhead is significantly reduced with the adopted LSSS access policy.


The recent trends suggest that there is an increase in the inclination towards storing data in the cloud due to explosive and massive growth of the volume of the data in the cloud computing environment. It helps them to reduce their computational and storage costs but also undeniably brought in concerns about security and privacy as the owners of the highly sensitive data lose control of it directly. The sensitive data could include electronic-based medical records, confidential fiscal documents, etc. An increased distrust about storage of files in a third-party service provider of cloud resources would contradict the very same reason for which cloud storage facilities were introduced. That’s because we cannot deny the fact that cloud based storage systems offer on- demand and ubiquitous access to flexible storage and computational resources. The keyword ranked search methodologies used in the existing systems mainly focus on enhancing and enriching the efficiency of searching the files and their respective functionalities but a lack of straight forward analysis of security and issues with providing access control have not been addressed. To address these disadvantages, in this paper, we propose an efficient Multi-Keyword Ranked Search scheme with Fine-grained access control (MRSF).MRSF is a methodology which can combine matching of coordinates technique with Term Frequency-Inverse Document Frequency (TF-IDF) to thereby achieve a highly precise retrieval of any cipher text of interest. It also improves the secure k-nearest neighbors (kNN) method. By utilizing an access strategy which is polynomial based, it can effectively refine the search privileges of the users’. Professional security analysis proves that MRSF is secure with respect to safeguarding the secrecy of outsourced data and the privacy of tokens and indices. Along with this enhanced methodology of ranked search scheme, a time limit based access control feature has also been proposed to ensure that the adaptive attackers are stalled from giving prolonged access to the data files. Session expiry will ensure security of data and that is to be achieved by providing a time window for the file retrieval. Extensive experiments also show that MRSF reaches higher search precision and many more functionalities when compared to the existing systems.


Sign in / Sign up

Export Citation Format

Share Document