A Concentration of Measure Approach to Database De-anonymization
Not on the map. Why?
Abstract (arXiv)
In this paper, matching of correlated high-dimensional databases is investigated. A stochastic database model is considered where the correlation among the database entries is governed by an arbitrary joint distribution. Concentration of measure theorems such as typicality and laws of large numbers are used to develop a database matching scheme and derive necessary conditions for successful matching. Furthermore, it is shown that these conditions are tight through a converse result which characterizes a set of distributions on the database entries for which reliable matching is not possible. The necessary and sufficient conditions for reliable matching are evaluated in the cases when the database entries are independent and identically distributed as well as under Markovian database models.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Jan 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 1.
5 papers.
- 2022On Correlation Detection and Alignment Recovery of Gaussian Databasescited by 3
- 2023Phase Transitions in the Detection of Correlated Databasescited by 3
- 2023Gaussian Database Alignment and Gaussian Planted Matchingcited by 2
- 2023Testing Dependency of Unlabeled Databasescited by 2
- 2024Detection of Correlated Random Vectorscited by 0
- 2024Detection of Correlated Random Vectors24 Jan 2024
- 2023Testing Dependency of Unlabeled Databases10 Nov 2023
- 2023Gaussian Database Alignment and Gaussian Planted Matching5 Jul 2023
- 2023Phase Transitions in the Detection of Correlated Databases7 Feb 2023
- 2022On Correlation Detection and Alignment Recovery of Gaussian Databases2 Nov 2022