Linear queries in statistical databases
Authors:
Open Access
- 1 June 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Database Systems
- Vol. 4 (2) , 156-167
Abstract
A database is compromised if a user can determine the data elements associated with keys which he did not know previously. If it is possible, compromise can be achieved by posing a finite set of queries over sets of data elements and employing initial information to solve the resulting system of equations. Assuming the allowable queries are linear, that is, weighted sums of data elements, we show how compromise can be achieved and we characterize the maximal initial information permitted of a user in a secure system. When compromise is possible, the initial information and the number of queries required to achieve it is surprisingly small.Keywords
This publication has 6 references indexed in Scilit:
- Secure databasesACM Transactions on Database Systems, 1979
- The trackerACM Transactions on Database Systems, 1979
- Security in statistical databases for queries with small countsACM Transactions on Database Systems, 1978
- Even Data Bases That Lie Can Be CompromisedIEEE Transactions on Software Engineering, 1978
- A model of statistical database their securityACM Transactions on Database Systems, 1977
- Confidentiality of Statistical Records: A Threat-Monitoring Scheme for On Line DialogueMethods of Information in Medicine, 1976