Entry Pang:2008:VCR 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{Pang:2008:VCR,
  author =       "Hweehwa Pang and Kian-Lee Tan",
  title =        "Verifying Completeness of Relational Query Answers
                 from Online Servers",
  journal =      j-TISSEC,
  volume =       "11",
  number =       "2",
  pages =        "5:1--5:??",
  month =        mar,
  year =         "2008",
  CODEN =        "ATISBQ",
  DOI =          "https://doi.org/10.1145/1330332.1330337",
  ISSN =         "1094-9224 (print), 1557-7406 (electronic)",
  ISSN-L =       "1094-9224",
  bibdate =      "Thu Jun 12 17:52:41 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.math.utah.edu/pub/tex/bib/tissec.bib",
  abstract =     "The number of successful attacks on the Internet shows
                 that it is very difficult to guarantee the security of
                 online servers over extended periods of time. A
                 breached server that is not detected in time may return
                 incorrect query answers to users. In this article, we
                 introduce authentication schemes for users to verify
                 that their query answers from an online server are
                 complete (i. e. , no qualifying tuples are omitted) and
                 authentic (i. e. , all the result values are
                 legitimate). We introduce a scheme that supports range
                 selection, projection as well as primary key-foreign
                 key join queries on relational databases. We also
                 present authentication schemes for single- and
                 multi-attribute range aggregate queries. The schemes
                 complement access control mechanisms that rewrite
                 queries dynamically, and are computationally secure. We
                 have implemented the proposed schemes, and experiment
                 results showed that they are practical and feasible
                 schemes with low overheads.",
  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 =     "query answer verification; secure database systems",
}

Related entries