Multirelational k-Anonymity

@article{Nergiz2007MultirelationalK,
  title={Multirelational k-Anonymity},
  author={Mehmet Ercan Nergiz and Chris Clifton and Ahmet Erhan Nergiz},
  journal={IEEE Transactions on Knowledge and Data Engineering},
  year={2007},
  volume={21},
  pages={1104-1117}
}
k-anonymity protects privacy by ensuring that data cannot be linked to a single individual. In a k-anonymous data set, any identifying information occurs in at least k tuples. Much research has been done to modify a single-table data set 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. We… CONTINUE READING
Highly Cited
This paper has 112 citations. REVIEW CITATIONS

11 Figures & Tables

Topics

Statistics

01020'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

112 Citations

Semantic Scholar estimates that this publication has 112 citations based on the available data.

See our FAQ for additional information.