How to construct strongly secure network coding scheme

DOI10.1007/978-3-319-04268-8_1MaRDI QIDQ2948249zbMATH OpenOpenAlexFDO

Authors Kaoru Kurosawa, Hiroyuki Ohta, Kenji Kakuta

Publication date 30 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04268-8_1

zbMATH Keywords

network codingconstructionstrongly secure

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• How to make a linear network code (strongly) secure
• An efficient construction of secure network coding
• Secure network coding for multiple unicast: on the case of single source
• Revisiting a Secret Sharing Approach to Network Codes
• Some applications of finite geometry for secure network coding

Cites work

• Linear network coding
• Network information flow
• Polynomial Time Algorithms for Multicast Network Code Construction
• Revisiting a Secret Sharing Approach to Network Codes
• Secure Network Coding on a Wiretap Network
• Universal Secure Network Coding via Rank-Metric Codes

Cited in

(7)

• scientific article; zbMATH DE number 6263174 (Why is no real title available?)
• An efficient construction of secure network coding
• Anonymous and secure network coding scheme
• 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: How to construct strongly secure network coding scheme

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