An RSA-based time-bound hierarchical key assignment scheme for electronic article subscription

Jyh Haw Yeh

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

30 Scopus citations

Abstract

The time-bound hierarchical key assignment problem is to assign time sensitive keys to security classes in a partially ordered hierarchy so that legal data accesses among classes can be enforced. Two time-bound hierarchical key assignment schemes have been proposed in the literature, but both of them were proved insecure against collusive attacks. In this paper, we will propose an RSA-based time-bound hierarchical key assignment scheme and describe its possible application. The security analysis shows that the new scheme is safe against the collusive attacks.

Original languageEnglish
Title of host publicationCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
PublisherAssociation for Computing Machinery (ACM)
Pages285-286
Number of pages2
ISBN (Print)1595931406, 9781595931405
DOIs
StatePublished - 2005
EventCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management - Bremen, Germany
Duration: 31 Oct 20055 Nov 2005

Publication series

NameInternational Conference on Information and Knowledge Management, Proceedings

Conference

ConferenceCIKM'05 - Proceedings of the 14th ACM International Conference on Information and Knowledge Management
Country/TerritoryGermany
CityBremen
Period31/10/055/11/05

Keywords

  • Access Control
  • Key Assignment

Fingerprint

Dive into the research topics of 'An RSA-based time-bound hierarchical key assignment scheme for electronic article subscription'. Together they form a unique fingerprint.

Cite this