ON RANGE QUERY USABILITY OF STATISTICAL DATABASES
Authors:
Ljiljana Brankovi
a;
Mirka Miller a;
Jozef
ir
b
a;
Mirka Miller a;
Jozef
ir
b
| Affiliations: | a Department of Computer Science and Software Engineering, The University of Newcastle, NSW 2308, Australia. |
b Department of Mathematics, SvF, Slovak University of Technology, Radlinsk ho 11, 813 68 Bratislava, Slovakia. |
DOI:
10.1080/00207160214651
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
79,
Issue
12
2002
, pages 1265
- 1271
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 12
Formats available:
PDF
(English)
View Article:
View Article (PDF)
Abstract
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.
|
| Keywords: Statistical Database Security; Combinatorics; Database Compromise; Privacy; Range Queries |
| view references (12) |

Download Citation

ho 11, 813 68 Bratislava, Slovakia.
CiteULike
Del.icio.us
BibSonomy
Connotea