Entry Lee:2010:CDP 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{Lee:2010:CDP,
  author =       "Adam J. Lee and Kazuhiro Minami and Marianne
                 Winslett",
  title =        "On the consistency of distributed proofs with hidden
                 subtrees",
  journal =      j-TISSEC,
  volume =       "13",
  number =       "3",
  pages =        "25:1--25:??",
  month =        jul,
  year =         "2010",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1805974.1805981",
  ISSN =         "1094-9224 (print), 1557-7406 (electronic)",
  ISSN-L =       "1094-9224",
  bibdate =      "Wed Jul 28 14:57:15 MDT 2010",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/tissec.bib",
  abstract =     "Previous work has shown that distributed authorization
                 systems that fail to sample a consistent snapshot of
                 the underlying system during policy evaluation are
                 vulnerable to a number of attacks. Unfortunately, the
                 consistency enforcement solutions presented in previous
                 work were designed for systems in which only
                 CA-certified evidence is used during the
                 decision-making process, all of which is available to
                 the decision-making node at runtime. In this article,
                 we generalize previous results and present light-weight
                 mechanisms through which consistency constraints can be
                 enforced in proof systems in which the full details of
                 a proof may be unavailable to the querier due to
                 information release policies, and the existence of
                 certificate authorities for certifying evidence is
                 unlikely; these types of distributed proof systems are
                 likely candidates for use in pervasive computing and
                 sensor network environments. We present modifications
                 to one such distributed proof system that enable three
                 types of consistency constraints to be enforced while
                 still respecting the same confidentiality and integrity
                 policies as the original proof system. We then discuss
                 how these techniques can be adapted and applied to
                 other, less restrictive, distributed proof systems.
                 Further, we detail a performance analysis that
                 illustrates the modest overheads of our consistency
                 enforcement schemes.",
  acknowledgement = ack-nhfb,
  articleno =    "25",
  fjournal =     "ACM Transactions on Information and System Security",
  journal-URL =  "http://portal.acm.org/browse_dl.cfm?idx=J789",
  keywords =     "Consistency; distributed proving; pervasive
                 computing",
}

Related entries