Compromising statistical databases responding to queries about means
- 1 March 1983
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 8 (1) , 60-80
- https://doi.org/10.1145/319830.319834
Abstract
This paper describes how to compromise a statistical database which only answers queries about arithmetic means for query sets whose cardinality falls in the range [ k, N - k ], for some k > 0, where N ≥ 2 k is the number of records in the database. The compromise is shown to be easy and to require only a little preknowledge; knowing the cardinality of just one nonempty query set is usually sufficient. This means that not only count and sum queries, but also queries for arithmetic means can be extremely dangerous for the security of a statistical database, and that this threat must be taken into account explicitly by protective measures. This seems quite important from a practical standpoint: while arithmetic means were known for some time to be not altogether harmless, the (perhaps surprising) extent of the threat is now shown.Keywords
This publication has 7 references indexed in Scilit:
- Security of statistical databasesACM Transactions on Database Systems, 1980
- A fast procedure for finding a tracker in a statistical databaseACM Transactions on Database Systems, 1980
- Linear queries in statistical databasesACM Transactions on Database Systems, 1979
- Secure databasesACM Transactions on Database Systems, 1979
- The trackerACM Transactions on Database Systems, 1979
- Database SecurityIEEE Transactions on Software Engineering, 1978
- Security in statistical databases for queries with small countsACM Transactions on Database Systems, 1978