๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A cryptographic key assignment scheme in a hierarchy for access control

โœ Scribed by Hwang Min-Shiang


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
416 KB
Volume
26
Category
Article
ISSN
0895-7177

No coin nor oath required. For personal study only.

โœฆ Synopsis


Access control is one of the mechanisms for data protection in a computer system. Many literaturee besed on cryptography have been proposed to solve the problem of access control in hierarchic structurea. Recently, Liaw and Lei proposed an optimal heuristic algorithm for multilevel data security. But, their heuristic algorithm can only be used in a tree structure, which it is a special cese of a partially-ordered hierarchy. In this article, we present 8 modification of their algorithm that enables the algorithm to be used in a partially-ordered structure.


๐Ÿ“œ SIMILAR VOLUMES


Cryptanalyses and improvements of two cr
โœ Chien-Lung Hsu; Tzong-Sun Wu ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 152 KB

## Recently, Wu and Chang and Shen and Chen separately proposed a cryptographic key assignment scheme for solving access control problem in a partially ordered user hierarchy. However, this paper will show the security leaks inherent in both schemes based on polynomial interpolations. That is, the u