Time-Bound Hierarchical Key Assignment : An Overview
スポンサーリンク
概要
- 論文の詳細を見る
The access privileges in distributed systems can be effectively organized as a partial-order hierarchy that consists of distinct security classes, and the access rights are often designated with certain temporal restrictions. The time-bound hierarchical key assignment problem is to assign distinct cryptographic keys to distinct security 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 these keys are time-variant with respect to sequentially allocated temporal units called time slots. In this paper, we present the involved principle, survey the state of the art, and particularly, look into two representative approaches to time-bound hierarchical key assignment for in-depth case studies.
- （社）電子情報通信学会の論文
- 2010-05-01
著者
-
Zhu Wen
State Key Laboratory Of Information Security Graduate University Of Chinese Academy Of Sciences
-
Bao Feng
Institute For Infocomm Research
-
Zhou Jianying
Institute For Infocomm Research
-
Deng Robert
School Of Information Systems Singapore Management University
-
Deng Robert
School Of Information Systems Singapore Management Univ.
関連論文
- A More Efficient Improvement of the Virtual Software Token Protocols (Fundamental Theories for Communications)
- Security Notes on Generalization of Threshold Signature and Authenticated Encryption(Information Security)
- Reliable Broadcasting and Secure Distributing in Channel Networks(Special Section on Discrete Mathematics and Its Applications)
- Cryptanalysis of a Hierarchical Identity-Based Encryption Scheme
- Time-Bound Hierarchical Key Assignment : An Overview
- Security Analysis on an Improvement of RSA-Based Password Authenticated Key Exchange(Fundamental Theories for Communications)
- A Survey on Privacy Frameworks for RFID Authentication
- An Efficient and Secure Service Discovery Protocol for Ubiquitous Computing Environments