IEICE TRANSACTIONS on Fundamentals
Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
Summary :
Silva et al. proposed a universal secure network coding scheme based on MRD codes, which can be applied to any underlying network code. This paper considers a stronger eavesdropping model where the eavesdroppers possess the ability to re-select the tapping links during the transmission. We give a proof for the impossibility of attaining universal security against such adversaries using Silva et al.'s code for all choices of code parameters, even with a restricted number of tapped links. We also consider the cases with restricted tapping duration and derive some conditions for this code to be secure.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.11 pp.2026-2033
- Publication Date
- 2010/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.2026
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Cryptography and Information Security
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Eitaro SHIOJI, Ryutaroh MATSUMOTO, Tomohiko UYEMATSU, "Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 11, pp. 2026-2033, November 2010, doi: 10.1587/transfun.E93.A.2026.
Abstract: Silva et al. proposed a universal secure network coding scheme based on MRD codes, which can be applied to any underlying network code. This paper considers a stronger eavesdropping model where the eavesdroppers possess the ability to re-select the tapping links during the transmission. We give a proof for the impossibility of attaining universal security against such adversaries using Silva et al.'s code for all choices of code parameters, even with a restricted number of tapped links. We also consider the cases with restricted tapping duration and derive some conditions for this code to be secure.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.2026/_p
Copy
@ARTICLE{e93-a_11_2026,
author={Eitaro SHIOJI, Ryutaroh MATSUMOTO, Tomohiko UYEMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers},
year={2010},
volume={E93-A},
number={11},
pages={2026-2033},
abstract={Silva et al. proposed a universal secure network coding scheme based on MRD codes, which can be applied to any underlying network code. This paper considers a stronger eavesdropping model where the eavesdroppers possess the ability to re-select the tapping links during the transmission. We give a proof for the impossibility of attaining universal security against such adversaries using Silva et al.'s code for all choices of code parameters, even with a restricted number of tapped links. We also consider the cases with restricted tapping duration and derive some conditions for this code to be secure.},
keywords={},
doi={10.1587/transfun.E93.A.2026},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2026
EP - 2033
AU - Eitaro SHIOJI
AU - Ryutaroh MATSUMOTO
AU - Tomohiko UYEMATSU
PY - 2010
DO - 10.1587/transfun.E93.A.2026
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2010
AB - Silva et al. proposed a universal secure network coding scheme based on MRD codes, which can be applied to any underlying network code. This paper considers a stronger eavesdropping model where the eavesdroppers possess the ability to re-select the tapping links during the transmission. We give a proof for the impossibility of attaining universal security against such adversaries using Silva et al.'s code for all choices of code parameters, even with a restricted number of tapped links. We also consider the cases with restricted tapping duration and derive some conditions for this code to be secure.
ER -
English
