Security problems on inference control for SUM, MAX, and MIN queries
Journal of the ACM (JACM)
Security-control methods for statistical databases: a comparative study
ACM Computing Surveys (CSUR)
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Random Structures & Algorithms
Random walks and an O*(n5) volume algorithm for convex bodies
Random Structures & Algorithms
Secure databases: protection against user influence
ACM Transactions on Database Systems (TODS)
A model of statistical database their security
ACM Transactions on Database Systems (TODS)
A security machanism for statistical database
ACM Transactions on Database Systems (TODS)
Security in Databases: A Combinatorial Study
Journal of the ACM (JACM)
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Auditing Interval-Based Inference
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
Revealing information while preserving privacy
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Limiting privacy breaches in privacy preserving data mining
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Auditing for secure statistical databases
ACM '81 Proceedings of the ACM '81 conference
Journal of Computer and System Sciences - Special issue on PODS 2000
Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Privacy via pseudorandom sketches
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the efficiency of checking perfect privacy
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Injecting utility into anonymized datasets
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
Towards robustness in query auditing
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Data collection with self-enforcing privacy
Proceedings of the 13th ACM conference on Computer and communications security
L-diversity: Privacy beyond k-anonymity
ACM Transactions on Knowledge Discovery from Data (TKDD)
Sanitization models and their limitations
NSPW '06 Proceedings of the 2006 workshop on New security paradigms
Large-scale collection and sanitization of network security data: risks and challenges
NSPW '06 Proceedings of the 2006 workshop on New security paradigms
Information disclosure under realistic assumptions: privacy versus optimality
Proceedings of the 14th ACM conference on Computer and communications security
Dynamic anonymization: accurate statistical analysis with privacy preservation
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Workload-aware anonymization techniques for large-scale datasets
ACM Transactions on Database Systems (TODS)
Exclusive Strategy for Generalization Algorithms in Micro-data Disclosure
Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
Simulatable Binding: Beyond Simulatable Auditing
SDM '08 Proceedings of the 5th VLDB workshop on Secure Data Management
Output perturbation with query relaxation
Proceedings of the VLDB Endowment
Data Collection with Self-Enforcing Privacy
ACM Transactions on Information and System Security (TISSEC)
An efficient online auditing approach to limit private data disclosure
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Evaluating privacy threats in released database views by symmetric indistinguishability
Journal of Computer Security - Selected papers from the Third and Fourth Secure Data Management (SDM) workshops
Privacy preservation of aggregates in hidden databases: why and how?
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
A Bayesian model for disclosure control in statistical databases
Data & Knowledge Engineering
Proceedings of the 18th ACM conference on Information and knowledge management
Privacy-preserving genomic computation through program specialization
Proceedings of the 16th ACM conference on Computer and communications security
Publishing naive Bayesian classifiers: privacy without accuracy loss
Proceedings of the VLDB Endowment
A Bayesian approach for on-line max auditing of dynamic statistical databases
Proceedings of the 2009 EDBT/ICDT Workshops
Privacy-preserving data publishing: A survey of recent developments
ACM Computing Surveys (CSUR)
Restoring compromised privacy in micro-data disclosure
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
K-anonymization with minimal loss of information
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Answering queries based on imprecision and uncertainty trade-offs in numeric databases
SDM'07 Proceedings of the 4th VLDB conference on Secure data management
k-jump strategy for preserving privacy in micro-data disclosure
Proceedings of the 13th International Conference on Database Theory
Requirements and protocols for inference-proof interactions in information systems
ESORICS'09 Proceedings of the 14th European conference on Research in computer security
A firm foundation for private data analysis
Communications of the ACM
Journal of the ACM (JACM)
A data-centric approach to insider attack detection in database systems
RAID'10 Proceedings of the 13th international conference on Recent advances in intrusion detection
Theoretical Computer Science
Statistical analysis for comparison of the key representation database with the original database
International Journal of Business Information Systems
Privacy streamliner: a two-stage approach to improving algorithm efficiency
Proceedings of the second ACM conference on Data and Application Security and Privacy
Indistinguishability: the other aspect of privacy
SDM'06 Proceedings of the Third VLDB international conference on Secure Data Management
When random sampling preserves privacy
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
The power of the dinur-nissim algorithm: breaking privacy of statistical and graph databases
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Aggregate suppression for enterprise search engines
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Knowledge-oriented secure multiparty computation
Proceedings of the 7th Workshop on Programming Languages and Analysis for Security
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
An event-based platform for collaborative threats detection and monitoring
Information Systems
Dynamic enforcement of knowledge-based security policies using probabilistic abstract interpretation
Journal of Computer Security
Hi-index | 0.02 |
Given a data set consisting of private information about individuals, we consider the online query auditing problem: given a sequence of queries that have already been posed about the data, their corresponding answers -- where each answer is either the true answer or "denied" (in the event that revealing the answer compromises privacy) -- and given a new query, deny the answer if privacy may be breached or give the true answer otherwise. A related problem is the offline auditing problem where one is given a sequence of queries and all of their true answers and the goal is to determine if a privacy breach has already occurred.We uncover the fundamental issue that solutions to the offline auditing problem cannot be directly used to solve the online auditing problem since query denials may leak information. Consequently, we introduce a new model called simulatable auditing where query denials provably do not leak information. We demonstrate that max queries may be audited in this simulatable paradigm under the classical definition of privacy where a breach occurs if a sensitive value is fully compromised. We also introduce a probabilistic notion of (partial) compromise. Our privacy definition requires that the a-priori probability that a sensitive value lies within some small interval is not that different from the posterior probability (given the query answers). We demonstrate that sum queries can be audited in a simulatable fashion under this privacy definition.