TY - GEN
T1 - Secure Group Testing
AU - Cohen, Alejandro
AU - Cohen, Asaf
AU - Gurewitz, Omer
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/10
Y1 - 2016/8/10
N2 - The principal mission of Group Testing (GT) is to identify a small subset of 'defective' items from a large population, by grouping items into as little as possible test pools. The test outcome of a pool is positive if it contains at least one defective item, and is negative otherwise. GT algorithms are utilized in numerous applications, and in most of them the privacy of the tested subjects, namely, whether they are defective or not, is critical. In this paper, we consider a scenario where there is an eavesdropper (Eve) which is able to observe a subset of the GT outcomes (pools). We propose a new non-adaptive Secure Group Testing (SGT) algorithm based on information theoretic principles, which keeps the eavesdropper ignorant regarding the items' status. Specifically, when the fraction of tests observed by Eve is 0 ≤ δ < 1, we prove that the number of tests required for both correct reconstruction at the legitimate user (with high probability) and negligible mutual information at Eve's side is 1/1-δ times the number of tests required with no secrecy constraint.
AB - The principal mission of Group Testing (GT) is to identify a small subset of 'defective' items from a large population, by grouping items into as little as possible test pools. The test outcome of a pool is positive if it contains at least one defective item, and is negative otherwise. GT algorithms are utilized in numerous applications, and in most of them the privacy of the tested subjects, namely, whether they are defective or not, is critical. In this paper, we consider a scenario where there is an eavesdropper (Eve) which is able to observe a subset of the GT outcomes (pools). We propose a new non-adaptive Secure Group Testing (SGT) algorithm based on information theoretic principles, which keeps the eavesdropper ignorant regarding the items' status. Specifically, when the fraction of tests observed by Eve is 0 ≤ δ < 1, we prove that the number of tests required for both correct reconstruction at the legitimate user (with high probability) and negligible mutual information at Eve's side is 1/1-δ times the number of tests required with no secrecy constraint.
UR - https://www.scopus.com/pages/publications/84985990689
U2 - 10.1109/ISIT.2016.7541527
DO - 10.1109/ISIT.2016.7541527
M3 - Conference contribution
AN - SCOPUS:84985990689
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1391
EP - 1395
BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PB - Institute of Electrical and Electronics Engineers
T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016
Y2 - 10 July 2016 through 15 July 2016
ER -