TY - JOUR
T1 - Comments on 'dynamic key management schemes for access control in a hierarchy'
AU - Lee, Narn Yih
AU - Hwang, Tzonelih
PY - 1999
Y1 - 1999
N2 - In 1997, Lin proposed a new dynamic access control scheme with a central authority for users organized in a hierarchy. The author claimed that the new scheme has many advantages, e.g. any class can change its group key for security reasons without affecting the others. However, this paper will show that once the old group key of a class is exposed, the newly chosen group key can be easily derived by the old key. Moreover, we shall show that if the identity of a class has a few bits different from those of the other classes, a user in the class can easily derive the group keys of these classes to which he/she is not entitled.
AB - In 1997, Lin proposed a new dynamic access control scheme with a central authority for users organized in a hierarchy. The author claimed that the new scheme has many advantages, e.g. any class can change its group key for security reasons without affecting the others. However, this paper will show that once the old group key of a class is exposed, the newly chosen group key can be easily derived by the old key. Moreover, we shall show that if the identity of a class has a few bits different from those of the other classes, a user in the class can easily derive the group keys of these classes to which he/she is not entitled.
UR - http://www.scopus.com/inward/record.url?scp=0032638189&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0032638189&partnerID=8YFLogxK
U2 - 10.1016/s0140-3664(98)00216-3
DO - 10.1016/s0140-3664(98)00216-3
M3 - Review article
AN - SCOPUS:0032638189
SN - 0140-3664
VL - 22
SP - 87
EP - 89
JO - Computer Communications
JF - Computer Communications
IS - 1
ER -