Private Updates to Anonymous Databases

Get BibTex-formatted data

Author

Elisa Bertino, Alberto Trombetta

Entry type

conference

Abstract

Suppose that Alice, owner of a k-anonymous database, needs to determine whether her database, when adjoined with a tuple owned by Bob, is still k-anonymous. Suppose moreover that access to the database is strictly controlled, because for example data are used for experiments that need to be maintained confidential. Clearly, allowing Alice to directly read the contents of the tuple breaks the privacy of Bob; on the other hand, the confidentiality of the database managed by Alice is violated once Bob has access to the contents of the database. Thus the problem is to check whether the database adjoined with the tuple is still k-anonymous, without letting Alice and Bob know the contents of, respectively, the tuple and the database. In this paper, we propose two protocols solving this problem.

Date

2006

URL

http://csdl2.computer.org/pers ... DOI=10.1109/ICDE.2006.117

Booktitle

22nd International Conference on Data Engineering (ICDE'06)

Key alpha

Bertino

Pages

116

Affiliation

Purdue University

Publication Date

2006-00-00

BibTex-formatted data

To refer to this entry, you may select and copy the text below and paste it into your BibTex document. Note that the text may not contain all macros that BibTex supports.

@Conference{ Bertino,
	title = "Private Updates to Anonymous Databases",
	author = "Elisa Bertino, Alberto Trombetta",
	year = "2006",
	booktitle = "22nd International Conference on Data Engineering (ICDE'06)",
	pages = "116",
	abstract = "Suppose that Alice, owner of a k-anonymous database, needs to determine whether her database, when adjoined with a tuple owned by Bob, is still k-anonymous. Suppose moreover that access to the database is strictly controlled, because for example data are used for experiments that need to be maintained confidential. Clearly, allowing Alice to directly read the contents of the tuple breaks the privacy of Bob; on the other hand, the confidentiality of the database managed by Alice is violated once Bob has access to the contents of the database. Thus the problem is to check whether the database adjoined with the tuple is still k-anonymous, without letting Alice and Bob know the contents of, respectively, the tuple and the database. In this paper, we propose two protocols solving this problem.",
	affiliation = "Purdue University",
	url = "http://csdl2.computer.org/persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/icde/2006/2570/00/2570toc.xml&DOI=10.1109/ICDE.2006.117",
}