Short signature scheme for multi-source network coding |
| |
Authors: | Wenjie Yan Mingxi Yang Layuan LiHuajing Fang |
| |
Affiliation: | a School of Computer Science and Technology, Wuhan University of Technology, Wuhan 430070, China b Dept. of Control Science and Engineering, Huazhong University of Science and Technology, China c Dept. of Planning and Information, SINOPEC Chemical Sales Central China Company, China |
| |
Abstract: | It has been proven that network coding can provide significant benefits to networks. However, network coding is very vulnerable to pollution attacks. In recent years, many schemes have been designed to defend against these attacks, but as far as we know almost all of them are inapplicable for multi-source network coding system. This paper proposed a novel homomorphic signature scheme based on bilinear pairings to stand against pollution attacks for multi-source network coding, which has a broader application background than single-source network coding. Our signatures are publicly verifiable and the public keys are independent of the files so that our scheme can be used to authenticate multiple files without having to update public keys. The signature length of our proposed scheme is as short as the shortest signatures of a single-source network coding. The verification speed of our scheme is faster than those signature schemes based on elliptic curves in the single-source network. |
| |
Keywords: | Multi-source network coding Signature Homomorphic hash function Pollution attacks |
本文献已被 ScienceDirect 等数据库收录! |
|