**Structural complexity of conflict of interest policies.** / Crampton, J.; Loizou, G.

Research output: Working paper

Published

**Structural complexity of conflict of interest policies.** / Crampton, J.; Loizou, G.

Research output: Working paper

Crampton, J & Loizou, G 2000 'Structural complexity of conflict of interest policies'.

Crampton, J., & Loizou, G. (2000). *Structural complexity of conflict of interest policies*.

Crampton J, Loizou G. Structural complexity of conflict of interest policies. 2000.

@techreport{bdae4dc8e0f74af6b63f61b4c3ded4f6,

title = "Structural complexity of conflict of interest policies",

abstract = "We define a conflict of interest policy and show that the definition is sufficiently general to include several well-known generic policies as special cases and to articulate policies in different models of access control. We show that conflict of interest policies can be regarded as members of $2^2^X$, for some set $X$, where $2^X$ denotes the powerset of $X$. We demonstrate that conflict of interest policies can be reduced to a canonical form and that the set of canonical conflict of interest policies is a subset of $2^2^X$. In particular, the set of canonical conflict of interest policies is the set of Sperner families in $2^X$. We define a partial ordering on the set of Sperner families and show that this corresponds to an intuitive notion of strength of conflict of interest policies. Furthermore, we show that this ordering leads to a formal definition for composition of policies. We give some examples of conflict of interest policies in the context of two access control models and compare our framework with existing work in the role-based access control community on separation of duty policies. We derive upper and lower bounds for the number of Sperner families improving on results obtained by Hansel. In particular, our introduction of the novel concept of a bi-symmetric chain partition enables us to improve the upper bound significantly. We also derive an expression for the maximum length of a string that is required to describe a conflict of interest policy.",

author = "J. Crampton and G. Loizou",

year = "2000",

language = "English",

type = "WorkingPaper",

}

TY - UNPB

T1 - Structural complexity of conflict of interest policies

AU - Crampton, J.

AU - Loizou, G.

PY - 2000

Y1 - 2000

N2 - We define a conflict of interest policy and show that the definition is sufficiently general to include several well-known generic policies as special cases and to articulate policies in different models of access control. We show that conflict of interest policies can be regarded as members of $2^2^X$, for some set $X$, where $2^X$ denotes the powerset of $X$. We demonstrate that conflict of interest policies can be reduced to a canonical form and that the set of canonical conflict of interest policies is a subset of $2^2^X$. In particular, the set of canonical conflict of interest policies is the set of Sperner families in $2^X$. We define a partial ordering on the set of Sperner families and show that this corresponds to an intuitive notion of strength of conflict of interest policies. Furthermore, we show that this ordering leads to a formal definition for composition of policies. We give some examples of conflict of interest policies in the context of two access control models and compare our framework with existing work in the role-based access control community on separation of duty policies. We derive upper and lower bounds for the number of Sperner families improving on results obtained by Hansel. In particular, our introduction of the novel concept of a bi-symmetric chain partition enables us to improve the upper bound significantly. We also derive an expression for the maximum length of a string that is required to describe a conflict of interest policy.

AB - We define a conflict of interest policy and show that the definition is sufficiently general to include several well-known generic policies as special cases and to articulate policies in different models of access control. We show that conflict of interest policies can be regarded as members of $2^2^X$, for some set $X$, where $2^X$ denotes the powerset of $X$. We demonstrate that conflict of interest policies can be reduced to a canonical form and that the set of canonical conflict of interest policies is a subset of $2^2^X$. In particular, the set of canonical conflict of interest policies is the set of Sperner families in $2^X$. We define a partial ordering on the set of Sperner families and show that this corresponds to an intuitive notion of strength of conflict of interest policies. Furthermore, we show that this ordering leads to a formal definition for composition of policies. We give some examples of conflict of interest policies in the context of two access control models and compare our framework with existing work in the role-based access control community on separation of duty policies. We derive upper and lower bounds for the number of Sperner families improving on results obtained by Hansel. In particular, our introduction of the novel concept of a bi-symmetric chain partition enables us to improve the upper bound significantly. We also derive an expression for the maximum length of a string that is required to describe a conflict of interest policy.

M3 - Working paper

BT - Structural complexity of conflict of interest policies

ER -