Trade-Offs in Cryptographic Implementations of Temporal Access Control

Authors:
Jason Crampton
Affiliations:
Information Security Group, Royal Holloway, University of London,
Venue:
NordSec '09 Proceedings of the 14th Nordic Conference on Secure IT Systems: Identity and Privacy in the Internet Age
Year:
2009

Citing 9
Cited 2

Cryptographic solution to a problem of access control in a hierarchy

ACM Transactions on Computer Systems (TOCS)
A lattice model of secure information flow

Communications of the ACM
TRBAC: A temporal role-based access control model

ACM Transactions on Information and System Security (TISSEC)
A temporal key management scheme for secure broadcasting of XML documents

Proceedings of the 9th ACM conference on Computer and communications security
Dynamic and efficient key management for access hierarchies

Proceedings of the 12th ACM conference on Computer and communications security
On Key Assignment for Hierarchical Access Control

CSFW '06 Proceedings of the 19th IEEE workshop on Computer Security Foundations
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
Incorporating temporal capabilities in existing key management schemes

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

Time-specific encryption

SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Practical and efficient cryptographic enforcement of interval-based access control policies

ACM Transactions on Information and System Security (TISSEC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent years, we have seen the development of key assignment schemes that use cryptography to enforce time-based authorization policies. One of the most important aspects of these schemes is the balance between the time required to derive keys and the amount of storage required for the public information from which keys are derived. The derivation time and storage are dependent on the number of time periods used in the authorization policy. In this paper, we discuss novel schemes that achieve good trade-offs between these competing parameters and for which explicit bounds can be given in terms of the number of time periods.