A time-bound hierarchical key assignment cryptosystem with no lifetime limit

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Key assignment schemes for controlling access in a partially ordered hierarchy has been studied for years. Recently, the research of this topic has focused on assigning hierarchical keys which are also sensitive to time. Most of the proposed time-bound hierarchical key assignment schemes in the literature are extremely difficult to extend the life of a system since it may require to re-assign existing keys. Changing existing keys leads to a very time-consuming process: data reencryption. By the author's best knowledge, this issue was not yet studied in the literature. In this paper, a new scheme is proposed, in which the system's life can be extended without affecting any existing key so that no data re-encryption is necessary.

Original languageEnglish
Title of host publicationProceedings of The 2007 International Conference on Security and Management, SAM'07
Pages131-137
Number of pages7
StatePublished - 2007
Event2007 International Conference on Security and Management, SAM'07 - Las Vegas, NV, United States
Duration: 25 Jun 200728 Jun 2007

Publication series

NameProceedings of The 2007 International Conference on Security and Management, SAM'07

Conference

Conference2007 International Conference on Security and Management, SAM'07
Country/TerritoryUnited States
CityLas Vegas, NV
Period25/06/0728/06/07

Keywords

  • Access control
  • Cryptography
  • Key assignment
  • Time-bound

Fingerprint

Dive into the research topics of 'A time-bound hierarchical key assignment cryptosystem with no lifetime limit'. Together they form a unique fingerprint.

Cite this