Multirelational k-anonymity
dc.citation.epage | 1117 | en_US |
dc.citation.issueNumber | 8 | en_US |
dc.citation.spage | 1104 | en_US |
dc.citation.volumeNumber | 21 | en_US |
dc.contributor.author | Nergiz, M.E. | en_US |
dc.contributor.author | Clifton, C. | en_US |
dc.contributor.author | Nergiz, A.E. | en_US |
dc.date.accessioned | 2016-02-08T10:03:15Z | |
dc.date.available | 2016-02-08T10:03:15Z | |
dc.date.issued | 2009 | en_US |
dc.department | Department of Computer Technology and Information Systems | en_US |
dc.department | Department of Computer Engineering | en_US |
dc.description.abstract | 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 also propose two new clustering algorithms to achieve multirelational anonymity. Experiments show the effectiveness of the approach in terms of utility and efficiency. © 2006 IEEE. | en_US |
dc.description.provenance | Made available in DSpace on 2016-02-08T10:03:15Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2009 | en |
dc.identifier.doi | 10.1109/TKDE.2008.210 | en_US |
dc.identifier.issn | 10414347 | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/22677 | en_US |
dc.language.iso | English | en_US |
dc.relation.isversionof | http://dx.doi.org/10.1109/TKDE.2008.210 | en_US |
dc.source.title | IEEE Transactions on Knowledge and Data Engineering | en_US |
dc.subject | Integrity | en_US |
dc.subject | Privacy | en_US |
dc.subject | Protection | en_US |
dc.subject | Relational database | en_US |
dc.subject | Security | en_US |
dc.subject | Integrity | en_US |
dc.subject | Privacy | en_US |
dc.subject | Protection | en_US |
dc.subject | Relational database | en_US |
dc.subject | Security | en_US |
dc.subject | Clustering algorithms | en_US |
dc.title | Multirelational k-anonymity | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Multirelational k-anonymity-2.pdf
- Size:
- 2.45 MB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version