Strong and weak policy relations

Michael J. May, Carl A. Gunter, Insup Lee, Steve Zdancewic

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Access control and privacy policy relations tend to focus on decision outcomes and are very sensitive to defined terms and state. Small changes or updates to a policy language or vocabulary may make two similar policies incomparable. To address this we develop two flexible policy relations derived from bisimulation in process calculi. Strong licensing compares the outcome of two policies strictly, similar to strong bisimulation. Weak licensing compares the outcome of policies more flexibly by ignoring irrelevant (non-confiicting) differences between out-comes, similar to weak bisimulation. We illustrate the relations usine examples from P3P.

Original languageEnglish (US)
Title of host publicationProceedings - 2009 IEEE International Symposium on Policies for Distributed Systems and Networks, POLICY 2009
Pages33-36
Number of pages4
DOIs
StatePublished - 2009
Event2009 IEEE International Symposium on Policies for Distributed Systems and Networks, POLICY 2009 - London, United Kingdom
Duration: Jul 20 2009Jul 22 2009

Publication series

NameProceedings - 2009 IEEE International Symposium on Policies for Distributed Systems and Networks, POLICY 2009

Other

Other2009 IEEE International Symposium on Policies for Distributed Systems and Networks, POLICY 2009
Country/TerritoryUnited Kingdom
CityLondon
Period7/20/097/22/09

Keywords

  • Policy analysis
  • Privacy policies

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Strong and weak policy relations'. Together they form a unique fingerprint.

Cite this