Role-Based Access Control Models
Computer
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
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
Flexible support for multiple access control policies
ACM Transactions on Database Systems (TODS)
An Extended Authorization Model for Relational Databases
IEEE Transactions on Knowledge and Data Engineering
Protecting Respondents' Identities in Microdata Release
IEEE Transactions on Knowledge and Data Engineering
Auditing Interval-Based Inference
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
Privacy preserving mining of association rules
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
\ell -Diversity: Privacy Beyond \kappa -Anonymity
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Personalized privacy preservation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
| Hi-index | 0.00 |
Considered in this paper are numeric databases, whose instances are vectors in Rn, queries involve their linear transformations, and imprecise query answers are intervals. Introduced for the first time is a security requirement function ρ for a query, to specify the maximum probability ρ(l) that the precise query answer is within any interval of size l. Developed are random disclosure algorithms that satisfy security requirement functions, and guarantee, under certain conditions, maximum data availability.