The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
분산 시스템의 액세스 권한은 별개의 보안 클래스로 구성된 부분 순서 계층 구조로 효과적으로 구성될 수 있으며 액세스 권한은 종종 특정 시간적 제한으로 지정됩니다. 시간 제한 계층적 키 할당 문제는 상위 클래스의 사용자가 자신의 클래스 키를 사용하여 하위 클래스의 키를 파생할 수 있도록 권한에 따라 별도의 보안 클래스에 별도의 암호화 키를 할당하는 것입니다. 시간 슬롯이라고 불리는 순차적으로 할당된 시간 단위에 관한 것입니다. 본 논문에서는 관련된 원리를 제시하고, 최신 기술을 조사하며, 특히 심층적인 사례 연구를 위해 시간 제한 계층적 키 할당에 대한 두 가지 대표적인 접근 방식을 살펴봅니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Wen Tao ZHU, Robert H. DENG, Jianying ZHOU, Feng BAO, "Time-Bound Hierarchical Key Assignment: An Overview" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 5, pp. 1044-1052, May 2010, doi: 10.1587/transinf.E93.D.1044.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.1044/_p
부
@ARTICLE{e93-d_5_1044,
author={Wen Tao ZHU, Robert H. DENG, Jianying ZHOU, Feng BAO, },
journal={IEICE TRANSACTIONS on Information},
title={Time-Bound Hierarchical Key Assignment: An Overview},
year={2010},
volume={E93-D},
number={5},
pages={1044-1052},
abstract={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.},
keywords={},
doi={10.1587/transinf.E93.D.1044},
ISSN={1745-1361},
month={May},}
부
TY - JOUR
TI - Time-Bound Hierarchical Key Assignment: An Overview
T2 - IEICE TRANSACTIONS on Information
SP - 1044
EP - 1052
AU - Wen Tao ZHU
AU - Robert H. DENG
AU - Jianying ZHOU
AU - Feng BAO
PY - 2010
DO - 10.1587/transinf.E93.D.1044
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 5
JA - IEICE TRANSACTIONS on Information
Y1 - May 2010
AB - 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.
ER -