Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller

Authors

Andrei Kelarev, Royal Melbourne Institute of Technology
Joe Ryan, University of Newcastle
Leanne Rylands, Universty of Western Sydney
Jennifer Seberry, University of WollongongFollow
Xun Yi, Royal Melbourne Institute of Technology

RIS ID

131872

Publication Details

Kelarev, A., Ryan, J., Rylands, L., Seberry, J. & Yi, X. (2018). Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller. Journal of Discrete Algorithms, 52-53 112-121.

Abstract

This article gives a survey of discrete and combinatorial algorithms and methods for database security related to the work of Mirka Miller. The main contributions of Mirka Miller and coauthors to the security of statistical databases include the introduction of Static Audit Expert and theorems determining time complexity of its combinatorial algorithms, a polynomial time algorithm for deciding whether the maximum possible usability can be achieved in a statistical database with a special class of answerable statistics, NP-completeness of similar problems concerning several other types of statistical databases, sharp upper bounds on the number of compromise-free queries in certain categories of statistical databases, and analogous results on applications of Static Audit Expert for the prevention of relative compromise.

Grant Number

ARC/DP160100913