Loukides, Grigorios ![]() ![]() |
Abstract
K-anonymisation, as an approach to protecting data privacy, has received much recent attention from the database research community. Given a single table, there can be many ways to anonymise it. So criteria for determining a preferred solution is important. Various techniques have been proposed, all attempting to achieve some form of optimality in k-anonymisation, but few have considered the balance between the usefulness of the anonymised data and the protection of the original. In this paper, we address this issue and propose a two-step approach which allows data usefulness and privacy protection requirements to be considered and balanced in k-anonymisation.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Date Type: | Publication |
Status: | Published |
Schools: | Computer Science & Informatics |
Subjects: | Q Science > QA Mathematics > QA75 Electronic computers. Computer science |
Publisher: | IEEE |
ISBN: | 9780769526874 |
Last Modified: | 24 Oct 2022 11:07 |
URI: | https://orca.cardiff.ac.uk/id/eprint/47014 |
Citation Data
Cited 2 times in Scopus. View in Scopus. Powered By Scopus® Data
Actions (repository staff only)
![]() |
Edit Item |