An Efficient Lightweight Security Algorithm for Random Linear Network Coding

Hassan Noura, Steven Martin, Khaldoun Al Agha

Abstract

Recently, several encryption schemes have been presented to Random Linear Network Coding (RLNC). The recent proposed lightweight security system for Network Coding is based upon protecting the Global Encoding Vectors (GEV) and using other vector to ensure the encoding process of RLNC at intermediate nodes. However, the current lightweight security scheme, possess several practical challenges to be deployed in real application. Furthermore, achieving a high security level results on a high computational complexity and adds some communication overhead. In this paper, a new scheme is defined that supports some properties to overcome the drawbacks of the lightweight Security scheme, and can be used for RLNC real-time data exchange. First, the cryptographic primitive (AES in CTR mode) is replaced by another approach that is based on the utilization of a new flexible key-dependent invertible matrix (dynamic diffusion layer). Then, we show that this approach reduces the size of communication overhead of GEV from $2\times h$ to $h$ elements. In addition to that, we also demonstrate that besides the information confidentially, both the packet integrity and the source authentication are attained with minimum computational complexity and memory overhead. Indeed, simulation tests and results of this scheme yield to a conclusion that our new proposed scheme has sufficient security strength and good performance characteristics that permits to ensure an efficient and simple implementation. Thus, facilitate the integration of this system in many applications that treat security as a principal requirement.

References

  1. Bhattad, K. and Narayanan, K. R. (2005). Weakly secure network coding.
  2. Cai, N. and Yeung, R. (2002). Secure network coding.
  3. Clarkson, J. B. (1994). Dense probabilistic encryption. In In Proceedings of the Workshop on Selected Areas of Cryptography, pages 120-128.
  4. Fan, Y., Jiang, Y., Zhu, H., and Shen, X. (2009). An efficient privacy-preserving scheme against traffic analysis attacks in network coding. In INFOCOM, pages 2213-2221. IEEE.
  5. Fathy, A., ElBatt, T., and Youssef, M. (2011). A source authentication scheme using network coding. Int. J. Secur. Netw., 6(2/3):101-111.
  6. Ho, T., Mdard, M., Koetter, R., Karger, D. R., Effros, M., Shi, J., and Leong, B. (2006). A random linear network coding approach to multicast. IEEE TRANS. INFORM. THEORY, 52(10):4413-4430.
  7. Koetter, R., Mdard, M., and Member, S. (2003). An algebraic approach to network coding. IEEE/ACM Transactions on Networking, 11:782-795.
  8. Li, Y., Yao, H., Chen, M., Jaggi, S., and Rosen, A. (2010). Ripple authentication for network coding. In Proceedings of the 29th conference on Information communications, INFOCOM'10, pages 2258-2266, Piscataway, NJ, USA. IEEE Press.
  9. Lima, L., Médard, M., and Barros, J. (2007). Random linear network coding: A free cipher? CoRR, abs/0705.1789.
  10. Menezes, A. J., Vanstone, S. A., and Oorschot, P. C. V. (1996). Handbook of Applied Cryptography. CRC Press, Inc., Boca Raton, FL, USA, 1st edition.
  11. Najeem, M. and Siva Ram Murthy, C. (2011). On enhancing the random linear network coding. In Proceedings of the 2011 17th IEEE International Conference on Networks, ICON 7811, pages 246-251, Washington, DC, USA. IEEE Computer Society.
  12. Noura, H., Martin, S., and Al Agha, K. (2013). A new efficient secure coding scheme for random linear network coding. In Computer Communications and Networks (ICCCN), 2013 22nd International Conference on, pages 1-7.
  13. sang Park, J., Lun, D. S., Soldo, F., Gerla, M., and Macdard, M. (2006). Performance of network coding in ad hoc networks.
  14. yen Robert Li, S., Member, S., Yeung, R. W., and Cai, N. (2003). Linear network coding. IEEE Transactions on Information Theory, 49:371-381.
  15. Zhang, P., Jiang, Y., Lin, C., Fan, Y., and Shen, X. (2010). P-coding: secure network coding against eavesdropping attacks. In Proceedings of the 29th conference on Information communications, INFOCOM'10, pages 2249-2257, Piscataway, NJ, USA. IEEE Press.
Download


Paper Citation


in Harvard Style

Noura H., Martin S. and Al Agha K. (2014). An Efficient Lightweight Security Algorithm for Random Linear Network Coding . In Proceedings of the 11th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2014) ISBN 978-989-758-045-1, pages 171-177. DOI: 10.5220/0005002701710177


in Bibtex Style

@conference{secrypt14,
author={Hassan Noura and Steven Martin and Khaldoun Al Agha},
title={An Efficient Lightweight Security Algorithm for Random Linear Network Coding},
booktitle={Proceedings of the 11th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2014)},
year={2014},
pages={171-177},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005002701710177},
isbn={978-989-758-045-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 11th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2014)
TI - An Efficient Lightweight Security Algorithm for Random Linear Network Coding
SN - 978-989-758-045-1
AU - Noura H.
AU - Martin S.
AU - Al Agha K.
PY - 2014
SP - 171
EP - 177
DO - 10.5220/0005002701710177