Comments on a cryptographic key assignment scheme

Authors:
Qiang Tang;Chris J. Mitchell
Affiliations:
Information Security Group, University of London, Royal Holloway, Egham Surrey TW20 0EX, UK;Information Security Group, University of London, Royal Holloway, Egham Surrey TW20 0EX, UK
Venue:
Computer Standards & Interfaces
Year:
2005

Citing 0
Cited 6

Provably-secure time-bound hierarchical key assignment schemes

Proceedings of the 13th ACM conference on 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
A secure time-bound hierarchical key assignment scheme based on RSA public key cryptosystem

Information Processing Letters
New constructions for provably-secure time-bound hierarchical key assignment schemes

Theoretical Computer Science
Design of a lattice-based access control scheme

SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Incorporating temporal capabilities in existing key management schemes

ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we analyse the security of a cryptographic key assignment scheme, recently proposed by Huang and Chang, that is designed to provide time-constrained hierarchical access control. We show that the new scheme has potential security vulnerabilities, which enable malicious users and attackers to violate the privacy of other users.