Hanoi, Vietnam. November 2-8, 2024.
ISSN: 2334-1033
ISBN: 978-1-956792-05-8
Copyright © 2024 International Joint Conferences on Artificial Intelligence Organization
This paper introduces and investigates k-unmatchability, a counterpart of k-anonymity for knowledge graphs.
Like k-anonimity, k-unmatchability enhances privacy by ensuring that any individual in any external source can always be matched to either none or at least k different anonymized individuals.
The tradeoff between privacy protection and information loss can be controlled with parameter k.
We analyze the data complexity of k-unmatchability under different notions of anonymization.