A dynamic key management solution to access hierarchy

Get BibTex-formatted data

Author

Elisa Bertino, Xukai Zou, Yogesh Karandikar

Entry type

article

Abstract

Hierarchical access control (HAC) has been a fundamental problem in computer and network systems. Since Akl and Taylor proposed the first HAC scheme based on number theory in 1983, cryptographic key management techniques for HAC have appeared as a new and promising class of solutions to the HAC problem. Many cryptographic HAC schemes have been proposed in the past two decades. One common feature associated with these schemes is that they basically limited dynamic operations at the node level. In this paper, by introducing the innovative concept of 'access polynomial' and representing a key value as the sum of two polynomials in a finite field, we propose a new key management scheme for dynamic access hierarchy. The newly proposed scheme supports full dynamics at both the node level and user level in a uniform yet efficient manner. Furthermore, the new scheme allows access hierarchy to be a random structure and can be flexibly adapted to many other access models such as 'transfer down' and 'depth-limited transfer'.

Date

2007

URL

http://portal.acm.org/citation.cfm?id=1331910.1331913

Journal

International Journal of Network Management

Key alpha

Bertino

Pages

437-450

Volume

Affiliation

Purdue University

Publication Date

2007-00-00

Issn

1099-1190

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Article{ Bertino,
	title = "A dynamic key management solution to access hierarchy",
	author = "Elisa Bertino, Xukai Zou, Yogesh Karandikar",
	year = "2007",
	journal = "International Journal of Network Management",
	pages = "437-450",
	volume = "17",
	abstract = "Hierarchical access control (HAC) has been a fundamental problem in computer and network systems. Since Akl and Taylor proposed the first HAC scheme based on number theory in 1983, cryptographic key management techniques for HAC have appeared as a new and promising class of solutions to the HAC problem. Many cryptographic HAC schemes have been proposed in the past two decades. One common feature associated with these schemes is that they basically limited dynamic operations at the node level. In this paper, by introducing the innovative concept of 'access polynomial' and representing a key value as the sum of two polynomials in a finite field, we propose a new key management scheme for dynamic access hierarchy. The newly proposed scheme supports full dynamics at both the node level and user level in a uniform yet efficient manner. Furthermore, the new scheme allows access hierarchy to be a random structure and can be flexibly adapted to many other access models such as 'transfer down' and 'depth-limited transfer'.",
	affiliation = "Purdue University",
	issn = "1099-1190",
	url = "http://portal.acm.org/citation.cfm?id=1331910.1331913",
}