Revisiting a Secret Sharing Approach to Network Codes
From MaRDI portal
Publication:5200591
DOI10.1007/978-3-642-33272-2_20zbMATH Open1303.94113OpenAlexW2214470263MaRDI QIDQ5200591FDOQ5200591
Authors: Zhaohui Tang, Hoon Wei Lim, Huaxiong Wang
Publication date: 6 November 2012
Published in: Provable Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-33272-2_20
Recommendations
- Code based secret sharing schemes. Applied combinatorial coding theory
- Closure Solvability for Network Coding and Secret Sharing
- Secure Coding Over Networks Against Noncooperative Eavesdropping
- On Secure Network Coding With Nonuniform or Restricted Wiretap Sets
- On the composition of secret sharing schemes related to codes
Cited In (7)
- How to construct strongly secure network coding scheme
- An efficient construction of secure network coding
- Title not available (Why is that?)
- How to make a linear network code (strongly) secure
- Secure network coding for multiple unicast: on the case of single source
- Information security in a random network coding network
- Some applications of finite geometry for secure network coding
This page was built for publication: Revisiting a Secret Sharing Approach to Network Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200591)