An Efficient and Expressive Ciphertext-Policy Attribute-Based Encryption Scheme with Partially Hidden Access Structures

Cui, Hui; Deng, Robert H.; Wu, Guowei; Lai, Junzuo

doi:10.1007/978-3-319-47422-9_2

Cited by 57 publications

(52 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since literature [ 32 – 35 ] do not support multi-keyword search function, the proposed scheme is mainly compared with literature [ 31 ]. From the Fig 2 , we can see that in the encryption phase, the calculation speed of our scheme is slower than literature [ 33 ], faster than literature [ 31 , 32 , 34 , 35 ].…”

Section: Performance and Efficiency Analysesmentioning

confidence: 86%

“…In Fig 3(D), 3(E) and 3(F) are time charts for running token generation algorithm as the number of attributes increases when keyword set contains 10, 20, and 30 keywords, respectively. Since literature [ 32 , 34 , 35 ] does not involve token generation algorithm, at this phase, our scheme is mainly compared with literature [ 31 , 33 ], and because literature [ 33 ] does not support multi-keyword search function, the changes in the number of keywords will only lead to changes in the algorithm time of our scheme and literature [ 31 ]. As can be seen from the Fig 3 , when the number of keywords is 10, the calculation time of our scheme is shortest.…”

Section: Performance and Efficiency Analysesmentioning

confidence: 99%

See 1 more Smart Citation

Attribute-based encryption scheme with multi-keyword search and supporting attribute revocation in cloud storage

2018

View full text Add to dashboard Cite

We propose an attribute-based encryption scheme with multi-keyword search and supporting attribute revocation in cloud storage environment, in which binary attributes and AND-gate access policy are used. Our proposal enjoys several advantages. Firstly, multi-keyword search is available, and only when a data user's attribute set satisfies access policy in keyword index, and keyword token generated by data user matches index successfully, then data user can obtain ciphertext containing keywords. In this way, more accurate keyword search is achievable. Secondly, the search privacy of data user is protected owing to cloud servers cannot obtain any knowledge of keywords which data user is interested in. Meanwhile, the ciphertext is able to be decrypted when data user's attribute set satisfies access policy specified in the ciphertext, which can both improve security of encryption and achieve secure fine-grained access control. Thirdly, the proposed scheme supports attribute revocation, in our scheme when a data user's attribute is revoked, the version number of attribute, non-revoked data users' secret keys and related ciphertexts will be updated, such that data user whose attribute is revoked does not decrypt updated ciphertext anymore. In addition, based on the assumption of decisional linear (DL) and decisional Diffie-Hellman (DDH), our scheme is proved to be secure against selectively chosen-keyword attacks and selectively chosen-plaintext attacks respectively, and it also ensures token privacy security.

show abstract

Section: Performance and Efficiency Analysesmentioning

confidence: 86%

Section: Performance and Efficiency Analysesmentioning

confidence: 99%

Attribute-based encryption scheme with multi-keyword search and supporting attribute revocation in cloud storage

2018

View full text Add to dashboard Cite

show abstract

“…So Zhang et al [28] proposed a scheme with decryption test in 2013, namely, adding a matching operation with less computation before decryption phase. The [29] proposed an anonymous scheme based on a prime order group. In 2016, the [30] extended the ANON-CP-ABE to the electronic medical record system to protect the users privacy, in which the access structure was more expressive.…”

Section: A Related Workmentioning

confidence: 99%

“…The [32] proposed an ANON-CP-ABE scheme that supports fast decryption for Personal Health Record (PHR). The core technology of [29], [30], [32] is to disclose the index of attribute names and the attribute values are embed into access structures, so these schemes only can partially hide the access policies.…”

Section: A Related Workmentioning

confidence: 99%

Improving the Leakage Rate of Ciphertext-Policy Attribute-Based Encryption for Cloud Computing

et al. 2020

View full text Add to dashboard Cite

A Leakage-Resilient Ciphertext-Policy Attribute-based Encryption (LR-CP-ABE) not only supports the fine-grained access control to encrypted data but also guarantees the security of the data under the side-channel attacks. However, the leakage rate in the existing schemes is low or related to the number of attributes. It will make these schemes suffer from continual attacks. In addition, all of them almost not consider the leakage of the users' privacy and rely on the composite order groups which will threaten the privacy security of the users and depress the users in practice. In this paper, we aim at solving the above problems and propose a scheme with the improving leakage rate in the prime order group. In the proposed scheme, an extension of the lattice-based trapdoor is used to make it achieve the maximum leakage rate 1 − o(1). Moreover, it achieves the anonymity which can protect the privacy of the receivers. The proposed scheme can be reduced to the standard assumption-Decision Linear (DLIN) assumption in the selective security model and resist the Chosen Plaintext Attacks (CPA security). At last, the performance comparisons are given to confirm the efficiency and security of the proposed scheme.

show abstract

“…As shown in Table. 3, schemes [6,24,25] restricted with AND-gates on multivalues give rise to an exponential size of ciphertext for supporting an expressive access policy. Since the attribute value is hidden in [28], for finding the correct attribute value for successful decryption, [28] needs end user to test super-polynomial times. In addition, all the above schemes only protect the privacy attribute value, but expose the information of attribute name.…”

Section: Complexity Analysismentioning

confidence: 99%

Ciphertext-Policy Attribute-based Encryption with Hidden Sensitive Policy from Keyword Search Techniques in Smarty City

Meng

Cheng

Wang³

2020

Preprint

View full text Add to dashboard Cite

Smart city greatly facilitates citizens and generates innumerable data, some of which is very private and sensitive. To protect data from unauthorized users, ciphertext-policy attribute-based encryption (CP-ABE) enables data owner to specify an access policy on encrypted data. However, There are two drawbacks in traditional CP-ABE schemes. On the one hand, the access policy is revealed in the ciphertext so that sensitive information contained in the policy is exposed to anyone who obtains the ciphertext. For example, both the plaintext and access policy of an encrypted recruitment may reveal the company’s future development plan. On the other hand, the decryption time scales linearly with the complexity of the access, which makes it unsuitable for resource-limited end users. In this paper, we propose a CP-ABE scheme with hidden sensitive policy from keyword search (KS) techniques in smart city. Specifically, we introduce a new security model chosen sensitive policy security : two access policies embedded in the ciphertext, one is public and the other is sensitive and fully hidden, only if user’s attributes satisfy the public policy, it’s possible for him/her to learn about the hidden policy, otherwise he/she cannot get any information (attribute name and its values) of it. When the user satisfies both access policies, he/she can obtain and decrypt the ciphertext. Compared with other CP-ABE schemes, our scheme exploits KS techniques to achieve more expressive and efficient, while the access policy of their schemes only work on the “AND-gate” structure or their ciphertext size or decryption time maybe super-polynomial. In addition, intelligent devices spread all over the smart city, so partial computational overhead of encryption of our scheme can be outsourced to these devices as fog nodes, while most part overhead in the decryption process is outsourced to the cloud.Therefore, our scheme is more applicable to end users with resource-constrained mobile devices. We prove our scheme to be selective secure under the decisional bilinear Diffie-Hellman (DBDH) assumption.

show abstract

An Efficient and Expressive Ciphertext-Policy Attribute-Based Encryption Scheme with Partially Hidden Access Structures

Cited by 57 publications

References 23 publications

Attribute-based encryption scheme with multi-keyword search and supporting attribute revocation in cloud storage

Attribute-based encryption scheme with multi-keyword search and supporting attribute revocation in cloud storage

Improving the Leakage Rate of Ciphertext-Policy Attribute-Based Encryption for Cloud Computing

Ciphertext-Policy Attribute-based Encryption with Hidden Sensitive Policy from Keyword Search Techniques in Smarty City

Contact Info

Product

Resources

About