| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5777314 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
Abstract
This paper considers a problem of anonymous transmission against eavesdropping and jamming in coherent network coding. We propose an information-theoretical message unlinkability scheme based on coset coding. We show that if an incoming message is transformed to another message of the same coset by adding a random codeword then the incoming and outgoing messages are statistically independent and consequently, unlinkable.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Oksana Trushina, Ernst Gabidulin,