Entry Li:2007:MER from tissec.bib

Last update: Sun Oct 15 02:58:48 MDT 2017                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Li:2007:MER,
  author =       "Ninghui Li and Mahesh V. Tripunitara and Ziad Bizri",
  title =        "On mutually exclusive roles and separation-of-duty",
  journal =      j-TISSEC,
  volume =       "10",
  number =       "2",
  pages =        "5:1--5:??",
  month =        may,
  year =         "2007",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1237500.1237501",
  ISSN =         "1094-9224 (print), 1557-7406 (electronic)",
  ISSN-L =       "1094-9224",
  bibdate =      "Thu Jun 12 17:52:05 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/tissec.bib",
  abstract =     "Separation-of-duty (SoD) is widely considered to be a
                 fundamental principle in computer security. A static
                 SoD (SSoD) policy states that in order to have all
                 permissions necessary to complete a sensitive task, the
                 cooperation of at least a certain number of users is
                 required. Role-based access control (RBAC) is today's
                 dominant access-control model. It is widely believed
                 that one of RBAC's main strengths is that it enables
                 the use of constraints to support policies, such as
                 separation-of-duty. In the literature on RBAC,
                 statically mutually exclusive roles (SMER) constraints
                 are used to enforce SSoD policies. In this paper, we
                 formulate and study fundamental computational problems
                 related to the use of SMER constraints to enforce SSoD
                 policies. We show that directly enforcing SSoD policies
                 is intractable (coNP-complete), while checking whether
                 an RBAC state satisfies a set of SMER constraints is
                 efficient; however, verifying whether a given set of
                 SMER constraints enforces an SSoD policy is also
                 intractable (coNP-complete). We discuss the
                 implications of these results. We show also how to
                 generate SMER constraints that are as accurate as
                 possible for enforcing an SSoD policy.",
  acknowledgement = ack-nhfb,
  articleno =    "5",
  fjournal =     "ACM Transactions on Information and System Security",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J789",
  keywords =     "computational complexity; constraints; role-based
                 access control; separation-of-duty; verification",
}

Related entries