{'fraction_non_alphanumeric': 0.012686567164179104, 'fraction_numerical': 0.0, 'mean_word_length': 5.541463414634146, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Privacy Vulnerabilities with Background Information in Data Perturbation

The issue of data privacy is considered a significant hindrance to the development and industrial applications of database publishing and data mining techniques. Among many privacy-preserving methodologies, data perturbation is a popular technique for achieving a balance between data utility and information privacy. It is known that the attacker’s background information about the original data can play a significant role in breaching data privacy. In this paper, we analyze data perturbation’s potential privacy vulnerability in the presence of known background information in privacypreserving database publishing and data mining based on the eigenspace of the perturbed data under some constraints. We study the situation in which data privacy may be compromised with the leakage of a few original data records. We first show that additive perturbation preserves the angle between data records during the perturbation. Based on this angle-preservation property, we show that, in a general perturbation model, even the leakage of only one single original data probably degrades the privacy of perturbed data in some cases. We theoretically and experimentally show that a general data perturbation model is vulnerable from this type of background privacy breach.