Private combinatorial group testing

Combinatorial group testing, given a set C of individuals ("customers"), consists of applying group tests on subsets of C for the purpose of identifying which members of C are infected (or, more generally, defective in some way). The outcome of a group test reveals only the presence or absence of infection(s) in that group, but a number of group tests exactly identifies all infected members. Although the main motivation for group testing is economic - it drastically cuts down the number of necessary tests - it has an interesting privacy side-effect, namely, that each individual customer is "hiding in a crowd" (the groups within which it is being tested). This privacy side-effect is currently thrown away because the analysis that pinpoints who is infected is carried out by the same entity that prepared the test samples. This paper gives a protocol in which these two duties are separated between Alice and Bob: The protocol informs each customer who is infected privately, and without either Alice or Bob learning who is infected. An interesting feature of our protocol is that a customer need not have any computational power, i.e., the customer can be notified by mailing her (possibly paper copies of) two random strings - one from Alice and one from Bob - so all she has to do is visually check whether these two strings are equal or not.

[1]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[2]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[3]  Ding-Zhu Du,et al.  A survey on combinatorial group testing algorithms with applications to DNA Library Screening , 1999, Discrete Mathematical Problems with Medical Applications.

[4]  Douglas R Stinson,et al.  Surveys in Combinatorics, 1999: Applications of Combinatorial Designs to Communications, Cryptography, and Networking , 1999 .

[5]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[6]  Dawn Xiaodong Song,et al.  Privacy-Preserving Set Operations , 2005, CRYPTO.

[7]  A. Sterrett On the Detection of Defective Members of Large Populations , 1957 .

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  S. Wei Secure Frameproof Codes, Key Distribution Patterns, Group Testing Algorithms and Related Structures , 1997 .

[10]  Benny Pinkas,et al.  Efficient Private Matching and Set Intersection , 2004, EUROCRYPT.

[11]  Rafail Ostrovsky,et al.  Private Searching on Streaming Data , 2005, Journal of Cryptology.

[12]  Mikhail J. Atallah,et al.  Indexing Information for Data Forensics , 2005, ACNS.

[13]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[14]  Bart Goethals,et al.  On Private Scalar Product Computation for Privacy-Preserving Data Mining , 2004, ICISC.