A time-bound cryptographic key assignment scheme for access control in a hierarchy
檔案
- 000173150100013.pdf (182.2 KB, Adobe PDF)
日期
2002-01-01
作者
類型
系所
期刊名稱
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
卷期與頁次
第 14 卷第 1 期,頁 182–188
ISSN
1041-4347
語言
英文
摘要
The cryptographic key assignment problem is to assign cryptographic keys to a set of partially ordered classes so that the cryptographic key of a higher class can be used to derive the cryptographic key of a lower class. In this paper, we propose a time-bound cryptographic key assignment scheme in which the cryptographic keys of a class are different for each time period, that is, the cryptographic key of class C-1 at time t is K-i,K-t. Key derivation is constrained not only by the class relation, but also the time period. In our scheme, each user holds some secret parameters whose number is independent of the number of the classes in the hierarchy and the total time periods. We present two novel applications of our scheme. One is to broadcast data to authorized users in a multilevel-security way and the other is to construct a flexible cryptographic key backup system.
所屬典藏
期刊論文引用此條目
Tzeng, W. (2002). A time-bound cryptographic key assignment scheme for access control in a hierarchy. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 14(1), 182–188. https://doi.org/10.1109/69.979981
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/29126