检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]电子科技大学计算机学院,四川成都610054
出 处:《电子学报》2008年第10期1869-1872,1890,共5页Acta Electronica Sinica
基 金:现代通信国家重点实验室基金(No.9140C1107010604);华为公司科技基金(No.YJCB2006053DC);计算机网络与信息安全教育部重点实验室基金
摘 要:2002年,Boneh和Silverberg提出了多线性表理论和基于多线性表的多方Diffe-Hellman密钥交换协议,H.K.Lee等人在该协议基础上利用证书对参与者进行身份认证,解决了该协议容易遭受中间人攻击的问题,H.M.Lee等人进一步引入基于身份的公钥密码技术替代数字证书,提高了密钥协商的效率,形成了ID-MAK协议.在本文中,我们对ID-MAK协议进行了安全性分析,发现ID-MAK协议没有真正实现它所宣称的身份认证,不能抵御主动攻击,敌手可冒充任意合法成员参与到密钥协商中获取组密钥.本文在计算多线性D-H问题假设下提出了两个ID-MAK协议改进方案,两个改进协议只需一轮即可协商一个组密钥,本文还给出了相应的成员动态变化和组密钥更新协议.本文最后对我们改进的协议进行了安全性分析.In 2002,Boneh and Silverberg presented theory of multilinear forms and a multi-party Diffe-Hellman key agreement protocol using mulfilinear forms. H.K.Lee et al adopted certificates to authenticate group members and protect against middleman attacks in this protocol. Subsequently,H.M.Lee et al deployed ID-base public keys other than certificates in the MAK protocol, and presented the ID-MAK protocol. Owing to simplicity of ID-base public keys,the ID-MAK Protocol is more effficient. In this paper, we analyze the security of the ID-MAK protocol, and have found that the ID-MAK protocol doesn' t really authenticate group members as claimed. Thus it cannot resist active attacks, and an adversary can pretend to be a legal member to obtain the group key. Based on the computational multilinear Diffe-Hellrnan assumption, we present two improved schemes to the ID-MAK protocol to remove this security defect. Both our improved protocols need only one round agreement. They support dynamic member change and key refresh. Our security analysis shows that they are secure.
分 类 号:TN914[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.191