Protecting data privacy through hard-to-reverse negative databases

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

Research output: Contribution to journalArticle

29 Citations (Scopus)

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 NDB s 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.

Original languageEnglish (US)
Pages (from-to)403-415
Number of pages13
JournalInternational Journal of Information Security
Volume6
Issue number6
DOIs
StatePublished - Oct 1 2007
Externally publishedYes

Fingerprint

Data privacy

Keywords

  • Booleansatisfiability
  • k-SAT
  • Negative database
  • Privacy
  • Security

ASJC Scopus subject areas

  • Software
  • Information Systems
  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications

Cite this

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

In: International Journal of Information Security, Vol. 6, No. 6, 01.10.2007, p. 403-415.

Research output: Contribution to journalArticle

Esponda, Fernando ; Ackley, Elena S. ; Helman, Paul ; Jia, Haixia ; Forrest, Stephanie. / Protecting data privacy through hard-to-reverse negative databases. In: International Journal of Information Security. 2007 ; Vol. 6, No. 6. pp. 403-415.
@article{f5d3a39d288047398e70df92c1536d43,
title = "Protecting data privacy through hard-to-reverse negative databases",
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 NDB s 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.",
keywords = "Booleansatisfiability, k-SAT, Negative database, Privacy, Security",
author = "Fernando Esponda and Ackley, {Elena S.} and Paul Helman and Haixia Jia and Stephanie Forrest",
year = "2007",
month = "10",
day = "1",
doi = "10.1007/s10207-007-0030-1",
language = "English (US)",
volume = "6",
pages = "403--415",
journal = "International Journal of Information Security",
issn = "1615-5262",
publisher = "Springer Verlag",
number = "6",

}

TY - JOUR

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 - 2007/10/1

Y1 - 2007/10/1

N2 - 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 NDB s 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.

AB - 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 NDB s 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.

KW - Booleansatisfiability

KW - k-SAT

KW - Negative database

KW - Privacy

KW - Security

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

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

U2 - 10.1007/s10207-007-0030-1

DO - 10.1007/s10207-007-0030-1

M3 - Article

AN - SCOPUS:35348817340

VL - 6

SP - 403

EP - 415

JO - International Journal of Information Security

JF - International Journal of Information Security

SN - 1615-5262

IS - 6

ER -