Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A logic for reasoning about security
ACM Transactions on Computer Systems (TOCS)
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Deontic logic in computer science: normative system specification
Deontic logic in computer science: normative system specification
Reasoning about knowledge
Fuzzy Sets and Systems - Special issue: fuzzy sets: where do we stand? Where do we go?
Fundamentals of partial modal logic
Partiality, modality, and nonmonotonicity
Security of random data perturbation methods
ACM Transactions on Database Systems (TODS)
On the design and quantification of privacy preserving data mining algorithms
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An access control model for data archives
Sec '01 Proceedings of the 16th international conference on Information security: Trusted information: the new decade challenge
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Cryptography and data security
Cryptography and data security
Uncertainty-Based Information: Elements of Generalized Information Theory
Uncertainty-Based Information: Elements of Generalized Information Theory
A general framework for time granularity and its application to temporal reasoning
Annals of Mathematics and Artificial Intelligence
Using unknowns to prevent discovery of association rules
ACM SIGMOD Record
Foundations of Secure Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Secure Databases: Constraints, Inference Channels, and Monitoring Disclosures
IEEE Transactions on Knowledge and Data Engineering
Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
On modal and fuzzy decision logics based on rough set theory
Fundamenta Informaticae
Advances in Inference Control in Statistical Databases: An Overview
Inference Control in Statistical Databases, From Theory to Practice
A Modal Logical Framework for Security Policies
ISMIS '97 Proceedings of the 10th International Symposium on Foundations of Intelligent Systems
How Much Privacy? - A System to Safe Guard Personal Privacy while Releasing Databases
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Privacy Preserving Data Mining: Challenges and Opportunities
PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Confidentiality Policies and Their Enforcement for Controlled Query Evaluation
ESORICS '02 Proceedings of the 7th European Symposium on Research in Computer Security
A Logical Model for Privacy Protection
ISC '01 Proceedings of the 4th International Conference on Information Security
Quantifying Privacy Leakage through Answering Database Queries
ISC '02 Proceedings of the 5th International Conference on Information Security
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Achieving k-anonymity privacy protection using generalization and suppression
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Transforming data to satisfy privacy constraints
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
The epistemic representation of information flow security in probabilistic systems
CSFW '95 Proceedings of the 8th IEEE workshop on Computer Security Foundations
Analyzing consistency of security policies
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Balancing confidentiality and efficiency in untrusted relational DBMSs
Proceedings of the 10th ACM conference on Computer and communications security
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
A logical approach to multilevel security of probabilistic systems
Distributed Computing
Incognito: efficient full-domain K-anonymity
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Ordinal, Continuous and Heterogeneous k-Anonymity Through Microaggregation
Data Mining and Knowledge Discovery
Medical privacy protection based on granular computing
Artificial Intelligence in Medicine
Rethinking rank swapping to decrease disclosure risk
Data & Knowledge Engineering
Granulation as a privacy protection mechanism
Transactions on rough sets VII
A probabilistic hybrid logic for sanitized information systems
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
| Hi-index | 0.02 |
In this paper, we present an epistemic framework for privacy protection in the database linking context, whereby the user's knowledge and the individuals' confidential information are represented by propositional sentences. In the framework, the concept of safety is rigorously defined, and an effective approach for testing the safety of released data is provided. It is shown that some generalization operations can be applied to original data to make it less specific so that the release of generalized data does not violate privacy. Two kinds of generalization operation are considered: attribute-oriented generalization (AOG) and cell-oriented generalization (COG). AOG is more restrictive, but a bottom-up search algorithm can be used to find the maximally informative AOG that satisfies the safety requirement. We investigate the properties of AOG that can be used to improve the search efficiency. COG, on the other hand, is more flexible. However, it necessitates searching through the whole space, so its computational complexity is much higher. Although graph theory can be used to simplify the search procedure, heuristic methods are needed to improve its efficiency. Easy extensibility is one of the main advantages of our framework. It is shown that the framework can be extended to accommodate probabilistic inference attacks and alternative protection techniques.