This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Database Security
November 1978 (vol. 4 no. 6)
pp. 531-533
G.I. Davida, Department of Electrical Engineering and Computer Science, University of Wisconsin
Databases may be compromised by asking a set of queries which return only statistical information and making inferences about a specific entry from the results of the set of queries. We present methods of constructing the set of queries to compromise a database where all the queries in the set return the maximum of a set of k elements, or all queries return the mean of a set of k elements. In the case of the mean query, all elements involved will be compromised. We also consider bounds on the number of queries required to compromise the database.
Index Terms:
queries, Averages, compromise, databases, security
Citation:
G.I. Davida, D.J. Linton, C.R. Szelag, D.L. Wells, "Database Security," IEEE Transactions on Software Engineering, vol. 4, no. 6, pp. 531-533, Nov. 1978, doi:10.1109/TSE.1978.234140
Usage of this product signifies your acceptance of the Terms of Use.