Privacy-aware collection of aggregate spatial data
Data & Knowledge Engineering
Resilience is more than availability
Proceedings of the 2011 workshop on New security paradigms workshop
Protecting data privacy through hard-to-reverse negative databases
ISC'06 Proceedings of the 9th international conference on Information Security
Classifying and clustering in negative databases
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
In a negative representation, a set of elements (the positive representation) is depicted by its complement set. That is, the elements in the positive representation are not explicitly stored, and those in the negative representation are. The concept, feasibility, and properties of negative representations are explored in the paper; in particular, its potential to address privacy concerns. It is shown that a positive representation consisting of n l-bit strings can be represented negatively using only O(ln) strings, through the use of an additional symbol. It is also shown that membership queries for the positive representation can be processed against the negative representation in time no worse than linear in its size, while reconstructing the original positive set from its negative representation is an $${\mathcal{NP}}$$-hard problem. The paper introduces algorithms for constructing negative representations as well as operations for updating and maintaining them.