Security problems for statistical databases with general cell suppressions

Author

Hsu, Tsan-Sheng ; Kao, Ming-Yang

Author_Institution

Inst. of Inf. Sci., Acad. Sinica, Taipei, Taiwan

fYear

1997

fDate

11-13 Aug 1997

Firstpage

155

Lastpage

164

Abstract

Studies statistical database problems for 2D tables whose regular cells, row sums, column sums and table sums may be suppressed. Using graph-theoretical techniques, we give optimal or efficient algorithms for the query system problem, the adversary problem and the minimum complementary suppression problem. These three problems are considered for a variety of data security requirements such as those of protecting linear invariants, analytic invariants, k rows (or columns) as a whole, and a table as a whole

Keywords

database theory; graph theory; security of data; statistical databases; 2D tables; adversary problem; analytic invariants; column sums; data protection; data security requirements; efficient algorithms; general cell suppressions; graph theory; linear invariants; minimum complementary suppression problem; optimal algorithms; query system problem; regular cells; row sums; security problems; statistical databases; table sums; Computer science; Computer security; Data security; Databases; Indexes; Information science; Information security; Protection;

fLanguage

English

Publisher

ieee

Conference_Titel

Scientific and Statistical Database Management, 1997. Proceedings., Ninth International Conference on

Conference_Location

Olympia, WA

Print_ISBN

0-8186-7952-2

Type

conf

DOI

10.1109/SSDM.1997.621180

Filename

621180