Abstract:This paper makes seven contributions to security aggregation research. It identifies inference aggregation and cardinality aggregation as two distinct aspects of the aggregation problem. The paper develops the concept of a semantic relationship graph to describe the relationships between data and then presents inference aggregation as the problem of finding alternative paths between vertices on the graph. An algorithm is presented for processing the semantic relationship graph to discover whether potential inf… Show more
“…Hinke [96] shows a further depth to aggregation by comparing general cardinality aggregations and inference aggregation in which predictions of inference emerge from data analysis activities. Here, not only are similar activities from antecedent processes joined in an integrated output.…”
“…Hinke [96] shows a further depth to aggregation by comparing general cardinality aggregations and inference aggregation in which predictions of inference emerge from data analysis activities. Here, not only are similar activities from antecedent processes joined in an integrated output.…”
“…Another key direction of research involves role-based access control. For a sampling of relevant literature on these topics, see [34,71,97,106,165,193,194,195,291,294,295,320,324,325,384,410,411].…”
This paper reviews applications in computer science that decision theorists have addressed for years, discusses the requirements posed by these applications that place great strain on decision theory/social science methods, and explores applications in the social and decision sciences of newer decision-theoretic methods developed with computer science applications in mind. The paper deals with the relation between computer science and decision-theoretic methods of consensus, with the relation between computer science and game theory and decisions, and with "algorithmic decision theory."
“…The exclusion of U from V , denoted V | ¬U , is the view obtained from V by appending to its selection condition the negation of the selection condition of U . 3 Obviously, V = (V | U ) ∪ (V | ¬U ).…”
Section: Concept Disclosurementioning
confidence: 99%
“…In the environment of relational databases, this implies that the release of a limited number of tuples would be permitted, but once this number exceeds a predetermined threshold, security might be breached. This problem of controlled disclosure of sensitive information is an example of what is known as the aggregation problem [5,3,6,7,2,4].…”
Abstract. It has been observed that often the release of a limited part of an information resource poses no security risks, but the relase of a sufficiently large part of that resource might pose such risks. This problem of controlled disclosure of sensitive information is an example of what is known as the aggregation problem. In this paper we argue that it should be possible to articulate specific secrets within a database that should be protected against overdisclosure, and we provide a general framework in which such controlled disclosure can be achieved. Our methods foil any attempt to attack these predefined secrets by disguising queries as queries whose definitions do not resemble secrets, but whose answers nevertheless "nibble" at secrets. Our methods also foil attempts to attack secrets by breaking queries into sequences of smaller requests that extract information less conspicuously. The accounting methods we employ to thwart such attempts are shown to be both accurate and economical.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.