Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
IBM Systems Journal
Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Information Hiding Techniques for Steganography and Digital Watermarking
Information Hiding Techniques for Steganography and Digital Watermarking
Chaffing at the Bit: Thoughts on a Note by Ronald Rivest
IH '99 Proceedings of the Third International Workshop on Information Hiding
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Obfuscated databases and group privacy
Proceedings of the 12th ACM conference on Computer and communications security
Architecture for an Artificial Immune System
Evolutionary Computation
Negative representations of information
Negative representations of information
Protecting data privacy through hard-to-reverse negative databases
International Journal of Information Security
Secure set membership using 3SAT
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Efficient negative databases from cryptographic hash functions
ISC'07 Proceedings of the 10th international conference on Information Security
| Hi-index | 0.00 |
In this paper we present a method for hiding a list of data by mixing it with a large amount of superfluous items. The technique uses a device known as a negative database which stores the complement of a set rather that the set itself to include an arbitrary number of garbage entries efficiently. The resulting structure effectively hides the data, without encrypting it, and obfuscates the number of data items hidden; it prevents arbitrary data lookups, while supporting simple membership queries; and can be manipulated to reflect relational algebra operations on the original data.