On the security of index coding with side information
Security aspects of the index coding with side information (ICSI) problem are investigated. Building on the results of Bar-Yossef (2006), the properties of linear index codes are further explored. The notion of weak security, considered by Bhattad and Narayanan (2005) in the context of network codin...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2013
|
| Online Access: | https://hdl.handle.net/10356/96153 http://hdl.handle.net/10220/11387 |
| _version_ | 1826117926368837632 |
|---|---|
| author | Dau, Son Hoang Skachek, Vitaly Chee, Yeow Meng |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Dau, Son Hoang Skachek, Vitaly Chee, Yeow Meng |
| author_sort | Dau, Son Hoang |
| collection | NTU |
| description | Security aspects of the index coding with side information (ICSI) problem are investigated. Building on the results of Bar-Yossef (2006), the properties of linear index codes are further explored. The notion of weak security, considered by Bhattad and Narayanan (2005) in the context of network coding, is generalized to block security. It is shown that the linear index code based on a matrix L, whose column space code C(L) has length n, minimum distance d , and dual distance d⊥ , is (d-1-t) -block secure (and hence also weakly secure) if the adversary knows in advance t ≤ d-2 messages, and is completely insecure if the adversary knows in advance more than n - d⊥ messages. Strong security is examined under the conditions that the adversary: 1) possesses t messages in advance; 2) eavesdrops at most μ transmissions; 3) corrupts at most δ transmissions. We prove that for sufficiently large q , an optimal linear index code which is strongly secure against such an adversary has length κq+μ+2δ . Here, κq is a generalization of the min-rank over Fq of the side information graph for the ICSI problem in its original formulation in the work of Bar-Yossef et al. |
| first_indexed | 2024-10-01T04:35:21Z |
| format | Journal Article |
| id | ntu-10356/96153 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T04:35:21Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | ntu-10356/961532020-03-07T12:37:08Z On the security of index coding with side information Dau, Son Hoang Skachek, Vitaly Chee, Yeow Meng School of Physical and Mathematical Sciences Security aspects of the index coding with side information (ICSI) problem are investigated. Building on the results of Bar-Yossef (2006), the properties of linear index codes are further explored. The notion of weak security, considered by Bhattad and Narayanan (2005) in the context of network coding, is generalized to block security. It is shown that the linear index code based on a matrix L, whose column space code C(L) has length n, minimum distance d , and dual distance d⊥ , is (d-1-t) -block secure (and hence also weakly secure) if the adversary knows in advance t ≤ d-2 messages, and is completely insecure if the adversary knows in advance more than n - d⊥ messages. Strong security is examined under the conditions that the adversary: 1) possesses t messages in advance; 2) eavesdrops at most μ transmissions; 3) corrupts at most δ transmissions. We prove that for sufficiently large q , an optimal linear index code which is strongly secure against such an adversary has length κq+μ+2δ . Here, κq is a generalization of the min-rank over Fq of the side information graph for the ICSI problem in its original formulation in the work of Bar-Yossef et al. 2013-07-15T03:42:07Z 2019-12-06T19:26:23Z 2013-07-15T03:42:07Z 2019-12-06T19:26:23Z 2012 2012 Journal Article Dau, S. H., Skachek, V., & Chee, Y. M. (2012). On the Security of Index Coding With Side Information. IEEE Transactions on Information Theory, 58(6), 3975-3988. 0018-9448 https://hdl.handle.net/10356/96153 http://hdl.handle.net/10220/11387 10.1109/TIT.2012.2188777 en IEEE transactions on information theory © 2012 IEEE. |
| spellingShingle | Dau, Son Hoang Skachek, Vitaly Chee, Yeow Meng On the security of index coding with side information |
| title | On the security of index coding with side information |
| title_full | On the security of index coding with side information |
| title_fullStr | On the security of index coding with side information |
| title_full_unstemmed | On the security of index coding with side information |
| title_short | On the security of index coding with side information |
| title_sort | on the security of index coding with side information |
| url | https://hdl.handle.net/10356/96153 http://hdl.handle.net/10220/11387 |
| work_keys_str_mv | AT dausonhoang onthesecurityofindexcodingwithsideinformation AT skachekvitaly onthesecurityofindexcodingwithsideinformation AT cheeyeowmeng onthesecurityofindexcodingwithsideinformation |