Auditing interval-based inference

17Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we study the feasibility of auditing intervalbased inference. Sensitive information about individuals is said to be compromised if an accurate enoughin terval, called inference interval, is obtained into which the value of the sensitive information must fall. Compared witha uditing exact inference that is traditionally studied, auditing interval-based inference is more complicated. Existing auditing methods such as audit expert do not apply to this case. Our result shows that it is intractable to audit interval-based inference for bounded integer values; while for bounded real values, the auditing problem is polynomial yet involves complicated computation of mathematical programming. To further examine the practicability of auditing interval-based inference, we classify various auditing methods into three categories: exact auditing, optimistic auditing, and pessimistic auditing. We analyze the trade-offs that can be achieved by these methods among various auditing objectives: inference security, database usability, and auditing complexity.

Cite

CITATION STYLE

APA

Li, Y., Wang, L., Wang, X. S., & Jajodia, S. (2002). Auditing interval-based inference. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2348, pp. 553–568). Springer Verlag. https://doi.org/10.1007/3-540-47961-9_38

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free