关键词: 双源网络编码, 哈希函数, 双线性对, 编码系数, 离散对数

Abstract: Networks coding is highly susceptible to pollution attacks，but such attacks cannot be prevented by the standard technology of signature. Based on the vector hash which is secure if the discrete logarithm problem is infeasible，an efficient signature scheme for securing two-source networks coding against pollution attacks was proposed. In this scheme, each source node signed the files with its own private key, the intermediate nodes, with the merge algorithm, produced linear combinations of vectors from different files. The intermediate nodes could verify the received signature solely by the public key. The security of signature scheme relies on the hardness of the Co-Deffie-Hellman problem. Under the random oracle model, the new scheme is proved to be secure against the source nodes and intermediate nodes attacks.

Key words: two-source network coding, Hash function, bilinear pairing, coding coefficient, discrete logarithm