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

Abstract

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.

Extended hierarchical key assignment scheme (E-HKAS): how to efficiently enforce explicit policy exceptions in dynamic hierarchies

“…Majority of HKAS proposed afterwards are proved to be secure under the formal security notions named ''key indistinguishability'' (KI) or ''key nonrecoverability'' given by Atallah et al [1]. Odelu et al [17] proposed a HKAS in public-key cryptography setting that uses linear polynomials and elliptic curve cryptography (ECC). Their scheme is proved to be secure against key recovery (KR) under various practical attack scenarios.…”