Practical data-swapping: the first steps
ACM Transactions on Database Systems (TODS)
A data distortion by probability distribution
ACM Transactions on Database Systems (TODS)
Theory of linear and integer programming
Theory of linear and integer programming
Security-control methods for statistical databases: a comparative study
ACM Computing Surveys (CSUR)
Introduction to algorithms
ACM Transactions on Database Systems (TODS)
Secure databases: protection against user influence
ACM Transactions on Database Systems (TODS)
Security in statistical databases for queries with small counts
ACM Transactions on Database Systems (TODS)
A security machanism for statistical database
ACM Transactions on Database Systems (TODS)
The statistical security of a statistical database
ACM Transactions on Database Systems (TODS)
Diophantine Inferences from Statistical Aggregates on Few-Valued Attributes
Proceedings of the First International Conference on Data Engineering
Recognizing frozen variables in constraint satisfaction problems
Theoretical Computer Science
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Privacy via pseudorandom sketches
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards robustness in query auditing
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Large-scale collection and sanitization of network security data: risks and challenges
NSPW '06 Proceedings of the 2006 workshop on New security paradigms
An analytical approach to the inference of summary data of additive type
Theoretical Computer Science
Computational complexity of auditing finite attributes in statistical databases
Journal of Computer and System Sciences
A Bayesian approach for on-line max and min auditing
PAIS '08 Proceedings of the 2008 international workshop on Privacy and anonymity in information society
Simulatable Binding: Beyond Simulatable Auditing
SDM '08 Proceedings of the 5th VLDB workshop on Secure Data Management
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
An efficient online auditing approach to limit private data disclosure
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
A Bayesian model for disclosure control in statistical databases
Data & Knowledge Engineering
A Bayesian approach for on-line max auditing of dynamic statistical databases
Proceedings of the 2009 EDBT/ICDT Workshops
K-anonymization with minimal loss of information
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Social Network Analysis and Mining for Business Applications
ACM Transactions on Intelligent Systems and Technology (TIST)
Statistical analysis for comparison of the key representation database with the original database
International Journal of Business Information Systems
An algebraic approach to the complexity of generalized conjunctive queries
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
A model-theoretic approach to data anonymity and inference control
Proceedings of the second ACM conference on Data and Application Security and Privacy
Toward privacy in public databases
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
k-Concealment: An Alternative Model of k-Type Anonymity
Transactions on Data Privacy
A clustering approach for structural k-anonymity in social networks using genetic algorithm
Proceedings of the CUBE International Information Technology Conference
A bayesian approach for on-line sum/count/max/min auditing on boolean data
PSD'12 Proceedings of the 2012 international conference on Privacy in Statistical Databases
Denials leak information: Simulatable auditing
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensitive information is Boolean. Principles and techniques developed for the security of statistical databases in the case of continuous attributes do not apply here. We prove certain strong complexity results suggesting that there is no general efficient solution for the auditing problem in this case. We propose two efficient algorithms: The first is applicable when the sum queries are one-dimensional range queries (we prove that the problem is NP-hard even in the two-dimensional case). The second is an approximate algorithm that maintains security, although it may be too restrictive. Finally, we consider a "dual" variant, with continuous data but an aggregate function that is combinatorial in nature. Specifically, we provide algorithms for two natural definitions of the auditing condition when the aggregate function is MAX.