Treffer: Refined Secure Network Coding Scheme with no Restriction on Coding Vectors
Title:
Refined Secure Network Coding Scheme with no Restriction on Coding Vectors
Authors:
Source:
IEEE communications letters. 16(11):1907-1910
Publisher Information:
New York, NY: Institute of Electrical and Electronics Engineers, 2012.
Publication Year:
2012
Physical Description:
print, 15 ref
Original Material:
INIST-CNRS
Subject Terms:
Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Codage, codes, Coding, codes, Cryptographie, Cryptography, Télécommunications, Telecommunications, Systèmes, réseaux et services de télécommunications, Systems, networks and services of telecommunications, Commutation et signalisation, Switching and signalling, Codage aléatoire, Random coding, Codificación aleatoria, Codage linéaire, Linear coding, Codificación lineal, Code linéaire, Linear code, Código lineal, Commutation paquet, Packet switching, Conmutación por paquete, Cryptographie, Cryptography, Criptografía, Génération nombre aléatoire, Random number generation, Generación número aleatorio, Hachage, Hashing, Système décentralisé, Decentralized system, Sistema descentralizado, Sécurité donnée, Security of data, Codage de réseau, Network coding, -Secure network coding, avalanche effect, cryptographic hash functions, one-time pad, random linear network coding, random number generators
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Information and Communication Engineering, Chosun University, Gwangju, Korea, Republic of
ISSN:
1089-7798
Rights:
Copyright 2014 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.26636282
Database:
PASCAL Archive
Weitere Informationen
In this letter, we consider the secure network coding problem with no restriction on me network coding vectors. Adeli and Liu proposed a scheme achieving perfect security in a network with network coding. In order to hide a security weakness of their scheme, they imposed a restriction on the linear network code design. However, this restriction can be violated when the random linear network coding is used due to the completely decentralized nature of it. We refine Adeli and Liu's scheme into new one with no restriction and thus remove the security weakness under the computationally bounded adversary assumption.