[prev in list] [next in list] [prev in thread] [next in thread] 

List:       cap-talk
Subject:    Re: [cap-talk] Re: Paradigm Regained: Abstraction Mechanisms
From:       "Valerio Bellizzomi" <devbox () selnet ! org>
Date:       2003-08-27 10:24:39
[Download RAW message or body]

On 23/08/2003, at 20.00, David Hopwood wrote:

-snip-

>Arguably, the most important questions that we need to answer about
>security systems are more often of the form "should I do A, B, or C?",
>than "what is an upper bound on the granted authority for A?"
>

There shoud be some "mechanical" method that can be used to resolve this
kind of problem. In general we need to have some measurable weighting set
up for A B and C. The weighting (I hope I spelled it correctly) should be
done with some monotonic function (the "+" operator). If we assign a weight
of 1 to the "r" privilege and a weight of 3 to the "w" privilege, and we
know the number of elements of each set (A,B,C) then we can start doing
some inference.

val

_______________________________________________
cap-talk mailing list
cap-talk@mail.eros-os.org
http://www.eros-os.org/mailman/listinfo/cap-talk
[prev in list] [next in list] [prev in thread] [next in thread]