Abstract
This paper introduces an algebra for expressing security policies with particular application to cryptographic methods of storing information. The algebra is composed of operands which are cryptographic functions, dependent upon an algorithm and a key, and a set of operators. By combining expressions in meaningful ways, security policies can be represented. The advantages of this are that the categories and classifications of information can clearly be seen, the representation of security policies can be concise, and a model represented in the algebra may be translated readily into a configuration of cryptographic keys, thus simplifying the otherwise difficult task of verifying security.
Keywords:
C.R. Categories: