Abstract
This paper investigates the problem of securing k source symbols transmission in a network with side information to an adversary who can obtain k' source symbols, eavesdrop μ channels and contaminate d channels. We characterize the security performance of the new model by relative network generalized Hamming weight (RNGHW) of a linear code and a subcode with respect to network error correction (NEC). The model regards secure network coding on wiretap networks as a special case. An upper bound on NEC-RNGHW is introduced and two deterministic constructions of transmission scheme are proposed to achieve the bound.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
