220 likes | 236 Views
The Unary Transformation Model (UTRM) detailed by Ravi Sandhu and Srinivas Ganta offers a deep dive into the realm of policy enforcement, with a focus on the Document Release Example. UTRM's simplicity in implementation is lauded, yet it faces limitations in expressing complex policies. Through the Transformation Model (TRM), the protection state is examined through access matrices and distinct subject and object types. Transformation, creation, and destroy commands form the backbone of TRM, defining the initial state and subsequent operations of the system. The intricate Document Release Example showcases the control mechanisms dictated by specific commands, such as transfer of ownership, document creation, review requests, and the approval/rejection process. While UTRM aligns with the Binary Transformation Model (BTRM) conceptually, practicality dictates that UTRM is limited in its application compared to BTRM. The exploration of expressive power presented in this study sheds light on the complexities and limitations of policy enforcement models.
E N D
On the Expressive Power of the Unary Transformation Model by Ravi Sandhu Srinivas Ganta Center for Secure Information Systems George Mason University
Outline • Introduction / Motivation • Transformation Model • Example • Expressive Power • Conclusion
NMT • Can enforce lots of diverse policies • Has simple implementation • Cannot adequately express the document release example (Sandhu & Suri, Oakland 92)
Document Release Example • A scientist prepares a document and can release it only after getting approval from a patent-officer.
Transformation Model (TRM) • Protection state in TRM is viewed in terms of the familiar access matrix • Protection state of the system is given by the tuple (OBJ, SUB, t, AM) • The specification for changing the protection state is given by an authorization scheme
ACCESS MATRIX objects f : o s u b j e c t s r w own u : s
Authorization Scheme • A set of access rights R. • Disjoint sets of subject and object types, TS and TO, respectively. • A collection of three classes of state changing commands: Transformation commands, Create commands and Destroy commands
Transformation Commands Command name (S1:s1,....Sn:sn, O:o) if predicate then sequence of primitive operations enter/delete r into [S, O] end Example: Command transfer-ownership (S1:s, S2:s, O:o) if own [S1,O] then enter own in [S2,O] deleterown from [S1,O] end
Create Commands Command create (S1:s1, O:o) create object O enter own in [S1, O] end
Destroy Commands Command destroy (S1:s1, O:o) destroy object O end if own [S1,O] then
TRM SUMMARY • A set of rights R • A set of disjoint subject and object types TS and TO respectively • A set of state-changing transformation, creation and destroy commands • The initial state
Document Release Example • A document cannot be released by a scientist without first obtaining approval from a patent-officer. • Types = { sci, po, doc} • Rights = {read, write, own, review, pat-ok, pat-reject, release}
Create Command • Command create-doc (S:sci, O:doc) create object O enter own in [S,O] enter read in [S,O] enter write in [S,O] end
Document Release Example O :doc own read write S: sci P: po
Request Review • command rqst-review (S:sci, P:po, O:doc) if own [S,O] then enter review in [P,O] delete write from [S,O] end write [S,O]
Get-Approval/Rejection • command get-approval (S:sci, P:po, O:doc) if own [S,O] then enter pat-ok in [S,O] delete review from [P,O] end review [P,O] • command get-rejection (S:sci, P:po, O:doc) if own [S,O] then enter pat-reject in [S,O] delete review from [P,O] end review [P,O]
Release / Revise Document • command release-doc (S:sci, O:doc) if pat-ok [S,O] then enter release in [S,O] delete pat-ok from [S,O] end • command revise-doc (S:sci, O:doc) if pat-reject [S,O] then enter write in [S,O] delete pat-reject from [S,O] end
Expressive Power • The document release example has commands which test for atmost two cells of the matrx. • Binary Transformation Model • TRM BTRM (Sandhu & Ganta, Oakland 94)
Expressive Power ? • UTRM TRM ? • UTRM BTRM
UTRM BTRM • requires every subject in the simulation to be of a different type. • Esorics 94
UTRM BTRM • if every subject cannot be of a different type
Conclusion • UTRM BTRM impractical simulation in general • UTRM < BTRM for all practical purposes