/usr/lib/python3/dist-packages/setools/dta.py is in python3-setools 4.0.1-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 | # Copyright 2014-2015, Tresys Technology, LLC
#
# This file is part of SETools.
#
# SETools is free software: you can redistribute it and/or modify
# it under the terms of the GNU Lesser General Public License as
# published by the Free Software Foundation, either version 2.1 of
# the License, or (at your option) any later version.
#
# SETools is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU Lesser General Public License for more details.
#
# You should have received a copy of the GNU Lesser General Public
# License along with SETools. If not, see
# <http://www.gnu.org/licenses/>.
#
# pylint: disable=unsubscriptable-object
import itertools
import logging
from collections import defaultdict, namedtuple
import networkx as nx
from networkx.exception import NetworkXError, NetworkXNoPath
from .descriptors import EdgeAttrDict, EdgeAttrList
__all__ = ['DomainTransitionAnalysis']
# Return values for the analysis
# are in the following tuple formats:
step_output = namedtuple("step", ["source",
"target",
"transition",
"entrypoints",
"setexec",
"dyntransition",
"setcurrent"])
entrypoint_output = namedtuple("entrypoints", ["name",
"entrypoint",
"execute",
"type_transition"])
class DomainTransitionAnalysis(object):
"""Domain transition analysis."""
def __init__(self, policy, reverse=False, exclude=None):
"""
Parameter:
policy The policy to analyze.
"""
self.log = logging.getLogger(__name__)
self.policy = policy
self.exclude = exclude
self.reverse = reverse
self.rebuildgraph = True
self.rebuildsubgraph = True
self.G = nx.DiGraph()
self.subG = None
@property
def reverse(self):
return self._reverse
@reverse.setter
def reverse(self, direction):
self._reverse = bool(direction)
self.rebuildsubgraph = True
@property
def exclude(self):
return self._exclude
@exclude.setter
def exclude(self, types):
if types:
self._exclude = [self.policy.lookup_type(t) for t in types]
else:
self._exclude = []
self.rebuildsubgraph = True
def shortest_path(self, source, target):
"""
Generator which yields one shortest domain transition path
between the source and target types (there may be more).
Parameters:
source The source type.
target The target type.
Yield: generator(steps)
steps A generator that returns the tuple of
source, target, and rules for each
domain transition.
"""
s = self.policy.lookup_type(source)
t = self.policy.lookup_type(target)
if self.rebuildsubgraph:
self._build_subgraph()
self.log.info("Generating one domain transition path from {0} to {1}...".format(s, t))
try:
yield self.__generate_steps(nx.shortest_path(self.subG, s, t))
except (NetworkXNoPath, NetworkXError):
# NetworkXError: the type is valid but not in graph, e.g. excluded
# NetworkXNoPath: no paths or the target type is
# not in the graph
pass
def all_paths(self, source, target, maxlen=2):
"""
Generator which yields all domain transition paths between
the source and target up to the specified maximum path
length.
Parameters:
source The source type.
target The target type.
maxlen Maximum length of paths.
Yield: generator(steps)
steps A generator that returns the tuple of
source, target, and rules for each
domain transition.
"""
if maxlen < 1:
raise ValueError("Maximum path length must be positive.")
s = self.policy.lookup_type(source)
t = self.policy.lookup_type(target)
if self.rebuildsubgraph:
self._build_subgraph()
self.log.info("Generating all domain transition paths from {0} to {1}, max length {2}...".
format(s, t, maxlen))
try:
for path in nx.all_simple_paths(self.subG, s, t, maxlen):
yield self.__generate_steps(path)
except (NetworkXNoPath, NetworkXError):
# NetworkXError: the type is valid but not in graph, e.g. excluded
# NetworkXNoPath: no paths or the target type is
# not in the graph
pass
def all_shortest_paths(self, source, target):
"""
Generator which yields all shortest domain transition paths
between the source and target types.
Parameters:
source The source type.
target The target type.
Yield: generator(steps)
steps A generator that returns the tuple of
source, target, and rules for each
domain transition.
"""
s = self.policy.lookup_type(source)
t = self.policy.lookup_type(target)
if self.rebuildsubgraph:
self._build_subgraph()
self.log.info("Generating all shortest domain transition paths from {0} to {1}...".
format(s, t))
try:
for path in nx.all_shortest_paths(self.subG, s, t):
yield self.__generate_steps(path)
except (NetworkXNoPath, NetworkXError, KeyError):
# NetworkXError: the type is valid but not in graph, e.g. excluded
# NetworkXNoPath: no paths or the target type is
# not in the graph
# KeyError: work around NetworkX bug
# when the source node is not in the graph
pass
def transitions(self, type_):
"""
Generator which yields all domain transitions out of a
specified source type.
Parameters:
type_ The starting type.
Yield: generator(steps)
steps A generator that returns the tuple of
source, target, and rules for each
domain transition.
"""
s = self.policy.lookup_type(type_)
if self.rebuildsubgraph:
self._build_subgraph()
self.log.info("Generating all domain transitions {1} {0}".
format(s, "in to" if self.reverse else "out from"))
try:
for source, target in self.subG.out_edges_iter(s):
edge = Edge(self.subG, source, target)
if self.reverse:
real_source, real_target = target, source
else:
real_source, real_target = source, target
yield step_output(real_source, real_target,
edge.transition,
self.__generate_entrypoints(edge),
edge.setexec,
edge.dyntransition,
edge.setcurrent)
except NetworkXError:
# NetworkXError: the type is valid but not in graph, e.g. excluded
pass
def get_stats(self): # pragma: no cover
"""
Get the domain transition graph statistics.
Return: str
"""
if self.rebuildgraph:
self._build_graph()
return nx.info(self.G)
#
# Internal functions follow
#
@staticmethod
def __generate_entrypoints(edge):
"""
Creates a list of entrypoint, execute, and
type_transition rules for each entrypoint.
Parameter:
data The dictionary of entrypoints.
Return: list of tuple(type, entry, exec, trans)
type The entrypoint type.
entry The list of entrypoint rules.
exec The list of execute rules.
trans The list of type_transition rules.
"""
return [entrypoint_output(e, edge.entrypoint[e], edge.execute[e], edge.type_transition[e])
for e in edge.entrypoint]
def __generate_steps(self, path):
"""
Generator which yields the source, target, and associated rules
for each domain transition.
Parameter:
path A list of graph node names representing an information flow path.
Yield: tuple(source, target, transition, entrypoints,
setexec, dyntransition, setcurrent)
source The source type for this step of the domain transition.
target The target type for this step of the domain transition.
transition The list of transition rules.
entrypoints Generator which yields entrypoint-related rules.
setexec The list of setexec rules.
dyntranstion The list of dynamic transition rules.
setcurrent The list of setcurrent rules.
"""
for s in range(1, len(path)):
source = path[s - 1]
target = path[s]
edge = Edge(self.subG, source, target)
# Yield the actual source and target.
# The above perspective is reversed
# if the graph has been reversed.
if self.reverse:
real_source, real_target = target, source
else:
real_source, real_target = source, target
yield step_output(real_source, real_target,
edge.transition,
self.__generate_entrypoints(edge),
edge.setexec,
edge.dyntransition,
edge.setcurrent)
#
# Graph building functions
#
# Domain transition requirements:
#
# Standard transitions a->b:
# allow a b:process transition;
# allow a b_exec:file execute;
# allow b b_exec:file entrypoint;
#
# and at least one of:
# allow a self:process setexec;
# type_transition a b_exec:process b;
#
# Dynamic transition x->y:
# allow x y:process dyntransition;
# allow x self:process setcurrent;
#
# Algorithm summary:
# 1. iterate over all rules
# 1. skip non allow/type_transition rules
# 2. if process transition or dyntransition, create edge,
# initialize rule lists, add the (dyn)transition rule
# 3. if process setexec or setcurrent, add to appropriate dict
# keyed on the subject
# 4. if file exec, entrypoint, or type_transition:process,
# add to appropriate dict keyed on subject,object.
# 2. Iterate over all graph edges:
# 1. if there is a transition rule (else add to invalid
# transition list):
# 1. use set intersection to find matching exec
# and entrypoint rules. If none, add to invalid
# transition list.
# 2. for each valid entrypoint, add rules to the
# edge's lists if there is either a
# type_transition for it or the source process
# has setexec permissions.
# 3. If there are neither type_transitions nor
# setexec permissions, add to the invalid
# transition list
# 2. if there is a dyntransition rule (else add to invalid
# dyntrans list):
# 1. If the source has a setcurrent rule, add it
# to the edge's list, else add to invalid
# dyntransition list.
# 3. Iterate over all graph edges:
# 1. if the edge has an invalid trans and dyntrans, delete
# the edge.
# 2. if the edge has an invalid trans, clear the related
# lists on the edge.
# 3. if the edge has an invalid dyntrans, clear the related
# lists on the edge.
#
def _build_graph(self):
self.G.clear()
self.G.name = "Domain transition graph for {0}.".format(self.policy)
self.log.info("Building domain transition graph from {0}...".format(self.policy))
# hash tables keyed on domain type
setexec = defaultdict(list)
setcurrent = defaultdict(list)
# hash tables keyed on (domain, entrypoint file type)
# the parameter for defaultdict has to be callable
# hence the lambda for the nested defaultdict
execute = defaultdict(lambda: defaultdict(list))
entrypoint = defaultdict(lambda: defaultdict(list))
# hash table keyed on (domain, entrypoint, target domain)
type_trans = defaultdict(lambda: defaultdict(lambda: defaultdict(list)))
for rule in self.policy.terules():
if rule.ruletype == "allow":
if rule.tclass not in ["process", "file"]:
continue
perms = rule.perms
if rule.tclass == "process":
if "transition" in perms:
for s, t in itertools.product(rule.source.expand(), rule.target.expand()):
# only add edges if they actually
# transition to a new type
if s != t:
edge = Edge(self.G, s, t, create=True)
edge.transition.append(rule)
if "dyntransition" in perms:
for s, t in itertools.product(rule.source.expand(), rule.target.expand()):
# only add edges if they actually
# transition to a new type
if s != t:
e = Edge(self.G, s, t, create=True)
e.dyntransition.append(rule)
if "setexec" in perms:
for s in rule.source.expand():
setexec[s].append(rule)
if "setcurrent" in perms:
for s in rule.source.expand():
setcurrent[s].append(rule)
else:
if "execute" in perms:
for s, t in itertools.product(
rule.source.expand(),
rule.target.expand()):
execute[s][t].append(rule)
if "entrypoint" in perms:
for s, t in itertools.product(rule.source.expand(), rule.target.expand()):
entrypoint[s][t].append(rule)
elif rule.ruletype == "type_transition":
if rule.tclass != "process":
continue
d = rule.default
for s, t in itertools.product(rule.source.expand(), rule.target.expand()):
type_trans[s][t][d].append(rule)
invalid_edge = []
clear_transition = []
clear_dyntransition = []
for s, t in self.G.edges_iter():
edge = Edge(self.G, s, t)
invalid_trans = False
invalid_dyntrans = False
if edge.transition:
# get matching domain exec w/entrypoint type
entry = set(entrypoint[t].keys())
exe = set(execute[s].keys())
match = entry.intersection(exe)
if not match:
# there are no valid entrypoints
invalid_trans = True
else:
# TODO try to improve the
# efficiency in this loop
for m in match:
if s in setexec or type_trans[s][m]:
# add key for each entrypoint
edge.entrypoint[m] += entrypoint[t][m]
edge.execute[m] += execute[s][m]
if type_trans[s][m][t]:
edge.type_transition[m] += type_trans[s][m][t]
if s in setexec:
edge.setexec.extend(setexec[s])
if not edge.setexec and not edge.type_transition:
invalid_trans = True
else:
invalid_trans = True
if edge.dyntransition:
if s in setcurrent:
edge.setcurrent.extend(setcurrent[s])
else:
invalid_dyntrans = True
else:
invalid_dyntrans = True
# cannot change the edges while iterating over them,
# so keep appropriate lists
if invalid_trans and invalid_dyntrans:
invalid_edge.append(edge)
elif invalid_trans:
clear_transition.append(edge)
elif invalid_dyntrans:
clear_dyntransition.append(edge)
# Remove invalid transitions
self.G.remove_edges_from(invalid_edge)
for edge in clear_transition:
# if only the regular transition is invalid,
# clear the relevant lists
del edge.transition
del edge.execute
del edge.entrypoint
del edge.type_transition
del edge.setexec
for edge in clear_dyntransition:
# if only the dynamic transition is invalid,
# clear the relevant lists
del edge.dyntransition
del edge.setcurrent
self.rebuildgraph = False
self.rebuildsubgraph = True
self.log.info("Completed building domain transition graph.")
self.log.debug("Graph stats: nodes: {0}, edges: {1}.".format(
nx.number_of_nodes(self.G),
nx.number_of_edges(self.G)))
def __remove_excluded_entrypoints(self):
invalid_edges = []
for source, target in self.subG.edges_iter():
edge = Edge(self.subG, source, target)
entrypoints = set(edge.entrypoint)
entrypoints.intersection_update(self.exclude)
if not entrypoints:
# short circuit if there are no
# excluded entrypoint types on
# this edge.
continue
for e in entrypoints:
# clear the entrypoint data
del edge.entrypoint[e]
del edge.execute[e]
try:
del edge.type_transition[e]
except KeyError: # setexec
pass
# cannot delete the edges while iterating over them
if not edge.entrypoint and not edge.dyntransition:
invalid_edges.append(edge)
self.subG.remove_edges_from(invalid_edges)
def _build_subgraph(self):
if self.rebuildgraph:
self._build_graph()
self.log.info("Building domain transition subgraph.")
self.log.debug("Excluding {0}".format(self.exclude))
self.log.debug("Reverse {0}".format(self.reverse))
# reverse graph for reverse DTA
if self.reverse:
self.subG = self.G.reverse(copy=True)
else:
self.subG = self.G.copy()
if self.exclude:
# delete excluded domains from subgraph
self.subG.remove_nodes_from(self.exclude)
# delete excluded entrypoints from subgraph
self.__remove_excluded_entrypoints()
self.rebuildsubgraph = False
self.log.info("Completed building domain transition subgraph.")
self.log.debug("Subgraph stats: nodes: {0}, edges: {1}.".format(
nx.number_of_nodes(self.subG),
nx.number_of_edges(self.subG)))
class Edge(object):
"""
A graph edge. Also used for returning domain transition steps.
Parameters:
graph The NetworkX graph.
source The source type of the edge.
target The target tyep of the edge.
Keyword Parameters:
create (T/F) create the edge if it does not exist.
The default is False.
"""
transition = EdgeAttrList('transition')
setexec = EdgeAttrList('setexec')
dyntransition = EdgeAttrList('dyntransition')
setcurrent = EdgeAttrList('setcurrent')
entrypoint = EdgeAttrDict('entrypoint')
execute = EdgeAttrDict('execute')
type_transition = EdgeAttrDict('type_transition')
def __init__(self, graph, source, target, create=False):
self.G = graph
self.source = source
self.target = target
if not self.G.has_edge(source, target):
if not create:
raise ValueError("Edge does not exist in graph")
else:
self.G.add_edge(source, target)
self.transition = None
self.entrypoint = None
self.execute = None
self.type_transition = None
self.setexec = None
self.dyntransition = None
self.setcurrent = None
def __getitem__(self, key):
# This is implemented so this object can be used in NetworkX
# functions that operate on (source, target) tuples
if isinstance(key, slice):
return [self._index_to_item(i) for i in range(* key.indices(2))]
else:
return self._index_to_item(key)
def _index_to_item(self, index):
"""Return source or target based on index."""
if index == 0:
return self.source
elif index == 1:
return self.target
else:
raise IndexError("Invalid index (edges only have 2 items): {0}".format(index))
|