Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Nonadaptive Mastermind Algorithms for String and Vector Databases, with
  Case Studies   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.

30
The categories of this paper are: q-alg
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
20
The categories of this paper are: acc-phys
13
The categories of this paper are: quant-ph
4
The categories of this paper are: cond-mat
25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
32
The categories of this paper are: atom-ph
14
The categories of this paper are: math-ph
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg
29
The categories of this paper are: funct-an
24
The categories of this paper are: dg-ga
18
The categories of this paper are: econ
3
The categories of this paper are: physics