TY - JOUR
T1 - Secure multi-source multicast
AU - Cohen, Alejandro
AU - Cohen, Asaf
AU - Medard, Muriel
AU - Gurewitz, Omer
N1 - Funding Information:
Manuscript received November 21, 2017; revised May 24, 2018 and August 30, 2018; accepted September 8, 2018. Date of publication September 17, 2018; date of current version January 15, 2019. This research was partially supported by the Israeli MOITAL NEPTUN consortium and by the European Union Horizon 2020 Research and Innovation Programme SUPERFLUIDITY under Grant 671566. This paper was presented in part at the IEEE International Symposium on Information Theory in 2017. The associate editor coordinating the review of this paper and approving it for publication was C. Tian. (Corresponding author: Alejandro Cohen.) A. Cohen, A. Cohen, and O. Gurewitz are with the Department of Communication Systems Engineering, Ben-Gurion University of the Negev, Beersheba 84105, Israel (e-mail: alejandr@post.bgu.ac.il; coasaf@post. bgu.ac.il; gurewitz@post.bgu.ac.il).
Publisher Copyright:
© 1972-2012 IEEE.
PY - 2019/1/1
Y1 - 2019/1/1
N2 - The principal mission of multi-source multicast (MSM) is to disseminate all messages from all sources in a network to all destinations. MSM is utilized in numerous applications. In many of them, securing the messages disseminated is critical. A common secure model is to consider a network where there is an eavesdropper which is able to observe a subset of the network links, and seeks a code which keeps the eavesdropper ignorant regarding all the messages. While this is solved when all messages are located at a single source, secure MSM (SMSM) is an open problem, and the rates required are hard to characterize in general. In this paper, we consider individual security, which promises that the eavesdropper has zero mutual information with each message individually, or, more generally, with sub sets of messages. We completely characterize the rate region for SMSM under individual security, and show that such a security level is achievable at the full capacity of the network, that is, the cut-set bound is the matching converse, similar to non-secure MSM. Moreover, we show that the field size is similar to non-secure MSM and does not have to be larger due to the security constraint.
AB - The principal mission of multi-source multicast (MSM) is to disseminate all messages from all sources in a network to all destinations. MSM is utilized in numerous applications. In many of them, securing the messages disseminated is critical. A common secure model is to consider a network where there is an eavesdropper which is able to observe a subset of the network links, and seeks a code which keeps the eavesdropper ignorant regarding all the messages. While this is solved when all messages are located at a single source, secure MSM (SMSM) is an open problem, and the rates required are hard to characterize in general. In this paper, we consider individual security, which promises that the eavesdropper has zero mutual information with each message individually, or, more generally, with sub sets of messages. We completely characterize the rate region for SMSM under individual security, and show that such a security level is achievable at the full capacity of the network, that is, the cut-set bound is the matching converse, similar to non-secure MSM. Moreover, we show that the field size is similar to non-secure MSM and does not have to be larger due to the security constraint.
KW - Information-theoretic security
KW - Multi-source multicast communication
KW - Network coding
KW - Random linear coding
KW - Secure distributed storage
KW - Secure network coding
UR - http://www.scopus.com/inward/record.url?scp=85053322504&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2018.2870831
DO - 10.1109/TCOMM.2018.2870831
M3 - Article
AN - SCOPUS:85053322504
SN - 1558-0857
VL - 67
SP - 708
EP - 723
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 1
M1 - 8466890
ER -