Certificateless network coding scheme from certificateless public auditing protocol

Abstract

AbstractIn recent years, network coding has received extensive attention and has been applied to various computer network systems, since it has been mathematically proven to enhance the network robustness and maximize the network throughput. However, it is well-known that network coding is extremely vulnerable to pollution attacks. Certificateless network coding scheme (CLNS) is a recently proposed mechanism to defend against pollution attacks for network coding, which avoids tedious management of certificates and key-escrow attack. Until now, only a few constructions were presented, and more ones should be given so as to enrich this field. In this paper, for the first time, we study the general construction of CLNS from certificateless public auditing protocol (CL-PAP), although the two areas seem to be quite different in their nature and are studied independently. Since there are many candidates of CL-PAPs, we can naturally obtain abundant constructions of CLNSs according to our systematic way. In addition, in order to show the power of the general construction, we also present a concrete implementation given a specific CL-PAP. The performance analysis and experimental results show that the implemented CLNS is competitive in the existing network coding schemes.