Fully Secure Ciphertext-Policy Attribute-Based Encryption in Prime Order Group

We present a fully secure ciphertext-policy attribute-based encryption (CP-ABE) scheme in prime order group by using a tool which can convert composite order paring-based encryption scheme into prime order one. Although, a fully secure CP-ABE scheme in prime order group has been proposed recently, our scheme needs less master secret key size and can be seen as a different version of it. Besides, the sketch of our scheme's security proof is also given.

A New User Revocable Ciphertext-Policy Attribute-Based Encryption with Ciphertext Update

Security and Communication Networks ◽

10.1155/2020/8856592 ◽

2020 ◽

Vol 2020 ◽

pp. 1-11

Author(s):

Zhe Liu ◽

Fuqun Wang ◽

Kefei Chen ◽

Fei Tang

Keyword(s):

Secret Key ◽

Data Confidentiality ◽

Encrypted Data ◽

Diffie Hellman ◽

Security Proof ◽

Challenge Ciphertext ◽

Identity Based ◽

Ciphertext Policy ◽

Selective Security

The revocable ciphertext-policy attribute-based encryption (R-CP-ABE) is an extension of ciphertext-policy attribute-based encryption (CP-ABE), which can realize user direct revocation and maintain a short revocation list. However, the revoked users can still decrypt the previously authorized encrypted data with their old key. The R-CP-ABE scheme should provide a mechanism to protect the encrypted data confidentiality by disqualifying the revoked users from accessing the previously encrypted data. Motivated by practical needs, we propose a new user R-CP-ABE scheme that simultaneously supports user direct revocation, short revocation list, and ciphertext update by incorporating the identity-based and time-based revocable technique. The scheme provides a strongly selective security proof under the modified decisional q -parallel bilinear Diffie–Hellman Exponent problem, where “strongly” means that the adversary can query the secret key of a user whose attribute set satisfies the challenge ciphertext access structure and whose identity is in the revocation list.

2021 IEEE 6th International Conference on Computer and Communication Systems (ICCCS) ◽

An Efficient Ciphertext Policy Attribute-Based Encryption Scheme from Lattices and Its Implementation

10.1109/icccs52626.2021.9449182 ◽

2021 ◽

Author(s):

Xinyuan Qian ◽

Wenyuan Wu

Keyword(s):

Encryption Scheme ◽

Updatable Ciphertext-Policy Attribute-Based Encryption Scheme With Traceability and Revocability

IEEE Access ◽

10.1109/access.2019.2918434 ◽

2019 ◽

Vol 7 ◽

pp. 66832-66844 ◽

Cited By ~ 3

Author(s):

Zhenhua Liu ◽

Jing Xu ◽

Yan Liu ◽

Baocang Wang

Keyword(s):

Encryption Scheme ◽

An Efficient Ciphertext-Policy Attribute-Based Encryption Scheme Supporting Collaborative Decryption with Blockchain

IEEE Internet of Things Journal ◽

10.1109/jiot.2021.3099171 ◽

2021 ◽

pp. 1-1

Author(s):

Ying He ◽

Haiyan Wang ◽

Yuan Li ◽

Ke Huang ◽

Victor C. M. Leung ◽

...

Keyword(s):

Encryption Scheme ◽

Correction: Traceable ciphertext-policy attribute-based encryption scheme with attribute level user revocation for cloud storage

PLoS ONE ◽

10.1371/journal.pone.0206952 ◽

2018 ◽

Vol 13 (10) ◽

pp. e0206952

Author(s):

Keyword(s):

Cloud Storage ◽

Attribute Level ◽

Encryption Scheme ◽

User Revocation ◽

Handbook of Research on Intrusion Detection Systems - Advances in Information Security, Privacy, and Ethics ◽

An Attribute-Based Searchable Encryption Scheme for Non-Monotonic Access Structure

10.4018/978-1-7998-2242-4.ch013 ◽

2020 ◽

pp. 263-283 ◽

Cited By ~ 1

Author(s):

Mamta ◽

Brij B. Gupta

Keyword(s):

Access Control ◽

Searchable Encryption ◽

Access Structure ◽

Encryption Scheme ◽

Security Model ◽

Secret Key ◽

Fine Grained ◽

Diffie Hellman ◽

Encryption Schemes

Attribute based encryption (ABE) is a widely used technique with tremendous application in cloud computing because it provides fine-grained access control capability. Owing to this property, it is emerging as a popular technique in the area of searchable encryption where the fine-grained access control is used to determine the search capabilities of a user. But, in the searchable encryption schemes developed using ABE it is assumed that the access structure is monotonic which contains AND, OR and threshold gates. Many ABE schemes have been developed for non-monotonic access structure which supports NOT gate, but this is the first attempt to develop a searchable encryption scheme for the same. The proposed scheme results in fast search and generates secret key and search token of constant size and also the ciphertext components are quite fewer than the number of attributes involved. The proposed scheme is proven secure against chosen keyword attack (CKA) in selective security model under Decisional Bilinear Diffie-Hellman (DBDH) assumption.