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

Authors:
Jyh-haw Yeh
Affiliations:
Boise State University, Boise, ID
Venue:
Proceedings of the 14th ACM international conference on Information and knowledge management
Year:
2005

Citing 6
Cited 7

Cryptographic implementation of a tree hierarchy for access control

Information Processing Letters
A cryptographic key generation scheme for multilevel data security

Computers and Security
Cryptographic solution to a problem of access control in a hierarchy

ACM Transactions on Computer Systems (TOCS)
A Time-Bound Cryptographic Key Assignment Scheme for Access Control in a Hierarchy

IEEE Transactions on Knowledge and Data Engineering
Security of Tzeng's Time-Bound Key Assignment Scheme for Access Control in a Hierarchy

IEEE Transactions on Knowledge and Data Engineering
Efficient Time-Bound Hierarchical Key Assignment Scheme

IEEE Transactions on Knowledge and Data Engineering

Provably-secure time-bound hierarchical key assignment schemes

Proceedings of the 13th ACM conference on Computer and communications security
Efficient techniques for realizing geo-spatial access control

ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
New constructions for provably-secure time-bound hierarchical key assignment schemes

Proceedings of the 12th ACM symposium on Access control models and technologies
New constructions for provably-secure time-bound hierarchical key assignment schemes

Theoretical Computer Science
A novel e-newspapers publication system using provably secure time-bound hierarchical key assignment scheme and XML security

GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
Incorporating temporal capabilities in existing key management schemes

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
A note on time-bound hierarchical key assignment schemes

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.