Brankovic, L.; Miller, M. and Siran, J.
|DOI (Digital Object Identifier) Link:||http://doi.org/10.1080/00207160214651|
|Google Scholar:||Look up in Google Scholar|
A statistical database is said to be secure if no sensitive statistics are disclosed. An important problem in security of statistical databases is to maximize the number of disclosed statistics, while ensuring that the database is secure. In this paper we present a new result for the case of range queries in 1-dimensional statistical databases and k -compromise, where k is odd.
|Item Type:||Journal Article|
|Keywords:||Statistical database security; Combinatorics; Database compromise; Privacy; Range queries|
|Academic Unit/Department:||Mathematics, Computing and Technology > Mathematics and Statistics
Mathematics, Computing and Technology
|Depositing User:||Jozef Širáň|
|Date Deposited:||14 Jun 2007|
|Last Modified:||14 Jan 2016 16:32|
|Share this page:|