2-Compromise Usability in 1-Dimensional Statistical Databases

Authors:
Ljiljana Brankovic;Jozef Siran
Affiliations:
-;-
Venue:
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Year:
2002

Citing 2
Cited 1

A combinatoral problem in database security

Discrete Applied Mathematics
An Optimization Problem in Statistical Databases

SIAM Journal on Discrete Mathematics

VICUS: a noise addition technique for categorical data

AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many believe that data mining poses the biggest privacy challenge in the next decade. In this paper we concentrate on threats to privacy arising from the possibility of combining aggregate data to deduce the confidential individual values. We determine the maximum number of sum totals that can be disclosed without leading to a 2- compromise in a 1-dimensional database for range queries.