Proceedings Article10.1109/ISIT.2016.7541527
Secure Group Testing
Alejandro Cohen,Asaf Cohen,Omer Gurewitz +2 more
- 10 Jul 2016
- pp 1391-1395
TL;DR: This paper proposes a new non-adaptive Secure Group Testing (SGT) algorithm based on information theoretic principles, which keeps the eavesdropper ignorant regarding the items' status, and proves that the number of tests required for both correct reconstruction at the legitimate user and negligible mutual information at Eve's side is 1/1-δ times the numberof tests required with no secrecy constraint.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Figure 7: Codewords exactly lie in a ball around Z̃T j̃ of radius d ≈ (1− δK )T ), where j is the codeword index and 1 ≤ i ≤ N is the bin index. 
Figure 1: An example of test results, a simple decoding procedure at the legitimate decoder and the risk of leakage. The example includes 7 items, out of which at most one defective (the second one in this case; unknown to the decoder). Three pooled tests are conducted. Each row dictates in which pooled tests the corresponding item participates. (a) Since the first result is negative, items 1 and 6 are not defective. (b) The second result is positive, hence at least one of items 2 and 4 is defective. (c) Based on the last result, as item 4 cannot be defective, it is clear that 2 is defective. Note that decoding in this case is simple: any algorithm which will simply rule out each item whose row in the matrix is not compatible with the result will rule out all but the second item, due to the first and last test results being negative, thus identifying the defective item easily. (d) An evesdropped which has access to part of the results (the first two) can still infers useful information. Our goal is construct a testing matrix such that such an eavesdropper remains ignorant. 
Figure 2: Analogy between channel scheme to SGT model.
Citations
Efficient Data Collection Over Multiple Access Wireless Sensors Network
TL;DR: A secure version of the protocol is designed, in which an eavesdropper observing only partial information sent on the channel cannot gain significant information on the messages transmitted or even which are the sources that sent these messages.
37
Secure Group Testing
Alejandro Cohen,Asaf Cohen,Omer Gurewitz +2 more
- 10 Jul 2016
TL;DR: This paper proposes a new non-adaptive Secure Group Testing (SGT) algorithm based on information theoretic principles, which keeps the eavesdropper ignorant regarding the items' status, and proves that the number of tests required for both correct reconstruction at the legitimate user and negligible mutual information at Eve's side is 1/1-δ times the numberof tests required with no secrecy constraint.
Secured Data Gathering Protocol for IoT Networks
Alejandro Cohen,Asaf Cohen,Omer Gurewitz +2 more
- 21 Jun 2018
TL;DR: A tailored protocol is much more suited than the existing general purpose WSN protocols for securing the data transmitted and the identity of the transmitting devices, since knowing the transmitters identity conveys a lot of information.
7
•Posted Content
Data Aggregation Over Multiple Access Wireless Sensors Network.
TL;DR: This work design and analyze a data collection protocol based on information theoretic principles, which collects messages from up to K sensors simultaneously, out of a large population of sensors, without knowing in advance which sensors will transmit, and without requiring any synchronization, coordination or management overhead.
4
Serial Quantization for Representing Sparse Signals
Alejandro Cohen,Nir Shlezinger,Yonina C. Eldar,Muriel Medard +3 more
- 03 Jul 2019
TL;DR: In this article, the authors proposed a method for serial quantization of sparse signals (SeQuanS) inspired by group testing theory, which is designed to reliably and accurately quantize sparse signals acquired in a sequential manner using serial scalar ADCs.
4
References
•Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
- 01 Jan 1991
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
How to share a secret
TL;DR: This technique enables the construction of robust key management schemes for cryptographic systems that can function securely and reliably even when misfortunes destroy half the pieces and security breaches expose all but one of the remaining pieces.
Anomaly detection: A survey
TL;DR: This survey tries to provide a structured and comprehensive overview of the research on anomaly detection by grouping existing techniques into different categories based on the underlying approach adopted by each technique.
Communication theory of secrecy systems
TL;DR: A theory of secrecy systems is developed on a theoretical level and is intended to complement the treatment found in standard works on cryptography.
The wire-tap channel
TL;DR: This paper finds the trade-off curve between R and d, assuming essentially perfect (“error-free”) transmission, and implies that there exists a Cs > 0, such that reliable transmission at rates up to Cs is possible in approximately perfect secrecy.
7.9K