Hidden Ciphertext Policy Attribute-Based Encryption Under Standard Assumptions

Phuong, Tran Viet Xuan; Yang, Guomin; Susilo, Willy

doi:10.1109/tifs.2015.2475723

Cited by 145 publications

(47 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To support the multi-domains environment, multi-authority ABE schemes [14], [16] were designed to support the multiple authorized entities to distribute decryption keys. To protect user's privacy, scholars proposed anonymous ABE schemes [18], [19] and policy-hidden ABE schemes [20], [21] respectively. The former prevents user identities from being leaked, while the latter hides access control policies.…”

Section: Related Workmentioning

confidence: 99%

Efficient and Secure Ciphertext-Policy Attribute-Based Encryption Without Pairing for Cloud-Assisted Smart Grid

Wang

Chen

et al. 2020

IEEE Access

View full text Add to dashboard Cite

Cloud-assisted smart grid has been broadly deployed to improve the economics, efficiency, sustainability, and reliability of electricity services. The new revolution of technology will also bring new challenges to data security, particularly data confidentiality. As a promising encryption method for supporting fine-grained access control, attribute-based encryption (ABE) is widely given attention by the academia and industry. However, most existing schemes suffer from the efficiency problem limiting its deployment for the cloud-assisted smart grid, especially for resource-limited users. To address this problem, this paper proposes two efficient pairing-free ciphertext-policy attribute-based schemes that eliminate the computation-intensive bilinear pairing operation. The basic scheme only uses some simple scalar multiplications based on elliptic curves, and the enhanced scheme provides an important usability feature, namely the users and attributes revocation. The security of the proposed schemes is reduced to the elliptic curve decisional Diffie-Hellman problem. Finally, the performance analysis and extensive experiments demonstrate that our proposed schemes are suitable for the cloud-assisted smart grid. INDEX TERMS Cloud-assisted smart grid, access control, ciphertext-policy attribute-based encryption, pairing-free.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient and Secure Ciphertext-Policy Attribute-Based Encryption Without Pairing for Cloud-Assisted Smart Grid

Wang

Chen

et al. 2020

IEEE Access

View full text Add to dashboard Cite

show abstract

“…To ensure data security in smart health, Zhang and Zhen [22] realize the fine-grained access control, cipher text-policy attribute based encryption (CP-ABE). To achieve privacy and authorized access, many other schemes [23][24][25][26][27][28][29][30][31][32][33] are proposed in diverse fields and applications.…”

Section: The Related Workmentioning

confidence: 99%

An efficient and secure data sharing scheme for mobile devices in cloud computing

Pan

Xian

2020

J Cloud Comp

View full text Add to dashboard Cite

With the development of big data and cloud computing, more and more enterprises prefer to store their data in cloud and share the data among their authorized employees efficiently and securely. So far, many different data sharing schemes in different fields have been proposed. However, sharing sensitive data in cloud still faces some challenges such as achieving data privacy and lightweight operations at resource constrained mobile terminals. Furthermore, most data sharing schemes have no integrity verification mechanism, which would result in wrong computation results for users. To solve the problems, we propose an efficient and secure data sharing scheme for mobile devices in cloud computing. Firstly, the scheme guarantees security and authorized access of shared sensitive data. Secondly, the scheme realizes efficient integrity verification before users share the data to avoid incorrect computation. Finally, the scheme achieves lightweight operations of mobile terminals on both data owner and data requester sides.

show abstract

“…The ciphertext size in most constructions of CP-ABE, for example, [8,26,22,7,3,17], is (at least) linear in the number of selected attributes. The first CP-ABE with constant-size ciphertexts under (n, n)-threshold access structure was proposed in [11].…”

Section: Related Workmentioning

confidence: 99%

Constant-size ciphertexts in threshold attribute-based encryption without dummy attributes

Susilo

Yang

Guo

et al. 2018

Information Sciences

Self Cite

View full text Add to dashboard Cite

Attribute-based encryption (ABE) is an augmentation of public key encryption that allows users to encrypt and decrypt messages based on users' attributes. In a ( t, s ) threshold ABE, users who can decrypt a ciphertext must hold at least t attributes among the s attributes specified by the encryptor. At PKC 2010, Herranz, Laguillaumie and Ràfols proposed the first threshold ABE with constant-size ciphertexts. In order to ensure the encryptor can flexibly select the attribute set and a threshold value, they use dummy attributes to satisfy the decryption requirement. The advantage of their scheme is that any addition or removal of the attributes will not require any change to users' private keys or public parameters. Unfortunately, the need for dummy attributes makes their scheme inefficient, since the computational cost of encryption is linear to the size of selected attribute set and dummy attribute set. In this work, we improve Herranz et al. 's work, and propose a new threshold ABE scheme which does not use any dummy attribute . Our scheme not only retains the nice feature of Herranz et al. 's scheme, but also offers two improvements in comparison to the previous work. Firstly, the computational costs of encryption and decryption are only linear in the size of the selected attribute set. Secondly, without any dummy attribute, most of the computations can be conducted without the knowledge of the threshold t . Hence, threshold change in the encryption phase does not require complete recomputation of the ciphertext. AbstractAttribute-based encryption (ABE) is an augmentation of public key encryption that allows users to encrypt and decrypt messages based on users' attributes. In a (t, s) threshold ABE, users who can decrypt a ciphertext must hold at least t attributes among the s attributes specified by the encryptor. At PKC 2010, Herranz, Laguillaumie and Ràfols proposed the first threshold ABE with constant-size ciphertexts. In order to ensure the encryptor can flexibly select the attribute set and a threshold value, they use dummy attributes to satisfy the decryption requirement. The advantage of their scheme is that any addition or removal of the attributes will not require any change to users' private keys or public parameters. Unfortunately, the need for dummy attributes makes their scheme inefficient, since the computational cost of encryption is linear to the size of selected attribute set and dummy attribute set. In this work, we improve Herranz et al.'s work, and propose a new threshold ABE scheme which does not use any dummy attribute. Our scheme not only retains the nice feature of Herranz et al.'s scheme, but also offers two improvements in comparison to the previous work. Firstly, the computational costs of encryption and decryption are only linear in the size of the selected attribute set. Secondly, without any dummy attribute, most of the computations can be conducted without the knowledge of the threshold t. Hence, threshold change in the encryption phase does not require complete reco...

show abstract

Hidden Ciphertext Policy Attribute-Based Encryption Under Standard Assumptions

Cited by 145 publications

References 14 publications

Efficient and Secure Ciphertext-Policy Attribute-Based Encryption Without Pairing for Cloud-Assisted Smart Grid

Efficient and Secure Ciphertext-Policy Attribute-Based Encryption Without Pairing for Cloud-Assisted Smart Grid

An efficient and secure data sharing scheme for mobile devices in cloud computing

Constant-size ciphertexts in threshold attribute-based encryption without dummy attributes

Contact Info

Product

Resources

About