School of Computing

Back to planned seminars page

Abstract for Seminar

The enforcement of authorization policies using cryptography has received considerable attention in recent years. Such enforcement schemes vary in the amount of storage and the number of key derivation steps that are required in the worst case. These parameters correspond, respectively, to the number of edges and the diameter of the graph that is used to represent the authorization policy. In this talk we will consider a particular class of access control policies and the associated graphs. We then present a number of techniques for constructing a new graph that has a smaller diameter than the original graph but enforces the same authorization policy.

(The talk is self-contained and does not contain any heavy crypto or security. The main focus of the talk is on cute ways of reducing the diameter of the authorization graph.)

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 22/09/2011