In this paper, we propose a hierarchical key management scheme based on polynomial interpolation technique. We review the existing hierarchical key management schemes based on polynomial interpolation technique for public space, private space, key derivation cost and forward/backward security requirements. The proposed scheme has several features. Only one key is stored by the user of any security class. The key derivation process requires only one polynomial evaluation and hash computations. We compare the proposed scheme with the schemes based on polynomial interpolation and show that our scheme is efficient. Our proposed scheme satisfies backward secrecy and forward secrecy requirements upon new class addition and existing class deletion respectively. Only one polynomial construction is required for rekeying during new class addition and existing class deletion. The proposed scheme is secure against common subordinate and collaborative attacks. © Springer-Verlag Berlin Heidelberg 2013.
CITATION STYLE
Purushothama, B. R., & Amberker, B. B. (2013). Efficient Hierarchical Key Management Scheme Based on Polynomial Construction. In Communications in Computer and Information Science (Vol. 377 CCIS, pp. 191–202). Springer Verlag. https://doi.org/10.1007/978-3-642-40576-1_19
Mendeley helps you to discover research relevant for your work.