Universal secure error-correcting schemes for network coding

@article{Silva2010UniversalSE,
  title={Universal secure error-correcting schemes for network coding},
  author={Danilo Silva and Frank R. Kschischang},
  journal={2010 IEEE International Symposium on Information Theory},
  year={2010},
  pages={2428-2432}
}
This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer. The network is assumed to transport n packets from source to each receiver, and the adversary is allowed to eavesdrop on μ arbitrarily chosen links and also to inject up to t erroneous packets into the network. The goal of the system is to achieve zero-error communication that is information-theoretically secure from the adversary. Moreover, this goal must… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS
10 Citations
24 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 24 references

Gabidulin, “Theory of codes with maximum rank dist ance,”Probl

  • E M.
  • Inform. Transm.,
  • 1985
Highly Influential
12 Excerpts

Error control for network coding

  • D. Silva
  • Ph.D. dis sertation, University of Toronto…
  • 2009
1 Excerpt

Similar Papers

Loading similar papers…