How to make a linear network code (strongly) secure

DOI10.1007/S10623-016-0180-0zbMath1370.94013OpenAlexW2259653973WikidataQ59606844 ScholiaQ59606844MaRDI QIDQ510412

Hiroyuki Ohta, Kenji Kakuta, Kaoru Kurosawa

Publication date: 17 February 2017

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-016-0180-0

zbMATH Keywords

securityinformation theorynetwork code

Mathematics Subject Classification ID

Communication theory (94A05)

Cites Work

• How to Construct Strongly Secure Network Coding Scheme
• Polynomial Time Algorithms for Multicast Network Code Construction
• Network information flow
• Linear network coding
• Universal Secure Multiplex Network Coding With Dependent and Non-Uniform Messages
• Revisiting a Secret Sharing Approach to Network Codes
• Secure Network Coding for Wiretap Networks of Type II
• Universal Secure Network Coding via Rank-Metric Codes
• Secure Network Coding on a Wiretap Network

This page was built for publication: How to make a linear network code (strongly) secure