Dept. of Electr. Eng., National Taiwan Univ.Kuo, F.H.F.H.KuoShen, V.R.L.V.R.L.ShenChen, T.S.T.S.ChenFEI-PEI LAI2018-09-102018-09-101999-09https://www.scopus.com/inward/record.uri?eid=2-s2.0-0033334588&doi=10.1049%2fip-cdt%3a19990311&partnerID=40&md5=b2ea21185cc0d616f79588453eab2d47The authors present a cryptographic key assignment scheme based on both the Rabin public key system and the Chinese remainder theorem, in order to solve dynamic access control problems in user hierarchies. Compared to earlier assignment schemes, the new scheme ensures that a security class can efficiently derive secret keys of its successors. Dynamic access control problems, such as adding/deleting classes, adding/deleting relationships, and changing secret keys, are considered. Moreover, without altering other keys present in the system, each user in the hierarchy can freely change his own key. © lEE, 1999.application/pdf644423 bytesapplication/pdf[SDGs]SDG16Hierarchical systems; Problem solving; Cryptographic key assignment; Dynamic access control; Cryptographyjournal article10.1049/ip-cdt:199903112-s2.0-0033334588WOS:000084105400003