scholarly journals Secure Data Storage and Data Retrieval in Cloud Storage using Cipher Policy Attribute based Encryption

2015 ◽  
Vol 8 (S9) ◽  
pp. 318 ◽  
Author(s):  
R. Saikeerthana ◽  
A. Umamakeswari
2011 ◽  
Vol 8 (3) ◽  
pp. 801-819 ◽  
Author(s):  
Huang Ruwei ◽  
Gui Xiaolin ◽  
Yu Si ◽  
Zhuang Wei

In order to implement privacy-preserving, efficient and secure data storage and access environment of cloud storage, the following problems must be considered: data index structure, generation and management of keys, data retrieval, treatments of change of users? access right and dynamic operations on data, and interactions among participants. To solve those problems, the interactive protocol among participants is introduced, an extirpation-based key derivation algorithm (EKDA) is designed to manage the keys, a double hashed and weighted Bloom Filter (DWBF) is proposed to retrieve the encrypted keywords, which are combined with lazy revocation, multi-tree structure, asymmetric and symmetric encryptions, which form a privacypreserving, efficient and secure framework for cloud storage. The experiment and security analysis show that EKDA can reduce the communication and storage overheads efficiently, DWBF supports ciphertext retrieval and can reduce communication, storage and computation overhead as well, and the proposed framework is privacy preserving while supporting data access efficiently.


2019 ◽  
Vol 16 (3) ◽  
pp. 797-813
Author(s):  
Qiuting Tian ◽  
Dezhi Han ◽  
Yanmei Jiang

With the development of cloud storage technology, data storage security has become increasingly serious. Aiming at the problem that existing attribute-based encryption schemes do not consider hierarchical authorities and the weight of attribute. A hierarchical authority based weighted attribute encryption scheme is proposed. This scheme will introduce hierarchical authorities and the weight of attribute into the encryption scheme, so that the authorities have a hierarchical relationship and different attributes have different importance. At the same time, the introduction of the concept of weight makes this scheme more flexible in the cloud storage environment and enables fine-grained access control. In addition, this scheme implements an online/offline encryption mechanism to improve the security of stored data. Security proof and performance analysis show that the scheme is safe and effective, and it can resist collusion attacks by many malicious users and authorization centers. It is more suitable for cloud storage environments than other schemes.


2021 ◽  
Vol 13 (11) ◽  
pp. 279
Author(s):  
Siti Dhalila Mohd Satar ◽  
Masnida Hussin ◽  
Zurina Mohd Hanapi ◽  
Mohamad Afendee Mohamed

Managing and controlling access to the tremendous data in Cloud storage is very challenging. Due to various entities engaged in the Cloud environment, there is a high possibility of data tampering. Cloud encryption is being employed to control data access while securing Cloud data. The encrypted data are sent to Cloud storage with an access policy defined by the data owner. Only authorized users can decrypt the encrypted data. However, the access policy of the encrypted data is in readable form, which results in privacy leakage. To address this issue, we proposed a reinforcement hiding in access policy over Cloud storage by enhancing the Ciphertext Policy Attribute-based Encryption (CP-ABE) algorithm. Besides the encryption process, the reinforced CP-ABE used logical connective operations to hide the attribute value of data in the access policy. These attributes were converted into scrambled data along with a ciphertext form that provides a better unreadability feature. It means that a two-level concealed tactic is employed to secure data from any unauthorized access during a data transaction. Experimental results revealed that our reinforced CP-ABE had a low computational overhead and consumed low storage costs. Furthermore, a case study on security analysis shows that our approach is secure against a passive attack such as traffic analysis.


2016 ◽  
Vol 134 (13) ◽  
pp. 31-35 ◽  
Author(s):  
Chaudhari Swapnil ◽  
Mandre B.R.

2015 ◽  
Vol 2015 ◽  
pp. 1-9 ◽  
Author(s):  
Wei Cheng ◽  
Yong Li ◽  
Yi Jiang ◽  
Xipeng Yin

For distributed data storage in Unattended Wireless Sensor Networks (UWSNs), security issues have been focused on by extensive researches in recent years. In this paper, an enhanced, reliable, and secure data distribution scheme based on erasure codes for UWSNs is proposed, which adapt the MOVE-ONCE survival strategy. In the proposed scheme, two-hop neighbor set has been utilized as data shareholders of data distribution. Through the analysis, we can find that there is more number of candidate secure data holders in two-hop neighbor set than one-hop neighbor set. Thus our new scheme could further enhance both probabilistic Backward Secrecy (BSe) and the reliability on data retrieval. Theoretical analysis and dense simulations show advantages of our new scheme which is compared with several previous related schemes proposed for UWSNs.


Sign in / Sign up

Export Citation Format

Share Document