摘要： 在Zhao的网络编码签名验证方案中，攻击者可以使用合法的消息向量伪造消息，并能通过验证，实施污染攻击。针对该方案存在的漏洞，基于计算性Diffie-Hellman问题的难解性，通过在签名验证公式中增加计算元素 ，使攻击者无法伪造消息，从而抵抗污染攻击，提高方案的安全性。

关键词: 网络编码签名, 污染攻击, 正交向量, 线性子空间, 伪造

Abstract: In Zhao’s network coding signature verification scheme, the adversary can forge the new message by using legitimate messages, which can be verified in verification process, so that pollution attack is successfully conducted. Aiming at the shortcoming in signature and verification process, by adding a computing element in the verification formula, the scheme can prevent attacker forging messages to resist pollution attack and enhance the security of the scheme.

Key words: network coding signature, pollution attack, orthogonal vector, linear subspace, forging

中图分类号: 

• TP391