PTA: An Efficient System for Transaction Database Anonymization
Several approaches have been proposed to anonymize relational databases using the criterion of k-anonymity, to avoid the disclosure of sensitive information by re-identification attacks. A relational database is said to meet the criterion of k-anonymity if each record is identical to at least (k - 1...
Main Authors: | Jerry Chun-Wei Lin, Qiankun Liu, Philippe Fournier-Viger, Tzung-Pei Hong |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2016-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/7552454/ |
Similar Items
-
Solving the Large-Scale TSP Problem in 1 h: Santa Claus Challenge 2020
by: Radu Mariescu-Istodor, et al.
Published: (2021-10-01) -
A Metric for Anonymity based on Subjective Logic
by: Bni, Asmae
Published: (2014) -
An anonymization technique using intersected decision trees
by: Sam Fletcher, et al.
Published: (2015-07-01) -
Parking recommender system privacy preservation through anonymization and differential privacy
by: Yasir Saleem, et al.
Published: (2021-02-01) -
Utility-preserving anonymization for health data publishing
by: Hyukki Lee, et al.
Published: (2017-07-01)