A dynamic cryptographic key assignment scheme in a tree structure
Journal
Computers and Mathematics with Applications
Journal Volume
25
Journal Issue
6
Pages
109-114
Date Issued
1993
Author(s)
Abstract
In this paper, we propose a dynamic cryptographic key assignment scheme based on Newton's interpolation method and a predefined one way function. All users are classified into disjoint sets of security classes that employ the relation of partial ordering, that is, a security class at higher level can derive from his own cryptographic key the keys of the other security class below him. Compared with the existing assignment schemes, our scheme always produces economic cryptographic keys, which are smaller than the keys generated by the previous work in a tree structure. Furthermore, whenever a new security class is inserted into the user hierarchy system, the corresponding keys can be determined without changing any existing keys. Therefore, our scheme is suitable for practical implementation. © 1993.
Type
journal article