Protecting data privacy through hard-to-reverse negative databases

Authors:
Fernando Esponda;Elena S. Ackley;Paul Helman;Haixia Jia;Stephanie Forrest
Affiliations:
Yale University, Department of Computer Science, 06520-8285, New Haven, CT, USA;University of New Mexico, Department of Computer Science, 87131-1386, Albuquerque, NM, USA;University of New Mexico, Department of Computer Science, 87131-1386, Albuquerque, NM, USA;University of New Mexico, Department of Computer Science, 87131-1386, Albuquerque, NM, USA;University of New Mexico, Department of Computer Science, 87131-1386, Albuquerque, NM, USA
Venue:
International Journal of Information Security
Year:
2007

Citing 0
Cited 7

Hiding a Needle in a Haystack Using Negative Databases

Information Hiding
Attacks on privacy and deFinetti's theorem

Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Negative databases for biometric data

Proceedings of the 12th ACM workshop on Multimedia and security
Privacy-aware collection of aggregate spatial data

Data & Knowledge Engineering
Efficient negative databases from cryptographic hash functions

ISC'07 Proceedings of the 10th international conference on Information Security
Application and analysis of multidimensional negative surveys in participatory sensing applications

Pervasive and Mobile Computing
Classifying and clustering in negative databases

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

A set DB of data elements can be represented in terms of its complement set, known as a negative database. That is, all of the elements not in DB are represented, and DB itself is not explicitly stored. This method of representing data has certain properties that are relevant for privacy enhancing applications. The paper reviews the negative database (NDB) representation scheme for storing a negative image compactly, and proposes using a collection of NDBs to represent a single DB, that is, one NDB is assigned for each record in DB. This method has the advantage of producing negative databases that are hard to reverse in practice, i.e., from which it is hard to obtain DB. This result is obtained by adapting a technique for generating hard-to-solve 3-SAT formulas. Finally we suggest potential avenues of application.