Secure Multi-Source Multicast
© 1972-2012 IEEE. 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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/136347 |
| _version_ | 1811070040977440768 |
|---|---|
| author | Cohen, Alejandro Cohen, Asaf Medard, Muriel Gurewitz, Omer |
| author2 | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems |
| author_facet | Massachusetts Institute of Technology. Laboratory for Information and Decision Systems Cohen, Alejandro Cohen, Asaf Medard, Muriel Gurewitz, Omer |
| author_sort | Cohen, Alejandro |
| collection | MIT |
| description | © 1972-2012 IEEE. 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. |
| first_indexed | 2024-09-23T08:21:43Z |
| format | Article |
| id | mit-1721.1/136347 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T08:21:43Z |
| publishDate | 2021 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1363472023-09-01T19:44:42Z Secure Multi-Source Multicast Cohen, Alejandro Cohen, Asaf Medard, Muriel Gurewitz, Omer Massachusetts Institute of Technology. Laboratory for Information and Decision Systems © 1972-2012 IEEE. 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. 2021-10-27T20:34:58Z 2021-10-27T20:34:58Z 2019 2019-06-21T13:09:02Z Article http://purl.org/eprint/type/JournalArticle https://hdl.handle.net/1721.1/136347 en 10.1109/TCOMM.2018.2870831 IEEE Transactions on Communications Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv |
| spellingShingle | Cohen, Alejandro Cohen, Asaf Medard, Muriel Gurewitz, Omer Secure Multi-Source Multicast |
| title | Secure Multi-Source Multicast |
| title_full | Secure Multi-Source Multicast |
| title_fullStr | Secure Multi-Source Multicast |
| title_full_unstemmed | Secure Multi-Source Multicast |
| title_short | Secure Multi-Source Multicast |
| title_sort | secure multi source multicast |
| url | https://hdl.handle.net/1721.1/136347 |
| work_keys_str_mv | AT cohenalejandro securemultisourcemulticast AT cohenasaf securemultisourcemulticast AT medardmuriel securemultisourcemulticast AT gurewitzomer securemultisourcemulticast |