Adaptive Anonymity via b-Matching
The adaptive anonymity problem is formalized where each individual shares their data along with an integer value to indicate their personal level of desired privacy. This problem leads to a generalization of $k$-anonymity to the $b$-matching setting. Novel algorithms and theory are provided to implement this type of anonymity. The relaxation achieves better utility, admits theoretical privacy guarantees that are as strong, and, most importantly, accommodates a variable level of anonymity for each individual. Empirical results confirm improved utility on benchmark and social data-sets.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
RECTor: Robust and Efficient Correlation Attack on Tor
Tor is a widely used anonymity network that conceals user identities by routing traffic through encrypted relays, yet it remains vulnerable to traffic correlation attacks that deanonymize users by matching patterns in in…
Multiple Instance LearningAnonymity in sharing the revenues from broadcasting sports leagues
We study the problem of sharing the revenues from broadcasting sports leagues axiomatically. Our key axiom is anonymity, the classical impartiality axiom. Other impartiality axioms already studied in these problems are e…
V-Cloak: Intelligibility-, Naturalness- & Timbre-Preserving Real-Time Voice Anonymization
Voice data generated on instant messaging or social media applications contains unique user voiceprints that may be abused by malicious adversaries for identity inference or identity theft. Existing voice anonymization t…
Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Speaker Verificationspeech-recognition+2Smooth Anonymity for Sparse Graphs
When working with user data providing well-defined privacy guarantees is paramount. In this work, we aim to manipulate and share an entire sparse dataset with a third party privately. In fact, differential privacy has em…
Adaptive Filtering Algorithms for Set-Valued Observations -- Symmetric Measurement Approach to Unlabeled and Anonymized Data
Suppose $L$ simultaneous independent stochastic systems generate observations, where the observations from each system depend on the underlying parameter of that system. The observations are unlabeled (anonymized), in th…