scholarly journals Fully Anonymous Data Access Provision and Attribute based Encryption Scheme for Efficient Cloud Data Privacy

2018 ◽  
Vol 14 (01) ◽  
pp. 71-74
Author(s):  
G.V.M.S. Architha ◽  
◽  
S. Jyothsna ◽  
Keyword(s):  
Data Privacy ◽  
Data Access ◽  
Encryption Scheme ◽  
Cloud Data ◽  
Attribute Based Encryption

Control Cloud Data Access Privilge Anonymity with Attributed Based Encryption

2017 ◽  
Vol 7 (8) ◽  
pp. 279
Author(s):  
P. Sudheer ◽  
T. Lakshmi Surekha
Keyword(s):  
Data Privacy ◽  
Low Cost ◽  
Data Access ◽  
Privacy Concerns ◽  
Cloud Data ◽  
Computing Paradigm ◽  
Attribute Based Encryption ◽  
Data Content ◽  
Identity Privacy ◽  
Cloud Servers

Cloud computing is a revolutionary computing paradigm, which enables flexible, on-demand, and low-cost usage of computing resources, but the data is outsourced to some cloud servers, and various privacy concerns emerge from it. Various schemes based on the attribute-based encryption have been to secure the cloud storage. Data content privacy. A semi anonymous privilege control scheme AnonyControl to address not only the data privacy. But also the user identity privacy. AnonyControl decentralizes the central authority to limit the identity leakage and thus achieves semi anonymity. The  Anonymity –F which fully prevent the identity leakage and achieve the full anonymity.

scholarly journals BCAS: A blockchain-based ciphertext-policy attribute-based encryption scheme for cloud data security sharing

2021 ◽  
Vol 17 (3) ◽  
pp. 155014772199961
Author(s):  
Yuting Zuo ◽  
Zhaozhe Kang ◽  
Jian Xu ◽  
Zhide Chen
Keyword(s):  
Data Privacy ◽  
Discrete Logarithm ◽  
Third Parties ◽  
Third Party ◽  
Encryption Scheme ◽  
Cloud Data ◽  
Attribute Based Encryption ◽  
Encryption Schemes ◽  
Trusted Third Parties ◽  
Ciphertext Policy

It is the most important and challenging problem to share the data safely in cloud computing. Some so-called trusted third parties may also infringe users’ data privacy. It is an urgent problem for data owners to share data safely with the designated users rather than the third party or other users. Traditional encryption schemes utilize different keys to produce multiple encrypted copies of the same data for users. It is no longer applicable for cloud data sharing security. Attribute-based encryption can solve above problems, but it needs to rely on trusted third parties to protect the users’ privacy. In this article, in order to address the above problems, we propose a blockchain-based ciphertext-policy attribute-based encryption scheme for cloud data secure sharing without relying on any trusted third parties. Blockchain-based ciphertext-policy attribute-based encryption scheme can protect the rights and security of data owner. Compared with existing cloud security schemes, the proposed scheme has more advantages in terms of the six aspects: (1) data owners have the authority to decide who can decrypt the data; (2) the operations of users are retained permanently, and all records are tamper-proof; (3) our proposed scheme has the characteristic of “one-to-many” encryption, and data is encrypted only once; (4) our scheme does not rely on any trusted third party; (5) in terms of the discrete logarithm problem and decisional q parallel-bilinear Diffie–Hellman exponent problem, we prove that our proposed scheme is secure; and (6) experiment shows that our proposed scheme is more efficient than the comparative scheme.

scholarly journals Enhanced Integrity Checking for Preserve Data Owner and User Level Privacy Using Dual Cryptography Approach

2019 ◽  
pp. 138-146
Author(s):  
Poovizhi. M ◽  
Raja. G
Keyword(s):  
Data Storage ◽  
Data Privacy ◽  
Capital Expenditure ◽  
Data Access ◽  
Third Party ◽  
Configurable Computing ◽  
Local Data ◽  
Cloud Data ◽  
On Demand ◽  
Integrity Checking

Using Cloud Storage, users can tenuously store their data and enjoy the on-demand great quality applications and facilities from a shared pool of configurable computing resources, without the problem of local data storage and maintenance. However, the fact that users no longer have physical possession of the outsourced data makes the data integrity protection in Cloud Computing a formidable task, especially for users with constrained dividing resources. From users’ perspective, including both individuals and IT systems, storing data remotely into the cloud in a flexible on-demand manner brings tempting benefits: relief of the burden for storage management, universal data access with independent geographical locations, and avoidance of capital expenditure on hardware, software, and personnel maintenances, etc. To securely introduce an effective Sanitizer and third party auditor (TPA), the following two fundamental requirements have to be met: 1) TPA should be able to capably audit the cloud data storage without demanding the local copy of data, and introduce no additional on-line burden to the cloud user; 2) The third party auditing process should take in no new vulnerabilities towards user data privacy. In this project, utilize and uniquely combine the public auditing protocols with double encryption approach to achieve the privacy-preserving public cloud data auditing system, which meets all integrity checking without any leakage of data. To support efficient handling of multiple auditing tasks, we further explore the technique of online signature to extend our main result into a multi-user setting, where TPA can perform multiple auditing tasks simultaneously. We can implement double encryption algorithm to encrypt the data twice and stored cloud server in Electronic Health Record applications.

scholarly journals A Privacy Preserving Cloud-Based K-NN Search Scheme with Lightweight User Loads

Computers ◽  
2020 ◽  
Vol 9 (1) ◽  
pp. 1 ◽  
Author(s):  
Yeong-Cherng Hsu ◽  
Chih-Hsin Hsueh ◽  
Ja-Ling Wu
Keyword(s):  
Data Privacy ◽  
Nearest Neighbor ◽  
Search Algorithm ◽  
Data Access ◽  
Privacy Preserving ◽  
Secret Key ◽  
K Nearest Neighbor ◽  
Sensitive Data ◽  
Cloud Data ◽  
Cloud Server

With the growing popularity of cloud computing, it is convenient for data owners to outsource their data to a cloud server. By utilizing the massive storage and computational resources in cloud, data owners can also provide a platform for users to make query requests. However, due to the privacy concerns, sensitive data should be encrypted before outsourcing. In this work, a novel privacy preserving K-nearest neighbor (K-NN) search scheme over the encrypted outsourced cloud dataset is proposed. The problem is about letting the cloud server find K nearest points with respect to an encrypted query on the encrypted dataset, which was outsourced by data owners, and return the searched results to the querying user. Comparing with other existing methods, our approach leverages the resources of the cloud more by shifting most of the required computational loads, from data owners and query users, to the cloud server. In addition, there is no need for data owners to share their secret key with others. In a nutshell, in the proposed scheme, data points and user queries are encrypted attribute-wise and the entire search algorithm is performed in the encrypted domain; therefore, our approach not only preserves the data privacy and query privacy but also hides the data access pattern from the cloud server. Moreover, by using a tree structure, the proposed scheme could accomplish query requests in sub-liner time, according to our performance analysis. Finally, experimental results demonstrate the practicability and the efficiency of our method.

scholarly journals Survey on Securing IoT Data using Homomorphic Encryption Scheme

2021 ◽  
Vol 10 (4) ◽  
pp. 76-81
Author(s):  
Anita Chaudhari ◽  
Rajesh Bansode
Keyword(s):  
Data Privacy ◽  
Homomorphic Encryption ◽  
Computational Cost ◽  
Computation Time ◽  
Cloud Services ◽  
Cloud Provider ◽  
Encryption Scheme ◽  
Sensitive Data ◽  
Cloud Data ◽  
Data User

In today’s world everyone is using cloud services. Every user uploads his/her sensitive data on cloud in encrypted form. If user wants to perform any type of computation on cloud data, user has to share credentials with cloud administrator. Which puts data privacy on risk. If user does not share his/her credentials with cloud provider, user has to download all data and only then decryption process and computation can be performed. This research, focuses on ECC based homomorphic encryption scheme is good by considering communication and computational cost. Many ECC based schemes are presented to provide data privacy. Analysis of different approaches has been done by selecting different common parameters. Based on the analysis minimum computation time is 0.25 Second required for ECC based homomorphic encryption (HE).

scholarly journals Towards Virtuous Cloud Data Storage Using Access Policy Hiding in Ciphertext Policy Attribute-Based Encryption

2021 ◽  
Vol 13 (11) ◽  
pp. 279
Author(s):  
Siti Dhalila Mohd Satar ◽  
Masnida Hussin ◽  
Zurina Mohd Hanapi ◽  
Mohamad Afendee Mohamed
Keyword(s):  
Data Storage ◽  
Cloud Storage ◽  
Security Analysis ◽  
Data Access ◽  
Logical Connective ◽  
Encrypted Data ◽  
Cloud Data ◽  
Access Policy ◽  
Attribute Based Encryption ◽  
Ciphertext Policy

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.

scholarly journals A Key-Policy Searchable Attribute-Based Encryption Scheme for Efficient Keyword Search and Fine-Grained Access Control over Encrypted Data

Electronics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 265 ◽  
Author(s):  
Hui Yin ◽  
Yinqiao Xiong ◽  
Jixin Zhang ◽  
Lu Ou ◽  
Shaolin Liao ◽  
...  
Keyword(s):  
Access Control ◽  
Large Scale ◽  
Keyword Search ◽  
Data Access ◽  
Encryption Scheme ◽  
Encrypted Data ◽  
Fine Grained ◽  
Data Access Control ◽  
Attribute Based Encryption ◽  
Key Policy

Attribute based encryption is a promising technique that achieves flexible and fine-grained data access control over encrypted data, which is very suitable for a secure data sharing environment such as the currently popular cloud computing. However, traditional attribute based encryption fails to provide an efficient keyword based search on encrypted data, which somewhat weakens the power of this encryption technique, as search is usually the most important approach to quickly obtain data of interest from large-scale dataset. To address this problem, attribute based encryption with keyword search (ABKS) is designed to achieve fine-grained data access control and keyword based search, simultaneously, by an ingenious combination of attribute based encryption and searchable encryption. Recently, several ABKS schemes have been constructed in secure cloud storage system for data access control and keyword search. Nonetheless, each of these schemes has some defects such as impractical computation overhead and insufficient access policy expression. To overcome these limitations, in this paper, we design a Key-Policy Searchable Attribute-based Encryption Scheme (KPSABES) based on the full-blown key-policy attribute-based encryption proposed by Vipul Goyal et al. By novel design, our scheme not only inherits all advantages of that scheme but also achieves efficient and secure keyword search over encrypted data. We provide the detailed performance analyses and security proofs for our scheme. Extensive experiments demonstrated that our proposed scheme is superior in many aspects to the similar work.

scholarly journals An Effective Data Access Method for Public Cloud Data Storage

2019 ◽  
Vol 8 (11S2) ◽  
pp. 105-109
Keyword(s):  
Access Control ◽  
Data Storage ◽  
Single Point ◽  
Data Access ◽  
Access Method ◽  
Control Plan ◽  
Cloud Data ◽  
Promising Strategy ◽  
Attribute Based Encryption ◽  
Cloud Data Storage

These days attribute-based encryption has been gotten as a promising strategy to give versatile and secure data to oversee the conveyed storage in the cloud registering environment. In the attribute-based encryption plan, the single property pro should execute the customer legitimacy check and mystery key flow, and thusly, its outcomes. Customers may be stuck in the believing that at a stretch get their mystery keys and choose to get the required data from Cloud. So as to maintain a strategic distance from the single-point execution bottleneck, we are proposing multi-master access control plan which will assess the issue such way that it gives increasingly successful access control on cloud data to the clients.

Sign in / Sign up

Export Citation Format

Share Document