Secure Network Coding on a Wiretap Network

DOI10.1109/TIT.2010.2090197MaRDI QIDQ5281138zbMATH OpenFDO

Authors Ning Cai, Raymond W. Yeung

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2010.2090197

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Cryptography (94A60)

Cited in

(16)

• Anonymous coherent network coding against eavesdropping and jamming
• Algebraic codes for network coding
• Network-Hiding Communication and Applications to Multi-party Protocols
• How to construct strongly secure network coding scheme
• Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization
• Secure Error-Correction Network Coding in a Randomized Setting
• Information security in a random network coding network
• Network information flow
• How to make a linear network code (strongly) secure
• On Secure Network Coding for Multiple Unicast Traffic
• Correcting adversarial errors with generalized regenerating codes
• Construction of lattices over the real sub-field of \(\mathbb{Q}(\varsigma_8)\) for block fading (wiretap) coding
• Ning Cai: a tribute to a pioneering scholar in information theory
• Secure network coding with adaptive and active attack
• A geometric approach to rank metric codes and a classification of constant weight codes
• (Secure) linear network coding multicast

This page was built for publication: Secure Network Coding on a Wiretap Network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281138)