Skip to main content
SpringerLink
Log in

Secure network coding in the presence of eavesdroppers

  • Research Papers
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

Abstract

Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. Based on the generalized attack model and all-or-nothing transformation, the security of network coding in the generalized combination network can be characterized by the network capacity and the min-cut bound of wiretapping set from the source. Furthermore, it can be extended to any directed acyclic networks with single source. Compared with the traditional results, we construct information-theoretic secure network coding without additional encryptions and giving up any capacity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahlswede R, Cai N, Li S-Y R, et al. Network information flow. IEEE Trans Inf Theory, 2000, 46: 1204–1216

    Article  MATH  MathSciNet  Google Scholar 

  2. Ho T, Médard M, Koetter R, et al. A random linear network coding approach to multicast. IEEE Trans Inf Theory, 2006, 52: 4413–4430

    Article  Google Scholar 

  3. Li S-Y R, Yeung R W, Cai N. Linear network coding. IEEE Trans Inf Theory, 2003, 49: 371–381

    Article  MATH  MathSciNet  Google Scholar 

  4. Yeung R W. Information Theory and Network Coding. Hong Kong: Springer, 2008

    MATH  Google Scholar 

  5. Jaggi S, Sanders P, Chou P A, et al. Polynomial time algorithms for multicast network code construction. IEEE Trans Inf Theory, 2003, 51: 1973–1982

    Article  MathSciNet  Google Scholar 

  6. Koetter R, Médard M. An algebraic approach to network coding. IEEE/ACM Trans Network, 2003, 11: 782–795

    Article  Google Scholar 

  7. Lima L, Médard M, Barros J. Random linear network coding: A free cypher? In: Proc of the IEEE Inter Sym on Infor Theory, Nice. 2007. 546–550

  8. Cai N, Yeung R W. Secure network coding. In: ISIT, Switzerland, 2002. 323

  9. Cai N, Yeung R W. A security condition for multi-source linear network coding. In: Proc of the IEEE Inter Sym on Infor Theory, Nice. 2007. 24–29

  10. Yeung R W, Cai N. On the optimality of a construction of secure network codes. In: Proc of the IEEE Inter Sym on Infor Theory, Toronto, 2008. 166–170

  11. Feldman J, Malkin T, Servedio R A, et al. On the capacity of secure network coding. In: 42nd Annual Allerton Conference on Communication, Control, and Computing, Monticello, 2004. 388–401

  12. Bhattad K, Narayanan K. Weakly secure network coding. In: Proc of the First Workshop on Network Coding, Theory, and Applications (NetCod), Riva del, 2005. 148–153

  13. Tan J, Médard M. Secure network coding with a cost criterion. In: Proc of the 4th Inter Sym on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt’06), Boston, 2006. 1–6

  14. Vilela J P, Lima L, Barros J. Lightweight security for network coding. In: IEEE Inter Conference on Communications, Beijing, 2008. 1750–1754

  15. Lima L, Vilela J P, Barros J, et al. An information-theoretic cryptanalysis of network coding is protecting the code enough? In: ISITA, Auckland, 2008. 1–6

  16. Koetter R, Kschischang F. Coding for errors and erasures in random network coding. IEEE Trans Inf Theory, 2008, 54: 3579–3591

    Article  MathSciNet  Google Scholar 

  17. Silva D, Kschischang F, Koetter R. A rank-metric approach to error control in random network coding. In: IEEE Inf Theory Workshop on Infor Theory for Wireless Networks, Tucson, 2007. 1–5

  18. Jaggi S, Langberg M, Katti S, et al. Resilient network coding in the presence of byzantine adversaries. IEEE Trans Inf Theory, 2008, 54: 2596–2603

    Article  MathSciNet  Google Scholar 

  19. Cai N, Yeung R W. Network coding and error ecorrection. In: Proc 2002 IEEE Inform. Bangalore, Theory Workshop, 2002. 323

  20. Yeung R W, Cai N. Network error correction, I: basic concepts and upper bounds. Commun Inf Syst, 2006, 6: 19–35

    MATH  MathSciNet  Google Scholar 

  21. Zhang Z. Linear network error correction coding in packet networks. IEEE Trans Inf Theory, 2008, 54: 209–218

    Article  Google Scholar 

  22. Ho T, Leong B, Koetter R, et al. Byzantine modification detection in multicast networks using randomized network coding. In: Proc of the IEEE Inter Sym on Infor Theory, Chicago, 2004. 144

  23. Charles D, Jain K, Lauter K. Signatures for network coding. In: Proc of the 40th ACISS, Princeton, 2006. 857–863

  24. Zhao F, Kalker T, Médard M, et al. Signatures for content distribution with network coding. In: Proc of the IEEE Inter Sym on Infor Theory, Nice, 2007. 556–560

  25. Boneh D, Freeman D, Katz J, et al. Signing a linear subspace: signature schemes for network coding. In: Proc of PKC, Irvine, CA, 2009. 68–87

  26. Stinson D R. Something about all or nothing (transforms). Designs Codes Cryptography, 2001, 22: 133–138

    Article  MATH  MathSciNet  Google Scholar 

  27. Rivest R L. All-or-nothing Encryption and the package transform. In: Biham E, ed. Fast Software Encryption 1997 (LNCS 1267). Berlin: Springer, 1997. 210–218

    Chapter  Google Scholar 

  28. West D B. Introduction to Graph Theory. 2nd ed. Upper Saddle River, NJ: Prentice Hall, 2001

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, 100876, China

    MingXing Luo, YiXian Yang, LiCheng Wang & XinXin Niu

  2. Key Laboratory of Network and Information Attack and Defence Technology of MOE, Beijing University of Posts and Telecommunications, Beijing, 100876, China

    MingXing Luo, YiXian Yang, LiCheng Wang & XinXin Niu

  3. National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and Telecommunications, Beijing, 100876, China

    MingXing Luo, YiXian Yang, LiCheng Wang & XinXin Niu

Authors
  1. MingXing Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. YiXian Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. LiCheng Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. XinXin Niu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to MingXing Luo.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Luo, M., Yang, Y., Wang, L. et al. Secure network coding in the presence of eavesdroppers. Sci. China Inf. Sci. 53, 648–658 (2010). https://doi.org/10.1007/s11432-010-0052-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11432-010-0052-6

Keywords

Search

Navigation