Skip to main content
placeholder image

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

Journal Article


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.

UOW Authors


  •   Kelarev, Andrei (external author)
  •   Ryan, Joe (external author)
  •   Rylands, Leanne (external author)
  •   Seberry, Jennifer
  •   Yi, Xun (external author)

Publication Date


  • 2018

Citation


  • 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.

Scopus Eid


  • 2-s2.0-85056618812

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/2159

Number Of Pages


  • 9

Start Page


  • 112

End Page


  • 121

Volume


  • 52-53

Place Of Publication


  • Netherlands

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.

UOW Authors


  •   Kelarev, Andrei (external author)
  •   Ryan, Joe (external author)
  •   Rylands, Leanne (external author)
  •   Seberry, Jennifer
  •   Yi, Xun (external author)

Publication Date


  • 2018

Citation


  • 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.

Scopus Eid


  • 2-s2.0-85056618812

Ro Metadata Url


  • http://ro.uow.edu.au/eispapers1/2159

Number Of Pages


  • 9

Start Page


  • 112

End Page


  • 121

Volume


  • 52-53

Place Of Publication


  • Netherlands