2006
DOI: 10.1007/11836810_6
|View full text |Cite
|
Sign up to set email alerts
|

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 (N DB) representation scheme for storing a negative image compactly, and it proposes using a collection of N DBs to represent a single DB, that is, one N DB is ass… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
4
2

Relationship

1
5

Authors

Journals

citations
Cited by 14 publications
(1 citation statement)
references
References 33 publications
(32 reference statements)
0
1
0
Order By: Relevance
“…A second advantage of negative representations is the ability to conceal information about the system it is protecting (104, 107). Thus, in some negative representations, it is provably difficult to infer the original (positive) set from the negative information alone.…”
Section: Negative and Positive Selectionmentioning
confidence: 99%
“…A second advantage of negative representations is the ability to conceal information about the system it is protecting (104, 107). Thus, in some negative representations, it is provably difficult to infer the original (positive) set from the negative information alone.…”
Section: Negative and Positive Selectionmentioning
confidence: 99%