一种可确认身份的网络编码签名方案

计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (28): 73-76.

一种可确认身份的网络编码签名方案

于志轩，王彩芬，罗海，冯帆

西北师范大学数学与信息科学学院，兰州 730070

收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-10-01 发布日期:2011-10-01

Identified network coding signature scheme

YU Zhixuan，WANG Caifen，LUO Hai，FENG Fan

College of Mathematics and Information Science，Northwest Normal University，Lanzhou 730070，China

Received:1900-01-01 Revised:1900-01-01 Online:2011-10-01 Published:2011-10-01

摘要/Abstract

摘要： 网络编码理论的提出在提高网络吞吐量、构建网络的鲁棒性等方面都有着明显的优势，但是极易受到污染攻击。很多学者提出了使用同态函数的性质来构造安全方案，能够有效地抵抗污染攻击。但是很少能够确定出污染攻击所发生的网络节点。针对确定污染攻击所发生的节点问题，设计出一个基于同态哈希函数的签名方案，能够抵抗污染攻击并有效地确定出攻击所发生的节点位置。

关键词: 网络编码签名, 污染攻击, 身份确认, 同态哈希函数

Abstract: Network coding theory has obvious advantages in throughput promotion and robustness of networks.But it suffers from pollution attacks easily.Many scholars build signatures by using property of homomorphism function.This method can against pollution attacks effectively.But there have few schemes can identify the intermediate nodes which suffer attacks.To solve this problem，it proposes a signature scheme based homomorphism Hash function that can prevent pollution attacks and identify pollution node effectively.

Key words: network coding signature, pollution attacks, identification, homomorphism Hash function

于志轩，王彩芬，罗海，冯帆. 一种可确认身份的网络编码签名方案[J]. 计算机工程与应用, 2011, 47(28): 73-76.

YU Zhixuan，WANG Caifen，LUO Hai，FENG Fan. Identified network coding signature scheme[J]. Computer Engineering and Applications, 2011, 47(28): 73-76.