An optimal algorithm to assign cryptographic keys in a tree structure for access control
Journal
BIT
Journal Volume
33
Journal Issue
1
Pages
46-56
Date Issued
1993
Author(s)
Liaw, H.-T.
Abstract
In a computer communication system, there exists a possibility of two or more users collaborating to derive a key to which they are not entitled. Therefore, a method for ensuring the system is necessary. In this paper, we propose an efficient heuristic algorithm for assigning cryptographic keys among a group of users organized in a tree structure. Comparing 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. © 1993 BIT Foundations.
Type
journal article