Protecting data privacy through hard-to-reverse negative databases

Fernando Esponda, Elena S. Ackley, Paul Helman, Haixia Jia, Stephanie Forrest

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

The paper extends the idea of negative representations of information for enhancing privacy. Simply put, a set D B of data elements can be represented in terms of its complement set. That is. all the elements not in D B are depicted and D B itself is not explicitly stored. We review the negative database (NDB) representation scheme for storing a negative image compactly and propose a design for depicting a multiple record DB using a collection of NDBs - in contrast to the single N D B approach of previous work. Finally, we present a method for creating negative databases that are hard to reverse in practice, i.e., from which it is hard to obtain DB, by adapting a technique for generating 3-SAT formulas.

Original languageEnglish (US)
Title of host publicationInformation Security - 9th International Conference, ISC 2006, Proceedings
PublisherSpringer Verlag
Pages72-84
Number of pages13
ISBN (Print)3540383417, 9783540383413
StatePublished - Jan 1 2006
Externally publishedYes
Event9th International Information Security Conference, ISC 2006 - Samos Island, Greece
Duration: Aug 30 2006Sep 2 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4176 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Information Security Conference, ISC 2006
CountryGreece
CitySamos Island
Period8/30/069/2/06

Fingerprint

Data privacy
Privacy
Reverse
Complement

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Esponda, F., Ackley, E. S., Helman, P., Jia, H., & Forrest, S. (2006). Protecting data privacy through hard-to-reverse negative databases. In Information Security - 9th International Conference, ISC 2006, Proceedings (pp. 72-84). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4176 LNCS). Springer Verlag.

Protecting data privacy through hard-to-reverse negative databases. / Esponda, Fernando; Ackley, Elena S.; Helman, Paul; Jia, Haixia; Forrest, Stephanie.

Information Security - 9th International Conference, ISC 2006, Proceedings. Springer Verlag, 2006. p. 72-84 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4176 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Esponda, F, Ackley, ES, Helman, P, Jia, H & Forrest, S 2006, Protecting data privacy through hard-to-reverse negative databases. in Information Security - 9th International Conference, ISC 2006, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4176 LNCS, Springer Verlag, pp. 72-84, 9th International Information Security Conference, ISC 2006, Samos Island, Greece, 8/30/06.
Esponda F, Ackley ES, Helman P, Jia H, Forrest S. Protecting data privacy through hard-to-reverse negative databases. In Information Security - 9th International Conference, ISC 2006, Proceedings. Springer Verlag. 2006. p. 72-84. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Esponda, Fernando ; Ackley, Elena S. ; Helman, Paul ; Jia, Haixia ; Forrest, Stephanie. / Protecting data privacy through hard-to-reverse negative databases. Information Security - 9th International Conference, ISC 2006, Proceedings. Springer Verlag, 2006. pp. 72-84 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0e1bac429a014af99b832cce88acb010,
title = "Protecting data privacy through hard-to-reverse negative databases",
abstract = "The paper extends the idea of negative representations of information for enhancing privacy. Simply put, a set D B of data elements can be represented in terms of its complement set. That is. all the elements not in D B are depicted and D B itself is not explicitly stored. We review the negative database (NDB) representation scheme for storing a negative image compactly and propose a design for depicting a multiple record DB using a collection of NDBs - in contrast to the single N D B approach of previous work. Finally, we present a method for creating negative databases that are hard to reverse in practice, i.e., from which it is hard to obtain DB, by adapting a technique for generating 3-SAT formulas.",
author = "Fernando Esponda and Ackley, {Elena S.} and Paul Helman and Haixia Jia and Stephanie Forrest",
year = "2006",
month = "1",
day = "1",
language = "English (US)",
isbn = "3540383417",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "72--84",
booktitle = "Information Security - 9th International Conference, ISC 2006, Proceedings",

}

TY - GEN

T1 - Protecting data privacy through hard-to-reverse negative databases

AU - Esponda, Fernando

AU - Ackley, Elena S.

AU - Helman, Paul

AU - Jia, Haixia

AU - Forrest, Stephanie

PY - 2006/1/1

Y1 - 2006/1/1

N2 - The paper extends the idea of negative representations of information for enhancing privacy. Simply put, a set D B of data elements can be represented in terms of its complement set. That is. all the elements not in D B are depicted and D B itself is not explicitly stored. We review the negative database (NDB) representation scheme for storing a negative image compactly and propose a design for depicting a multiple record DB using a collection of NDBs - in contrast to the single N D B approach of previous work. Finally, we present a method for creating negative databases that are hard to reverse in practice, i.e., from which it is hard to obtain DB, by adapting a technique for generating 3-SAT formulas.

AB - The paper extends the idea of negative representations of information for enhancing privacy. Simply put, a set D B of data elements can be represented in terms of its complement set. That is. all the elements not in D B are depicted and D B itself is not explicitly stored. We review the negative database (NDB) representation scheme for storing a negative image compactly and propose a design for depicting a multiple record DB using a collection of NDBs - in contrast to the single N D B approach of previous work. Finally, we present a method for creating negative databases that are hard to reverse in practice, i.e., from which it is hard to obtain DB, by adapting a technique for generating 3-SAT formulas.

UR - http://www.scopus.com/inward/record.url?scp=33750273651&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33750273651&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:33750273651

SN - 3540383417

SN - 9783540383413

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 72

EP - 84

BT - Information Security - 9th International Conference, ISC 2006, Proceedings

PB - Springer Verlag

ER -