An efficient MAC scheme for secure network coding with probabilistic detection
From MaRDI portal
Publication:1762208
DOI10.1007/s11704-012-1068-4zbMath1251.68041OpenAlexW2047058804MaRDI QIDQ1762208
Publication date: 15 November 2012
Published in: Frontiers of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11704-012-1068-4
pollution attackshomomorphic message authentication codes (MACs)probabilistic detectionsecure network coding
Network design and communication in computer systems (68M10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Authentication, digital signatures and secret sharing (94A62)
Uses Software
Cites Work
- Signatures for network coding
- Network error correction. I: Basic concepts and upper bounds
- Network error correction. II: Lower bounds
- An efficient dynamic-identity based signature scheme for secure network coding
- Resilient Network Coding in the Presence of Byzantine Adversaries
- Byzantine Modification Detection in Multicast Networks With Random Network Coding
- A Rank-Metric Approach to Error Control in Random Network Coding
- Signing a Linear Subspace: Signature Schemes for Network Coding
- Network information flow
- Linear network coding