CP-ABE Scheme Research Articles

Decentralized CP-ABE Scheme for Enhanced University Data Security Using Blockchain

In studying ample data security in universities, it is essential to protect the privacy and integrity of data. Current schemes utilize blockchain technology for data sharing, where cloud servers are responsible for storing ciphertext and performing partial encryption and decryption calculations. Data encryption technology can effectively prevent hacker attacks and ensure the integrity of data transmission. However, cloud servers that are only partially trusted may tamper with the ciphertext or return incorrect results. To solve these problems, this paper improves the privacy of access policy, attribute revocation and data authenticity of traditional CP-ABE algorithm. A protection scheme for ample public data security in universities is proposed, and a decentralized network structure based on multiple nodes is designed to improve the efficiency of data queries. The simulation results show that the scheme performs well in the scenario where the number of system attributes is moderate and the complexity of the access policy is not high.

FOC-PH-CP-ABE: An Efficient CP-ABE Scheme With Fully Outsourced Computation and Policy Hidden in the Industrial Internet of Things

FOC-PH-CP-ABE: An Efficient CP-ABE Scheme With Fully Outsourced Computation and Policy Hidden in the Industrial Internet of Things

Power Trading and Access Control Scheme Based on IPFS and Blockchain

In recent years, a large number of renewable energy power plants have been built all over the country, which has led to a sharp increase in the pressure on the current centralized electricity trading platform. There are data storage bottlenecks and data privacy problems in the current blockchain-based power transaction and access control system. In this paper, the interstellar file system is proposed to store the data of the new distributed power trading platform in a distributed way, so as to improve the storage capacity of the physical nodes; An improved ciphertext strategy attribute encryption scheme, which is lightweight, traceable and supports outsourced decryption combined with state secret algorithm, is adopted to integrate the user’s unique identity into the user’s private key and part of the expensive decryption calculation is outsourced to the cloud server to realize fine-grained data access control in the electricity market. The experimental results show that compared to the basic CP-ABE scheme, when the encryption attribute is 100, the decryption time of the proposed scheme is reduced from 556[Formula: see text]ms to 1.1[Formula: see text]ms; Compared to blockchain-based solutions alone, when storing data of 15[Formula: see text]MB, GAS consumption decreases from 2968738133 to 89360. The scheme can greatly improve the storage capacity of the system, improve the operational efficiency and meet the actual performance requirements.

A Blockchain Copyright Protection Scheme Based on CP-ABE Scheme with Policy Update.

Although the copyright protection schemes supported by blockchain have significantly changed traditional copyright data management, there are still some data security challenges that cannot be ignored, especially the secure access and controllable management of copyright data. Quantum computing attacks also pose a threat to its security. Targeting these issues, we design and propose a blockchain copyright protection scheme based on attribute-based encryption (ABE). In this scheme, the security advantages of blockchain technology are utilized to ensure the authenticity and integrity of copyright data. Based on lattice cryptography and the decision ring learning with errors (R-LWE) problem, a new ABE algorithm that supports searchable ciphertext and policy updates is designed. Then, we introduce it into the blockchain copyright protection scheme, which enables secure access to copyright data and fine-grained control. In addition, the lattice cryptography can strengthen this scheme against quantum attacks. Through security analysis, our scheme can prove to be secure against adaptive chosen keyword attacks, selective chosen plaintext attacks, and adaptive chosen policy attacks in the random oracle model. More importantly, the comparison analysis and experimental results show that our proposed approach has lower computation costs and storage costs. Therefore, our scheme has better security and performance in copyright protection.

A decentralized multi-authority CP-ABE scheme from LWE

As a cryptographic primitive supporting finer and richer access control, attribute-based encryption can provide more efficient, concise, secure and highly adaptive access control policies for cloud data, which has attracted the attention of many researchers. However, in a standard ABE scheme, the key can only be generated and issued by a central authority. The single authorization center has a heavy load and is vulnerable to attack. Once the center is paralyzed, it will bring serious security consequences. Multi-authorization center attribute encryption (MA-ABE) allows multiple parties to play an authoritative role, which can solve this problem.In this paper, we propose a MA-ABE scheme, which combines a global ID model, a two-stage sampling technique on a lattice and a monotonous linear secret sharing schemes (M-LSSS) to achieve a static security against arbitrary collusion in the random oracle model, in which the access policy of the scheme is expressed by DNF formula. Technically, our scheme is an improvement on the work of Datta et al. (2021), through this improvement, we can get shorter ciphertext and smaller key size.

A Lattice-Based CP-ABE Scheme with Immediate Attribute Revocation

A Lattice-Based CP-ABE Scheme with Immediate Attribute Revocation

A Policy-Hiding Attribute-Based Access Control Scheme in Decentralized Trust Management

Internet of Medical Things (IoMT) technologies significantly improve the quality of health care, especially at the time when COVID-19 is becoming a worldwide pandemic. Due to the complexity of devices and user nodes in the IoMT system, there should be some ways to ensure the security and quality of the service or information. Decentralized trust management techniques are efficient means of promoting application security and reliability in these cases. However, the majority of currently utilized access control schemes cannot be applied in decentralized trust management systems or perform poorly owing to the numerous restrictions of decentralized systems. In this paper, we present a policy-hiding and multi-authority key generation CP-ABE scheme (PM-CPABE) for decentralized trust management systems, which could provide fine-grained access control capabilities. Meanwhile, the proposed scheme does not require any fully trusted entity, thus it can be well adapted to decentralized trust management systems. The scheme also implements policy hiding to protect user privacy. In addition, it supports large universe and outsourced decryption. The security analyses and performance comparisons give evidence of our scheme is security and efficient.

Poly-ABE: A traceable and revocable fully hidden policy CP-ABE scheme for integrated demand response in multi-energy systems

Demand response is a crucial measure in multi-energy systems (MESs) that encourages energy service providers (ESPs) to engage with energy users (EUs). In the energy internet, EUs can match their energy source requirements through integrated demand response (IDR). However, such permissionless retrieval of energy data compromises the privacy of ESPs and exposes the energy consumption data of EUs. To address this, we propose a traceable, revocable fully hidden policy CP-ABE scheme called Poly-ABE for a data-driven IDR model in MESs, which allows registered EUs to request data and ESPs to authorize data decryption. Poly-ABE features fine-grained access policies using a matrix, coupled with hidden vector encryption to fully hide the policies. Matrix policies offer flexible and complex authorization rules with lower cost. Moreover, Poly-ABE constructs a decryption permission binary tree (DPBT) to identify the attribute permissions of EUs. If malicious behavior is detected, the DPBT is used to determine a minimum set of tree nodes to pinpoint malicious nodes. We rigorously demonstrate that Poly-ABE is selectively secure against selective access policy and chosen plaintext attacks. The experimental results substantiate the feasibility of Poly-ABE, highlighting its pre-authentication, traceability, revocation, and update capabilities.

A traceable and verifiable CP-ABE scheme with blockchain in VANET

A traceable and verifiable CP-ABE scheme with blockchain in VANET

Fine-grained access control of files stored in cloud storage with traceable and revocable multi-authority CP-ABE scheme

Fine-grained access control of files stored in cloud storage with traceable and revocable multi-authority CP-ABE scheme

Fine-grained access control of files stored in cloud storage with traceable and revocable multi-authority CP-ABE scheme

Fine-grained access control of files stored in cloud storage with traceable and revocable multi-authority CP-ABE scheme

Efficient CP-ABE Scheme Resistant to Key Leakage for Secure Cloud-Fog Computing

<p>With the evolution of the Internet, people’s lives are growing increasingly intelligent, and massive amounts of data are also generated. The combination of cloud computing and fog computing can store and process it efficiently. However, a new and urgent challenge has emerged about how to ensure that data in cloud and fog nodes are accessed securely. In order to address this issue, we propose an efficient anti-key leakage CP-ABE (EAL-CP-ABE) scheme based on cloud-fog computing. In our scheme, we achieve the identity tracing of the authorized user who leaked the private key by means of white-box tracing and the maximum number of user accesses. Meanwhile, we design a reward and punishment mechanism which rewards those with a good reputation and revokes authorized users who have exceeded the access limit or sold private keys to further reduce the possibility of key leakage. Due to limited local resources, we use fog nodes to achieve outsourced decryption of ciphertext. In addition, the detailed security analysis is provided to prove that the EAL-CP-ABE scheme is IND-CPA secure and traceable based on the hardness assumptions. Finally, we demonstrate that the EAL-CP-ABE scheme is efficient through the performance analysis.</p> <p> </p>

A revocable attribute-based encryption EHR sharing scheme with multiple authorities in blockchain.

With the development of digital healthcare, sharing electronic medical record data has become an indispensable part of improving medical conditions. Aiming at the centralized power caused by the single attribute authority in current CP-ABE schemes and the problem that cloud servers are curious and even malicious, we design a revocable CP-ABE EHR sharing scheme with multiple authorities (MA-RABE) in blockchain. In this solution, a group of authorities complete user attribute distribution, key generation and user management through secret sharing and transactions. Besides, we innovatively implemented a distributed one-way anonymous key agreement so that other participants cannot obtain useful information from the fully hidden policy embedded in the ciphertext. Taking into account the computational overhead of a large number of bilinear operations in the decryption process, the solution also supports the cloud server to pre-decrypt the ciphertext, and the data user only needs to perform exponentiation operation once to obtain the plaintext from the pre-decryption result. Theoretical analysis and performance evaluation show that the scheme has reliable security and lower user revocation and ciphertext update overhead.

RMA-CPABE : A multi-authority CPABE scheme with reduced ciphertext size for IoT devices

Internet of Things (IoT) generates a massive amount of data, which can be prone to huge data and privacy leaks unless given a proper access control. Ciphertext-policy attribute-based encryption (CP-ABE) is a well-known cryptographic mechanism that provides confidentiality and fine-grained access to stored data. In CP-ABE, a single trusted authority primarily handles attribute management and its revocation. However, in an environment like IoT, due to its heterogeneous nature, the attributes from multiple domains are evidently inherited by IoT devices and hence develop a need for a multi-authority scheme. Therefore, this paper proposes a novel multi-authority CP-ABE scheme with reduced-size ciphertext (RMA-CPABE) to provide secure access in fog-enabled IoT applications with attributes from multiple domains. This scheme considers the resource-constrained nature of IoT devices and reduces the ciphertext size in the sense that the ciphertext size does not increase linearly with the number of attributes; instead, it increases linearly with the number of multi-domain attribute authorities involved in the policy building. RMA-CPABE supports highly required functionalities like attribute update and outsourced decryption to reduce the computation load on the end devices. Further, the proposed scheme is the first to eliminate the most expensive ciphertext update operation during attribute revocation and addition, which is the biggest drawback of most of the existing schemes. The end-user in RMA-CPABE requires holding only a constant size key to access the ciphertexts securely. The security analysis proves that the proposed scheme is secure against Chosen-Ciphertext Attack (CCA) under multiple augmented Multi-Sequence of Exponents Decisional Diffie Hellman (maMSE-DDH) assumptions. The performance analysis shows that RMA-CPABE is suitable for IoT applications.

Multi - Authority Based Approach for Manipulation of Encrypted Data in Cloud

In this paper, we address the protection concerns of cloud storage under the scenario where users encrypt-then-outsource data, share their outsourced data with other users, and so the service provider may be queried for searching and retrieval of encrypted data. Because the main distinctive, we propose a security approach for storage, sharing, and retrieval of encrypted data within the fully as constructed supported attribute-based encryption (ABE) thus enabling access control mechanisms over both the encrypted data and also for the data retrieval task through search access control. Efforts have studied problems around this application scenario on different fronts: efficiency, flexibility, reliability, and security. Our suggested secure Multi-authority CP-ABKS (MABKS) system addresses such limitations and minimizes the computation and storage burden on resource-limited devices in cloud systems. Additionally, the MABKS system is extended to support malicious attribute authority tracing and attribute update. proposed a practical CP-ABE scheme, which offers user revocation and attributes updates. We proposed an efficient and feasible MABKS system to support multiple authorities, to avoid having performance bottlenecks at one point in cloud systems. Furthermore the presented MABKS system allows us to trace malicious.

Practical revocable and multi-authority CP-ABE scheme from RLWE for Cloud Computing

Cloud computing provides enterprises and individuals with unlimited computing resources and expandable storage space. However, data leakage occurs frequently due to the lack of protection measures in the cloud storage environment. Consequently, how to protect data security in the cloud has become a critical issue. Attribute-based encryption (ABE) is an emerging encryption technique, which protects sensitive information and provides access control for data stored in the cloud. However, most of existing ABE schemes cannot resist quantum attacks and lack the capability of implementing flexible revocation on user or attribute when the attributes of a user change, which hinders the practical application of ABE. In this research, we present a Revocable and Multi-authority ciphertext-policy attribute-based encryption (RM-CP-ABE) from the ring learning with errors (RLWE) assumption, which supports multi-authority and multi-valued attributes. The scheme allows multiple authorities to involve in key distribution, and achieves the attribute revocation when the user’s access rights change. Also, the scheme enjoys reasonable computational cost and storage overhead, and is proven selectively secure under the RLWE assumption. The simulation results indicate that the performance of the proposed scheme is acceptable for practical applications.

Enabling efficient traceable and revocable time-based data sharing in smart city

With the assistance of emerging techniques, such as cloud computing, fog computing and Internet of Things (IoT), smart city is developing rapidly into a novel and well-accepted service pattern these days. The trend also facilitates numerous relevant applications, e.g., smart health care, smart office, smart campus, etc., and drives the urgent demand for data sharing. However, this brings many concerns on data security as there is more private and sensitive information contained in the data of smart city applications. It may incur disastrous consequences if the shared data are illegally accessed, which necessitates an efficient data access control scheme for data sharing in smart city applications with resource-poor user terminals. To this end, we proposes an efficient traceable and revocable time-based CP-ABE (TR-TABE) scheme which can achieve time-based and fine-grained data access control over large attribute universe for data sharing in large-scale smart city applications. To trace and punish the malicious users that intentionally leak their keys to pursue illicit profits, we design an efficient user tracing and revocation mechanism with forward and backward security. For efficiency improvement, we integrate outsourced decryption and verify the correctness of its result. The proposed scheme is proved secure with formal security proof and is demonstrated to be practical for data sharing in smart city applications with extensive performance evaluation.

Achieving privacy-preserving sensitive attributes for large universe based on private set intersection

Nowadays, an increasing amount of data has been sent to the cloud for analysis and storage, and data security in the cloud has been widely concerned. Among them, CP-ABE is regarded as one of the most promising technologies to protect outsourced data. However, in most CP-ABE schemes, attackers may obtain user privacy information from policy plaintext. More likely, partial policy hiding programme neither satisfies full policy hiding nor applies to the needs of the large universe. In this paper,we hide both attribute values and names in policy by using private set intersection (PSI). The CP-ABE programme not only supports a complete hiding policy, but also can calculate the authorization relationship and mapping relationship between user passwords and keys. We use a polynomial-based PSI and a recursive algorithm to calculate the authorization relationship. And with the help of the algorithm and the label vector, the mapping is determined under communication restrictions. Through the outsourcing index, we achieve an efficient hiding strategy and effectively reduce the user's computing overhead. Finally, theoretical analysis and experiments show that our model has better performance while effectively protecting sensitive attributes.

Efficient Ciphertext-Policy Attribute-Based Encryption Constructions with Outsourced Encryption and Decryption

The invention of the Ciphertext-Policy Attribute-Based Encryption scheme opened a new perspective for realizing attribute-based access control systems without being forced to trust the storage service provider, which is the case in traditional systems where data are sent to the storage service provider in clear and the storage service provider is the party that controls the access to these data. In the Ciphertext-Policy Attribute-Based Encryption model, the data owner encrypts data using an attribute-based access structure before sending them to the storage service, and only users with authorized sets of attributes can successfully decrypt the generated ciphertext. However, Ciphertext-Policy Attribute-Based Encryption schemes employ expensive operations (i.e., bilinear pairings and modular exponentiations) and generate long ciphertexts and secret keys, which makes them hard to implement in real-life applications especially for resource-constrained devices. In this paper, we propose two Ciphertext-Policy Attribute-Based Encryption Key Encapsulation Mechanisms that can be provided as services in the cloud, minimizing the user’s encryption and decryption costs without exposing any sensitive information to the public cloud provider. In the first scheme, the ABE Service Provider is considered fully untrusted. On the other hand, the second scheme requires the ABE Service Provider to be semi-trusted (Honest-but-Curious) and does not collude with illegitimate users. Both schemes are proved to be selectively CPA-secure in the random oracle. The theoretical and experimental performance results show that both our first and second schemes are more efficient than the reviewed outsourced CP-ABE schemes in terms of user-side computation, communication, and storage costs.

Security and Privacy Preserving of Data using CP-ABE Scheme

Security and Privacy Preserving of Data using CP-ABE Scheme