Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization

DOI10.1007/978-3-540-87448-5_16MaRDI QIDQ3540932zbMATH OpenOpenAlexFDO

Authors Mohammad Ravanbakhsh, Mehdi M. Hassanzadeh, Dag Haugland

Publication date 25 November 2008

Published in Coding Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87448-5_16

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Network design and communication in computer systems (68M10)

Recommendations

• Information security in a random network coding network
• scientific article; zbMATH DE number 6531439
• Secure Error-Correction Network Coding in a Randomized Setting
• Secure network coding for multiple unicast: on the case of single source
• Preventing pollution attacks in multi-source network coding

Cites work

• scientific article; zbMATH DE number 5454072 (Why is no real title available?)
• How to share a secret
• Linear network coding
• Minimum-Cost Multicast over Coded Packet Networks
• Network information flow
• Polynomial Time Algorithms for Multicast Network Code Construction
• Secure Network Coding on a Wiretap Network
• Steiner problem in networks: A survey

Cited in

(1)

• On the practicality of cryptographic defences against pollution attacks in wireless network coding

This page was built for publication: Wiretapping Based on Node Corruption over Secure Network Coding: Analysis and Optimization

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