I am studying XACML 3.0 access control and I found this complex question about Evaluate XACML 3.0 combining algorithms. I can solve a simple exercise but this one hard for me and I need some help with it
policy p1: - op: permit-overrides
rule: permit if match all: group = staff, resource = file1
rule: permit if match all: group = student, resource = file2
rule: deny if match: any
policy p2:
op: deny-overrides
rule: deny if match all: time [MBP] = night
rule: permit if match all: time [MBP] = day
policy p3:
op: deny-overrides
policy: p1
policy: p2
Evaluate for each policy the following requests q1, q2 and q3:
q1 = {(group, staff), (resource, file1), (time, day)}
q2 = {(group, student), (resource, file2), (time, night)}
q3 = {(group, staff), (resource, file1)}