Provably secure unbounded multi‐authority ciphertext‐policy attribute‐based encryption

Li, Qi; Ma, Jianfeng; Li, Rui; Xiong, Jinbo; Liu, Ximeng

doi:10.1002/sec.1326

Cited by 27 publications

(19 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, the proposed scheme is compared with existing typical schemes from both the security and the efficiency aspects. We summarize the comparison results in Tables and .…”

Section: Performance Comparisonsmentioning

confidence: 99%

“…As shown in Table , all these schemes are expressive and allow LSSS ciphertext policies except the tree key policies in . As for the security level, the schemes and ours are proven secure in the standard model, and the scheme uses the random oracle model. Note that only the schemes are fully secure and the others achieve selective security.…”

Section: Performance Comparisonsmentioning

confidence: 99%

“…In order to fill the earlier gap, Chase proposed several MA‐ABE schemes, where each user can apply for secret keys from different attribute authorities. Since then, many researches have been performing on MA‐ABE . In MA‐ABE system, an important issue of supporting large attribute universe has to be considered.…”

Section: Introductionmentioning

confidence: 99%

“…It is noted that the schemes only allow a single authority. Recently, a MA‐KP‐ABE scheme and a MA‐CP‐ABE were constructed, and both schemes allow unbounded attribute universe.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Online/offline unbounded multi-authority attribute-based encryption for data sharing in mobile cloud computing

Zhang

Zheng

et al. 2016

Security Comm. Networks

Self Cite

View full text Add to dashboard Cite

In order to realize attribute‐based data sharing in cloud computing, multi‐authority attribute‐based encryption (MA‐ABE) is extremely attractive. However, most of the existing MA‐ABE schemes cannot support a fully large attribute universe and are not suitable for resource‐constrained mobile data owners in that the computation cost in secret key generation and encryption is extremely heavy. To tackle the earlier challenges, we propose an online/offline MA‐ABE scheme, which realizes both the online/offline secret key generation and the online/offline encryption while supporting a fully large attribute universe. In the offline phase, one global‐identity authority and multiple attribute authorities do the majority of the work to issue attribute secret keys before knowing users' global identity and attributes. The data owner can perform most of the encryption computation tasks before knowing the actual message and access structure. Furthermore, the online phase can rapidly assemble the final decryption key and ciphertexts when related specifications become known. Particularly, global‐identity authority and attribute authorities need not to cooperate in the whole process. Our online/offline MA‐ABE scheme allows the access policies encoded in linear secret sharing schemes. The formal selective security proof and extensive performance analysis indicate that our scheme is very suitable for data sharing in mobile cloud computing. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

“…In this section, the proposed scheme is compared with existing typical schemes from both the security and the efficiency aspects. We summarize the comparison results in Tables and .…”

Section: Performance Comparisonsmentioning

confidence: 99%

Section: Performance Comparisonsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…It is noted that the schemes only allow a single authority. Recently, a MA‐KP‐ABE scheme and a MA‐CP‐ABE were constructed, and both schemes allow unbounded attribute universe.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Online/offline unbounded multi-authority attribute-based encryption for data sharing in mobile cloud computing

Zhang

Zheng

et al. 2016

Security Comm. Networks

Self Cite

View full text Add to dashboard Cite

show abstract

“…The data owner generates the index for ciphertext using a self-centric access policy, indicating what kinds of receivers are given the privileges to gain access to these encrypted data. The receiver generates the trapdoor for the desired keyword using the private key she owns [19,20]. The cloud server checks if the trapdoor generated by receiver corresponds with the search index.…”

Section: Introductionmentioning

confidence: 99%

Towards Secure Data Retrieval for Multi-Tenant Architecture Using Attribute-Based Key Word Search

2017

View full text Add to dashboard Cite

Searchable encryption mechanism and attribute-based encryption (ABE) are two effective tools for providing fine-grained data access control in the cloud. Researchers have also taken their advantages to present searchable encryption schemes based on ABE and have achieved significant results. However, most of the existing key word search schemes based on ABE lack the properties of key exposure protection and highly efficient key updating when key leakage happens. To better tackle these problems, we present a key insulated attribute-based data retrieval scheme with key word search (KI-ABDR-KS) for multi-tenant architecture. In our scheme, a data owner can make a self-centric access policy of the encrypted data. Only when the possessing attributes match with the policy can a receiver generate a valid trapdoor and search the ciphertext. The proposed KI-ABDR-KS also provides full security protection when key exposure happens, which can minimize the damage brought by key exposure. Furthermore, the system public parameters remain unchanged during the process of key updating; this will reduce the considerable overheads brought by parameters synchronization. Finally, our KI-ABDR-KS is proven to be secure under chosen-keyword attack and achieves better efficiency compared to existing works.

show abstract

A lightweight privacy protection scheme based on user preference in mobile crowdsensing

Xiong

Hui

Jin

et al. 2020

Trans Emerging Tel Tech

Self Cite

View full text Add to dashboard Cite

Aiming at the balance between user personalized privacy protection and task data practicability in mobile crowdsensing, this article proposes a lightweight privacy protection (LightPrivacy) scheme based on the matching of attribute preferences between users and tasks with analytic hierarchy process (AHP), bloom filter, binary confusion vector inner product protocol, and differential privacy. First, the fog nodes are introduced to divide the subtasks of sensing tasks, and the optimal subtask set is selected and published through AHP. The fog nodes construct task bloom filter according to task attribute requirement preference. The sensing users construct user bloom filter based on intention attribute preference, and filter target users by calculating the binary confusion vector inner product of two bloom filters. Furthermore, the LightPrivacy scheme perceives sensing users to localize sensitive data that needs to be disturbed according to privacy budget distributed equally by fog nodes. Finally, the fog node evaluates the quality of sensing data and defines task contribution of sensing users in combination with the binary confusion vector inner product, so as to effectively prevent malicious users from submitting false data or adding large data perturbations. Security analysis indicates that the LightPrivacy scheme is still security under the condition that fog nodes are semi‐trusted. Experimental results show that the LightPrivacy scheme is practical and the computational efficiency is significantly improved compared with the related representative schemes.

show abstract

Provably secure unbounded multi‐authority ciphertext‐policy attribute‐based encryption

Cited by 27 publications

References 34 publications

Online/offline unbounded multi-authority attribute-based encryption for data sharing in mobile cloud computing

Online/offline unbounded multi-authority attribute-based encryption for data sharing in mobile cloud computing

Towards Secure Data Retrieval for Multi-Tenant Architecture Using Attribute-Based Key Word Search

A lightweight privacy protection scheme based on user preference in mobile crowdsensing

Contact Info

Product

Resources

About