1. ECE509 Cyber Security : Concept, Theory, and Practice Access Control Matrix Spring 2014

2. Access Control Principles

3. Types of Access Control Policies Discretionary Access Control (DAC) –Decision made based on identity of requestor and access rules –Regular users can adjust the policy Mandatory Access Control (MAC) –Decision made by testing labels associated with processes and resources against system policy rules –Regular user cannot adjust the policy Role Based Access Control (RBAC) –Access decisions defined against roles rather than individual requestors

4. Multiple Access Control Policies DACMAC RBAC

5. Access Control Requirements or Differentiators Reliable Input Fine and course grain specifications Least Privilege Separation of Duty Open and closed policies Policy combination and conflict resolution Administrative policies Dual Control

6. Chapter 2: Access Control Matrix Overview Access Control Matrix Model –Boolean Expression Evaluation –History Protection State Transitions –Commands –Conditional Commands Special Rights –Principle of Attenuation of Privilege July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-6

7. Overview Protection state of system –Describes current settings, values of system relevant to protection Access control matrix –Describes protection state precisely –Matrix describing rights of subjects –State transitions change elements of matrix July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-7

8. Description Subjects S = { s 1,…,s n } Objects O = { o 1,…,o m } Rights R = { r 1,…,r k } Entries A[s i, o j ]   R A[s i, o j ] = { r x, …, r y } means subject s i has rights r x, …, r y over object o j July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-8 objects (entities) subjects s1s2…sns1s2…sn o 1 … o m s 1 … s n

9. Example 1 Processes p, q Files f, g Rights r, w, x, a, o fgpq prworrwxow qarorrwxo July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-9

10. Example 2 Procedures inc_ctr, dec_ctr, manage Variable counter Rights +, –, call counterinc_ctrdec_ctrmanage inc_ctr+ dec_ctr– managecallcallcall July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-10

11. Boolean Expression Evaluation ACM controls access to database fields –Subjects have attributes –Verbs define type of access –Rules associated with objects, verb pair Subject attempts to access object –Rule for object, verb evaluated, grants or denies access July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-11

12. Example Subject annie –Attributes role (artist), groups (creative) Verb paint –Default 0 (deny unless explicitly granted) Object picture –Rule: paint: ‘ artist ’ in subject.role and ‘ creative ’ in subject.groups and time.hour ≥ 0 and time.hour < 5 July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-12

13. ACM at 3AM and 10AM July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-13 … picture … … annie … paint At 3AM, time condition met; ACM is: … picture … … annie … At 10AM, time condition not met; ACM is:

14. History Database: namepositionagesalary Aliceteacher45$40,000 Bobaide20$20,000 Cathyprincipal37$60,000 Dilbertteacher50$50,000 Eveteacher33$50,000 Queries: 1.sum(salary, “ position = teacher ” ) = 140,000 2.sum(salary, “ age > 40 & position = teacher ” ) should not be answered (deduce Eve ’ s salary) July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-14

15. ACM of Database Queries O i = { objects referenced in query i } f(o i ) = { read }for o j  O i, if |  j = 1,…,i  O j | < 2 f(o i ) =  for o j  O i, otherwise 1. O 1 = { Alice, Dilbert, Eve } and no previous query set, so: A[asker, Alice] = f(Alice) = { read } A[asker, Dilbert] = f(Dilbert) = { read } A[asker, Eve] = f(Eve) = { read } and query can be answered July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-15

16. But Query 2 From last slide: f(o i ) = { read }for o j in O i, if |  j = 1,…,i  O j | > 1 f(o i ) =  for o j in O i, otherwise 2.O 2 = { Alice, Dilbert } but | O 2  O 1 | = 2 so A[asker, Alice] = f(Alice) =  A[asker, Dilbert] = f(Dilbert) =  and query cannot be answered July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-16

17. State Transitions Change the protection state of system |– represents transition –X i |–  X i+1 : command  moves system from state X i to X i+1 –X i |– * X i+1 : a sequence of commands moves system from state X i to X i+1 Commands often called transformation procedures July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-17

18. Primitive Operations create subject s; create object o –Creates new row, column in ACM; creates new column in ACM destroy subject s; destroy object o –Deletes row, column from ACM; deletes column from ACM enter r into A[s, o] –Adds r rights for subject s over object o delete r from A[s, o] –Removes r rights from subject s over object o July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-18

19. Create Subject Precondition: s  S Primitive command: create subject s Postconditions: –S = S  { s }, O = O  { s } –(  y  O)[a[s, y] =  ], (  x  S)[a[x, s] =  ] –(  x  S)(  y  O)[a[x, y] = a[x, y]] July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-19

20. Create Object Precondition: o  O Primitive command: create object o Postconditions: –S = S, O = O  { o } –(  x  S)[a[x, o] =  ] –(  x  S)(  y  O)[a[x, y] = a[x, y]] July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-20

21. Add Right Precondition: s  S, o  O Primitive command: enter r into a[s, o] Postconditions: –S = S, O = O –a[s, o] = a[s, o]  { r } –(  x  S)(  y  O – { o }) [a[x, y] = a[x, y]] –(  x  S – { s })(  y  O) [a[x, y] = a[x, y]] July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-21

22. Delete Right Precondition: s  S, o  O Primitive command: delete r from a[s, o] Postconditions: –S = S, O = O –a[s, o] = a[s, o] – { r } –(  x  S)(  y  O – { o }) [a[x, y] = a[x, y]] –(  x  S – { s })(  y  O) [a[x, y] = a[x, y]] July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-22

23. Destroy Subject Precondition: s  S Primitive command: destroy subject s Postconditions: –S = S – { s }, O = O – { s } –(  y  O)[a[s, y] =  ], (  x  S)[a´[x, s] =  ] –(  x  S)(  y  O) [a[x, y] = a[x, y]] July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-23

24. Destroy Object Precondition: o  O Primitive command: destroy object o Postconditions: –S = S, O = O – { o } –(  x  S)[a[x, o] =  ] –(  x  S)(  y  O) [a[x, y] = a[x, y]] July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-24

25. Creating File Process p creates file f with r and w permission command createfile(p, f) create object f; enter own into A[p, f]; enter r into A[p, f]; enter w into A[p, f]; end July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-25

26. Mono-Operational Commands Make process p the owner of file g command makeowner(p, g) enter own into A[p, g]; end Mono-operational command –Single primitive operation in this command July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-26

27. Conditional Commands Let p give q r rights over f, if p owns f command grantreadfile1(p, f, q) if own in A[p, f] then enter r into A[q, f]; end Mono-conditional command –Single condition in this command July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-27

28. Multiple Conditions Let p give q r and w rights over f, if p owns f and p has c rights over q command grantreadfile2(p, f, q) if own in A[p, f] and c in A[p, q] then enter r into A[q, f]; enter w into A[q, f]; end July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-28

29. Copy Right Allows possessor to give rights to another Often attached to a right, so only applies to that right –r is read right that cannot be copied –rc is read right that can be copied Is copy flag copied when giving r rights? –Depends on model, instantiation of model July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-29

30. Own Right Usually allows possessor to change entries in ACM column –So owner of object can add, delete rights for others –May depend on what system allows Can ’ t give rights to specific (set of) users Can ’ t pass copy flag to specific (set of) users July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-30

31. Attenuation of Privilege Principle says you can ’ t give rights you do not possess –Restricts addition of rights within a system –Usually ignored for owner Why? Owner gives herself rights, gives them to others, deletes her rights. July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-31

32. Key Points Access control matrix simplest abstraction mechanism for representing protection state Transitions alter protection state 6 primitive operations alter matrix –Transitions can be expressed as commands composed of these operations and, possibly, conditions July 1, 2004Computer Security: Art and Science © 2002-2004 Matt Bishop Slide #2-32

33. Slice and Dice File example

34. Unix Access Control Three permission octets associated with each file and directory –Owner, group, and other –Read, write, execute For each file/directory –Can specify RWX permissions for one owner, one group, and one other 9/29/2010Computer Security I34

35. Reading Sandhu, R.S.; Samarati, P., "Access control: principle and practice," Communications Magazine, IEEE, vol.32, no.9, pp.40,48, Sept. 1994 [http://ieeexplore.ieee.org/xpl/articleDetails.j sp?tp=&arnumber=312842&ranges%3D199 0_2000_p_Publication_Year%26queryText %3Daccess+control+matrix]