Skip to main content

Subspace Authentication for Random Linear Network Coding

  • Chapter
  • First Online:
Security in Network Coding

Part of the book series: Wireless Networks ((WN))

  • 827 Accesses

Abstract

As is introduced in Chap. 2, network coding is notoriously susceptible to pollution attacks: a single polluted packet can end up corrupting bunches of good ones.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 119.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agrawal, S., Boneh, D.: Homomorphic macs: MAC-based integrity for network coding. In: Proceedings of Applied Cryptography and Network Security, pp. 292–305 (2009)

    Google Scholar 

  2. Boneh, D., Franklin, M.: An efficient public key traitor tracing scheme. In: Advances in Cryptology, pp. 783–783. Springer, Heidelberg (1999)

    Google Scholar 

  3. Boneh, D., Freeman, D., Katz, J., Waters, B.: Signing a linear subspace: signature schemes for network coding. In: Public Key Cryptography (PKC), pp. 68–87. Springer, Heidelberg (2009)

    Google Scholar 

  4. Cai, N., Yeung, R.W.: Network error correction, II: lower bounds. Commun. Inf. Syst. 6(1), 37–54 (2006)

    MathSciNet  MATH  Google Scholar 

  5. Canetti, R., Garay, J., Itkis, G., Micciancio, D., Naor, M., Pinkas, B.: Multicast security: a taxonomy and some efficient constructions. In: Proceedings of IEEE INFOCOM, pp. 708–716 (1999)

    Google Scholar 

  6. Charles, D., Jain, K., Lauter, K.: Signatures for network coding. Int. J. Inf. Coding Theory 1(1), 3–14 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chou, P.A., Wu, Y., Jain, K.: Practical network coding. In: Proceedings of Annual Allerton Conference on Communication Control and Computing, pp. 40–49 (2003)

    Google Scholar 

  8. Dong, J., Curtmola, R., Nita-Rotaru, C.: Practical defenses against pollution attacks in intra-flow network coding for wireless mesh networks. In: Proceedings of the second ACM Conference on Wireless Network Security, pp. 111–122 (2009)

    Google Scholar 

  9. Gkantsidis, C., Rodriguez, P.: Cooperative security for network coding file distribution. In: Proceedings of IEEE INFOCOM, vol. 6, pp. 1–13 (2006)

    Google Scholar 

  10. Ho, T., Médard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B.: A random linear network coding approach to multicast. IEEE Trans. Inf. Theory 52(10), 4413–4430 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  11. Ho, T., Leong, B., Koetter, R., Médard, M., Effros, M., Karger, D.R.: Byzantine modification detection in multicast networks with random network coding. IEEE Trans. Inf. Theory 54(6), 2798–2803 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Jaggi, S., Langberg, M., Katti, S., Ho, T., Katabi, D., Médard, M.: Resilient network coding in the presence of byzantine adversaries. In: Proceedings of IEEE INFOCOM, pp. 616–624 (2007)

    Google Scholar 

  13. Jiang, Y., Zhu, H., Shi, M., Shen, X.S., Lin, C.: An efficient dynamic-identity based signature scheme for secure network coding. Comput. Netw. 54(1), 28–40 (2010)

    Article  MATH  Google Scholar 

  14. Katz, J., Lindell, Y.: Introduction to Modern Cryptography: Principles and Protocols. Chapman & Hall/CRC, Boca Raton (2007)

    MATH  Google Scholar 

  15. Kehdi, E., Li, B.: Null keys: Limiting malicious attacks via null space properties of network coding. In: Proceedings of IEEE INFOCOM, pp. 1224–1232 (2009)

    Google Scholar 

  16. Krohn, M.N., Freedman, M.J., Mazieres, D.: On-the-fly verification of rateless erasure codes for efficient content distribution. In: Proceedings of IEEE Symposium on Security and Privacy (S&P), pp. 226–240 (2004)

    Google Scholar 

  17. Li, Q., Chiu, D.M., Lui, J.C.: On the practical and security issues of batch content distribution via network coding. In: Proceedings of IEEE International Conference on Network Protocols (ICNP), pp. 158–167. IEEE, Santa Barbara (2006)

    Google Scholar 

  18. Li, Y., Yao, H., Chen, M., Jaggi, S., Rosen, A.: Ripple authentication for network coding. In: Proceedings of IEEE INFOCOM, pp. 1–9 (2010)

    Google Scholar 

  19. Montgomery, P.L.: Modular multiplication without trial division. Math. Comput. 44(170), 519–521 (1985)

    Article  MathSciNet  MATH  Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

  21. Yu, Z., Wei, Y., Ramkumar, B., Guan, Y.: An efficient signature-based scheme for securing network coding against pollution attacks. In: Proceedings of IEEE INFOCOM, pp. 1409–1417 (2008)

    Google Scholar 

  22. Yu, Z., Wei, Y., Ramkumar, B., Guan, Y.: An efficient scheme for securing xor network coding against pollution attacks. In: Proceedings of IEEE INFOCOM, pp. 406–414 (2009)

    Google Scholar 

  23. Yun, A., Cheon, J.H., Kim, Y.: On homomorphic signatures for network coding. IEEE Trans. Comput. 59(9), 1295–1296 (2010)

    Article  MathSciNet  Google Scholar 

  24. Zhang, Z.: Network error correction coding in packetized networks. In: Proceedings of IEEE Information Theory Workshop, pp. 433–437 (2006)

    Google Scholar 

  25. Zhao, F., Kalker, T., Médard, M., Han, K.J.: Signatures for content distribution with network coding. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 556–560 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Zhang, P., Lin, C. (2016). Subspace Authentication for Random Linear Network Coding. In: Security in Network Coding. Wireless Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-31083-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-31083-1_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-31082-4

  • Online ISBN: 978-3-319-31083-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics