Interval approach to preserving privacy in statistical databases: Related challenges and Algorithms of computational statistics

6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In many practical situations, it is important to store large amounts of data and to be able to statistically process the data. A large part of the data is confidential, so while we welcome statistical data processing, we do not want to reveal sensitive individual data. If we allow researchers to ask all kinds of statistical queries, this can lead to violation of people's privacy. A sure-proof way to avoid these privacy violations is to store ranges of values (e.g., between 40 and 50 for age) instead of the actual values. This idea solves the privacy problem, but it leads to a computational challenge: traditional statistical algorithms need exact data, but now we only know data with interval uncertainty. In this paper, we describe new algorithms designed for processing such interval data. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Longpré, L., Xiang, G., Kreinovich, V., & Freudenthal, E. (2007). Interval approach to preserving privacy in statistical databases: Related challenges and Algorithms of computational statistics. In Communications in Computer and Information Science (Vol. 1, pp. 346–361). https://doi.org/10.1007/978-3-540-73986-9_30

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