An efficient key assignment scheme for access control in a large leaf class hierarchy

Lo, Jung-Wen; Hwang, Min‐Shiang; Liu, Chia-Hsin

doi:10.1016/j.ins.2010.09.033

Cited by 16 publications

(8 citation statements)

References 23 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ereafter, many researchers proposed numerous dependent key schemes [15][16][17][18][19]. One of the main approaches to construct a dependent key scheme is to use a prime number's fundamental properties [13,20,21], which brings in some additional drawbacks, such as large public information, vulnerable to GCD operation and collusive attack [22,23]. anks to the lower computation overhead and smaller key size, elliptic curve cryptosystem (ECC) was devoted to constructing the dependent key schemes in [24,25].…”

Section: Introductionmentioning

confidence: 99%

A Novel Hierarchical Key Assignment Scheme for Data Access Control in IoT

Chen

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

Hierarchical key assignment scheme is an efficient cryptographic method for hierarchical access control, in which the encryption keys of lower classes can be derived by the higher classes. Such a property is an effective way to ensure the access control security of Internet of Things data markets. However, many researchers on this field cannot avoid potential single point of failure in key distribution, and some key assignment schemes are insecure against collusive attack or sibling attack or collaborative attack. In this paper, we propose a hierarchical key assignment scheme based on multilinear map to solve the multigroup access control in Internet of Things data markets. Compared with previous hierarchical key assignment schemes, our scheme can avoid potential single point of failure in key distribution. Also the central authority of our scheme (corresponding to the data owner in IoT data markets) does not need to assign the corresponding encryption keys to each user directly, and users in each class can obtain the encryption key via only a one-round key agreement protocol. We then show that our scheme satisfies the security of key indistinguishability under decisional multilinear Diffie-Hellman assumption. Finally, comparisons show the efficiency of our scheme and indicates that our proposed scheme can not only resist the potential attacks, but also guarantee the forward and backward security.

show abstract

Section: Introductionmentioning

confidence: 99%

A Novel Hierarchical Key Assignment Scheme for Data Access Control in IoT

Chen

et al. 2021

Security and Communication Networks

View full text Add to dashboard Cite

show abstract

“…Atallah et al (2005Atallah et al ( , 2009) also proposed a dynamic efficient access control scheme based on one-way hash function. However, as pointed out in Lo et al (2011), their scheme is not suitable for a deep tree structural hierarchy or in a situation where a tree contains the complex relationships.…”

Section: Figurementioning

confidence: 99%

A novel linear polynomial-based dynamic key management scheme for hierarchical access control

Odelu

Das

Goswami

2013

IJTMCC

View full text Add to dashboard Cite

Several key management schemes for dynamic access control in a user hierarchy are proposed in the literature. Most schemes are based on elliptic curve cryptography (ECC) and polynomial interpolation. Due to time-consuming operations involved in the elliptic curve scalar multiplication and construction of interpolating polynomials, most existing schemes require high storage and computational complexity. Moreover, most of the proposed schemes are vulnerable to different attacks including the man-in-the-middle attacks. In this paper, we devise a novel key management scheme for hierarchical access control based on linear polynomials only. We show that our scheme is secure against all possible different attacks including the man-in-the-middle attack, which are required for designing an access control scheme, through both the informal and formal security analysis. The computational cost and the storage space are significantly reduced in our scheme while compared to the recently proposed related schemes. Thus, our scheme is much suitable for practical applications.

show abstract

“…Atallah et al proposed a dynamic efficient access control scheme [3], [4] based on one-way hash functions. However, as pointed out in [9], their scheme is not suitable for a deep tree hierarchy or in a situation where a tree contains complex relationships.…”

Section: Related Workmentioning

confidence: 99%

A Novel Key Management Mechanism for Dynamic Hierarchical Access Control Based on Linear Polynomials

Odelu

Das

Goswami

2012

Communications in Computer and Information Science

View full text Add to dashboard Cite

Abstract. Several key management schemes for dynamic access control in a user hierarchy are proposed in the literature based on elliptic curve cryptosystem (ECC) and polynomial interpolation. Since the elliptic curve scalar multiplication and construction of interpolating polynomials are time-consuming operations, most of the proposed schemes require high storage and computational complexity. Further, most of the proposed schemes are vulnerable to different attacks including the manin-the-middle attacks. In this paper, we propose a novel key management scheme for hierarchical access control based on linear polynomials only. We show that our scheme is secure against different attacks including the man-in-the-middle attack, which are required for an idle access control scheme. Moreover, the computational cost and the storage space are significantly reduced in our scheme while compared to the recently proposed related schemes.

show abstract

An efficient key assignment scheme for access control in a large leaf class hierarchy

Cited by 16 publications

References 23 publications

A Novel Hierarchical Key Assignment Scheme for Data Access Control in IoT

A Novel Hierarchical Key Assignment Scheme for Data Access Control in IoT

A novel linear polynomial-based dynamic key management scheme for hierarchical access control

A Novel Key Management Mechanism for Dynamic Hierarchical Access Control Based on Linear Polynomials

Contact Info

Product

Resources

About