### Abstract

This paper studies statistical database problems for two-dimensional 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.

Original language | English (US) |
---|---|

Title of host publication | Scientific and Statistical Database Management - Proceedings of the International Working Conference |

Publisher | IEEE |

Pages | 155-164 |

Number of pages | 10 |

State | Published - Jan 1 1997 |

Event | Proceedings of the 1997 9th International Conference on Scientific and Statistical Database Management - Olympia, WA, USA Duration: Aug 11 1997 → Aug 13 1997 |

### Other

Other | Proceedings of the 1997 9th International Conference on Scientific and Statistical Database Management |
---|---|

City | Olympia, WA, USA |

Period | 8/11/97 → 8/13/97 |

### ASJC Scopus subject areas

- Software
- Applied Mathematics

## Fingerprint Dive into the research topics of 'Security problems for statistical databases with general cell suppressions'. Together they form a unique fingerprint.

## Cite this

Hsu, T. S., & Kao, M. Y. (1997). Security problems for statistical databases with general cell suppressions. In

*Scientific and Statistical Database Management - Proceedings of the International Working Conference*(pp. 155-164). IEEE.