Title: A publicly verifiable network coding scheme with null-space HMAC

Authors: Yonghui Chen; Cheng Zhang; Wei Li; Tingsong Chen; Mingwu Zhang

Addresses: School of Computer Science, Hubei University of Technology, Wuhan, China; Department of Computer Science and Communications Engineering, Waseda University, Tokyo, Japan ' Department of Computer Science and Communications Engineering, Waseda University, Tokyo, Japan ' Department of Computer Science and Communications Engineering, Waseda University, Tokyo, Japan ' Department of Computer Science and Communications Engineering, Waseda University, Tokyo, Japan ' School of Computer Science, Hubei University of Technology, Wuhan, China

Abstract: The encode-and-forward mechanism of network coding (NC) system, not only could provide increased network throughput, but also might get seriously vulnerable to pollution attacks. It has been an interesting and challenging topic how to design a secure, efficient and publicly verifiable homomorphic NC scheme. The existing cryptography-based NC schemes are grouped in either public key cryptosystem (PKC), or symmetric key cryptosystem (SKC). NC schemes in PKC naturally have public verifiability, but imply much more computation cost and longer operation delay. NC schemes in SKC have cheaper computations cost, but are dilemma about how to share the secret key to those intermediate nodes who might be malicious. Therefore, in this paper, we provide a new NC scheme that based on null-space HMAC with hierarchically sharing keys. The inner sharing keys are for the destination nodes to verify the integrity of the messages; the outer sharing keys are for the intermediate nodes to verify the integrity of the received packets. Our scheme shows a way how to balance the computation efficiency and the public verifiability for the NC system with a SKC scheme.

Keywords: network coding; publicly verifiable; null-space HMAC.

DOI: 10.1504/IJIIDS.2018.092001

International Journal of Intelligent Information and Database Systems, 2018 Vol.11 No.2/3, pp.117 - 131

Available online: 22 May 2018 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article