article · IEEE Transactions on Software Engineering · 1978
Database Security
George I. Davida, D.J. Linton, C.R. Szelag, David L. Wells
Cited by 21Abstract and details only
Abstract
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.
Cite this paper
Davida, G. I., Linton, D., Szelag, C., & Wells, D. L. (1978). Database Security. IEEE Transactions on Software Engineering, SE-4(6), 531–533. https://doi.org/10.1109/tse.1978.234140
Davida, George I., et al. “Database Security.” IEEE Transactions on Software Engineering, vol. SE-4, no. 6, 1978, pp. 531–33, https://doi.org/10.1109/tse.1978.234140.
Davida, George I., D.J. Linton, C.R. Szelag, and David L. Wells. 1978. “Database Security.” IEEE Transactions on Software Engineering SE-4 (6): 531–33. https://doi.org/10.1109/tse.1978.234140.
Davida, G.I. et al. (1978) ‘Database Security’, IEEE Transactions on Software Engineering, SE-4(6), pp. 531–533. Available at: https://doi.org/10.1109/tse.1978.234140.
@article{davida1978database,
title = {{Database Security}},
author = {Davida, George I. and Linton, D.J. and Szelag, C.R. and Wells, David L.},
journal = {IEEE Transactions on Software Engineering},
volume = {SE-4},
number = {6},
pages = {531--533},
year = {1978},
doi = {10.1109/tse.1978.234140}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.