DocumentCode :
1066008
Title :
Efficient time-bound hierarchical key assignment scheme
Author :
Hung-Yu Chen
Author_Institution :
Dept. of Inf. Manage., Chaoyang Univ. of Technol., Taichung, Taiwan
Volume :
16
Issue :
10
fYear :
2004
Firstpage :
1301
Lastpage :
1304
Abstract :
The access privileges in distributed systems can be effectively organized as a hierarchical tree that consists of distinct classes. A hierarchical time-bound key assignment scheme is to assign distinct cryptographic keys to distinct classes according to their privileges so that users from a higher class can use their class key to derive the keys of lower classes, and the keys are different for each time period; therefore, key derivation is constrained by both the class relation and the time period. We propose, based on a tamper-resistant device, a new time-bound key assignment scheme that greatly improves the computational performance and reduces the implementation cost.
Keywords :
cryptography; trees (mathematics); access privileges; computational performance; distinct classes; distinct cryptographic keys; distributed systems; hierarchical tree; implementation cost reduction; tamper-resistant device; time-bound hierarchical key assignment scheme; Classification tree analysis; Communication system security; Computer Society; Costs; Cryptography; Digital TV; Information security; Secure storage; Subscriptions; TV broadcasting; 65; Index Terms- Cryptography; hierarchical key assignment.;
fLanguage :
English
Journal_Title :
Knowledge and Data Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
1041-4347
Type :
jour
DOI :
10.1109/TKDE.2004.59
Filename :
1324636
Link To Document :
بازگشت