Hierarchical attribute‐based encryption with continuous auxiliary inputs leakage

Guo, Yuyan; Li, Jiguo; Zhang, Yichen; Shen, Jian

doi:10.1002/sec.1659

Cited by 17 publications

(6 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In their work, they used the HABE approach to provide user anonymity and also traceability of dishonest users. Guo et al [41] proposed an HABE scheme with continuous auxiliary input leakage. Li et al [42] designed an HABE scheme with continuous leakage-resilience.…”

Section: Related Workmentioning

confidence: 99%

“…In other words, Pr (B(g, g α , g β , g γ ,ê(g, g) αβγ ) = 1) = Pr(LW-RHABE A , (λ)). (41) Also, when z is a uniform element of Z q , h =ê(g, g) z is also a uniform element of G 2 . Therefore, assuming that H and S are secure, one can see that PCT T does not leak any partial information about M b and therefore, Pr(B(g, g α , g β , g γ ,ê(g, g) z )) = 1) = 1 2 .…”

Section: Security Analysismentioning

confidence: 99%

See 1 more Smart Citation

Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things

2020

View full text Add to dashboard Cite

The Internet of Things (IoT) is an emerging technology that can benefit from cloud infrastructure. In a cloud-based IoT network, a variety of data is collected by smart devices and transmitted to a cloud server. However, since the data may contain sensitive information about individuals, providing confidentiality and access control is essential to protect the users' privacy. Attribute-based encryption (ABE) is a promising tool to provide these requirements. However, most of ABE schemes neither provide efficient encryption and decryption mechanisms nor offer flexible and efficient key delegation and user revocation approaches. In this paper, to address these issues, we propose a lightweight revocable hierarchical ABE (LW-RHABE) scheme. In our scheme, computation overhead on the user side is very efficient, and most of the computational operations are performed by the cloud server. Also, using the hierarchical model, our scheme offers flexible and scalable key delegation and user revocation mechanisms. Indeed, in our scheme, key delegation and user revocation associated with each attribute can be handled by several key authorities. We provide the security definition for LW-RHABE, and we prove its security in the standard model and under the hardness assumption of the decisional bilinear Diffie-Hellman (DBDH) problem. INDEX TERMS Internet of Things, cloud computing, fine-grained access control, attribute-based encryption, light weight computation.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Security Analysismentioning

confidence: 99%

Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things

2020

View full text Add to dashboard Cite

show abstract

“…In order to improve efficiency, Emura et al [28] presented a CP-ABE scheme with constant ciphertext size. Many ABE schemes [29][30][31][32][33][34][35][36][37][38] were presented in various application domains, such as ABE with outsourced data decryption [29,30,37], ABE with efficient attribute revocation [31], ABE with full verifiability [30], ABE with keyword search function [29,31], traceable ABE [32,33], ABE with leakage resilience [34][35][36], auditable ABE [38], etc. In order to solve key escrow problem, Li et al [39,40] presented two certificate-based encryption schemes with leakage resilience.…”

Section: Related Workmentioning

confidence: 99%

Two-Party Attribute-Based Key Agreement Protocol with Constant-Size Ciphertext and Key

Zhang

2018

Security and Communication Networks

Self Cite

View full text Add to dashboard Cite

Based on mutual authentication, the session key is established for communication nodes on the open network. In order to satisfy fine-grained access control for cloud storage, the two-party attribute-based key agreement protocol (TP-AB-KA) was proposed. However, the existing TP-AB-KA protocol is high in the cost of computation and communication and is not unfit for application in a mobile cloud setting because mobile devices are generally resource constrained. To solve the above issue, we propose a TP-AB-KA protocol with constant-size ciphertext and key. Our TP-AB-KA protocol is provable security in the standard model. The concrete proof is given under the augmented multisequence of exponents' decisional Diffie-Hellman (aMSE-DDH) hypothesis in the attribute-based BJM model (AB-BJM). Compared with the existing TP-AB-KA protocols, the computation cost and communication cost of our protocol are largely reduced.

show abstract

“…The authorities collect the corresponding combinations of attributes and determine which data users decrypt such data. To achieve scalable, flexible, and fine-grained access control, some hierarchical attribute-based encryption schemes [23][24][25] were presented. In order to protect the privacy, Lai et al [27] and Li et al [28] provided ABE schemes with hidden access policy.…”

Section: Related Workmentioning

confidence: 99%

Improving Security and Privacy-Preserving in Multi-Authorities Ciphertext-Policy Attribute-Based Encryption

2018

KSII TIIS

View full text Add to dashboard Cite

Most of existing privacy-preserving multi-authorities attribute-based encryption schemes (PP-MA-ABE) only considers the privacy of the user identity (ID). However, in many occasions information leakage is caused by the disclosing of his/her some sensitive attributes. In this paper, we propose a collusion-resisting ciphertext-policy PP-MA-ABE (CRPP-MACP-ABE) scheme with hiding both user's ID and attributes in the cloud storage system. We present a method to depict anonymous users and introduce a managerial role denoted by IDM for the management of user's anonymous identity certificate (Cred AID). The scheme uses Cred AID to realize privacy-preserving of the user, namely, by verifying which attribute authorities (AAs) obtain the blinded public attribute keys, pseudonyms involved in the Cred AID and then distributes corresponding private keys for the user. We use different pseudonyms of the user to resist the collusion attack launched by vicious AAs. In addition, we utilize IDM to cooperate with multiple authorities in producing consistent private key for the user to avoid the collusion attack launched by vicious users. The proposed CRPP-MACP-ABE scheme is proved secure. Some computation and communication costs in our scheme are finished in preparation phase (i.e. user registration). Compared with the existing schemes, our scheme is more efficient.

show abstract

Hierarchical attribute‐based encryption with continuous auxiliary inputs leakage

Cited by 17 publications

References 34 publications

Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things

Lightweight Revocable Hierarchical Attribute-Based Encryption for Internet of Things

Two-Party Attribute-Based Key Agreement Protocol with Constant-Size Ciphertext and Key

Improving Security and Privacy-Preserving in Multi-Authorities Ciphertext-Policy Attribute-Based Encryption

Contact Info

Product

Resources

About