Access control is one of the mechanisms for data protection in a compu
ter system. Many literatures based on cryptography have been proposed
to solve the problem of access control in hierarchic structures. Recen
tly, Liaw and Lei proposed an optimal heuristic algorithm for multilev
el data security. But, their heuristic algorithm can only be used in a
tree structure, which it is a special case of a partially-ordered hie
rarchy. In this article, we present a modification of their algorithm
that enables the algorithm to be used in a partially-ordered structure
.