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.
International Journal of Computer Mathematics Vol. 79, Issue 12, p. 1265-1271