An improvement of a dynamic cryptographic key assignment scheme in a tree hierarchy
type: Item
instance of: scholarly article
title: An improvement of a dynamic cryptographic key assignment scheme in a tree hierarchy
zbMATH Open document ID: 0935.94020
DOI: 10.1016/S0898-1221(99)00042-5
author: Min-Shiang Hwang
publication date: 2000-01-20T00:00:00Z
review text: Recently, \textit{H. T. Liaw}, \textit{S. J. Wang} and \textit{C. L. Lei} [Comput. Math. Appl. 25, No. 6, 109-114 (1993; Zbl 0796.68085)], proposed an efficient cryptographic key assignment scheme for solving the access control problem in a tree structure. Basically, the scheme is based on Newton's interpolating method and a one-way function. The scheme not only achieves dynamic key assignment, but is also simple and efficient for generating and derivating keys. However, the author shows that several security classes can collaborate to derive the secret key of their immediate ancestor in this article. He also proposes two schemes for modifying Liaw-Wang-Lei's scheme slightly so that the security will be greatly improved.
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 1391513
zbMATH Keywords: cryptography
zbMATH Keywords: data security
zbMATH Keywords: access control
MaRDI profile type: Publication
cites work: A dynamic cryptographic key assignment scheme in a tree structure
cites work: Q4200184
cites work: Number theory in science and communication. With applications in cryptography, physics, biology, digital information, and computing
full work available at URL: s0898-1221(99)00042-5
OpenAlex ID: W2028781764
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 1391513