.png){kind=icon}
.png){kind=icon}
Return
Nonadaptive Mastermind Algorithms for String and Vector Databases, with Case Studies
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2011.147.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we study sparsity-exploiting Mastermind algorithms for attacking the privacy of an entire database of character strings or vectors, such as DNA strings, movie ratings, or social network friendship data. Based on reductions to nonadaptive group testing, our methods are able to take advantage of minimal amounts of privacy leakage, such as contained in a single bit that indicates if two people in a medical database have any common genetic mutations, or if two people have any common friends in an online social network. We analyze our Mastermind attack algorithms using theoretical characterizations that provide sublinear bounds on the number of queries needed to clone the database, as well as experimental tests on genomic information, collaborative filtering data, and online social networks. By taking advantage of the generally sparse nature of these real-world databases and modulating a parameter that controls query sparsity, we demonstrate that relatively few nonadaptive queries are needed to recover a large majority of each database.
Keywords:
Mastermind algorithms
privacy leaks
data cloning
combinatorial group testing
nonadaptive attacks
Journal
IF:
10.4
Papers:
6.7K
Citations:
3.2W
