An Algebra for Enterprise Privacy Policies Closed Under Composition and Conjunction

To cope with the complex requirements imposed on the processing of privacy-sensitive data within enterprises, the use of automatic or semi-automatic tools is gradually becoming inevitable. A fundamental prerequisite for applying such automated tools is an adequate fine-grained formalization of privacy policies along with appropriate operators to manipulate such policies. So far the most promising results for the formalization of privacy policies have been achieved with the language EPAL resp. its academic counterpart E-P3P. As shown by Backes et al at ESORICS 2004, in the existing form E-P3P has fundamental limitations in the expressability of composed policies as desired in projects involving multiple departments or enterprises. We describe a Novel Algebraic Privacy Specification (NAPS) which addresses these problems by offering conjunction, composition and scoping operators, which are defined analogously to those known from E-P3P, but exhibit desirable algebraic properties. Most not...

• Type: Conference
• Year: 2006
• Where: ETRICS
• Authors: Dominik Raub, Rainer Steinwandt
• Keywords: Academic Counterpart E-p3p, Adequate Fine-grained Formalization, ETRICS 2006, Privacy Policies, Security Privacy