MultiRelational k-Anonymity

k-Anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. Much research has been done to modify a single table dataset to satisfy anonymity constraints. This paper extends the definitions of k-anonymity to multiple relations and shows that previously proposed methodologies either fail to protect privacy, or overly reduce the utility of the data, in a multiple relation setting. A new clustering algorithm is proposed to achieve multirelational anonymity.

• Type: Conference
• Year: 2007
• Where: ICDE
• Authors: Mehmet Ercan Nergiz, Chris Clifton, A. Erhan Nergiz
• Keywords: Anonymity Constraints, Database, ICDE 2007, K-Anonymity Protects Privacy, Single Table Dataset