The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Silva e outros. propôs um esquema de codificação de rede universal seguro baseado em códigos MRD, que pode ser aplicado a qualquer código de rede subjacente. Este artigo considera um modelo de escuta mais forte, onde os bisbilhoteiros possuem a capacidade de selecionar novamente os links de escuta durante a transmissão. Damos uma prova da impossibilidade de alcançar segurança universal contra tais adversários usando o código de Silva et al. para todas as escolhas de parâmetros de código, mesmo com um número restrito de links explorados. Também consideramos os casos com duração de toque restrita e derivamos algumas condições para que este código seja seguro.
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.
Copiar
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
Copiar
@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},}
Copiar
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 -