An Improved ID-Based Multi-Prozy Multi-Signcryption Scheme

摘要：

In 2007, Sunder Lai and Tej Singh gave an ID-based multi-proxy multi-signeryption scheme. By analysis, we discover that Sunder Lai and Tej Singhs scheme wrongly used two types of undefined bilinear pairing calculations, which caused that the calculation of Lai and Tej Singhs scheme is unfeasible. Against the error, we give an improved scheme. To avoid of using these undefined calculations and make it feasible, the improved scheme takes use of a more Hash function. At last, the security of the improved scheme is analyzed.

关键词： signcryption ID-basedcryptography multi-prozy

作者: Zhou Xiaoyan Wu Yan Du Weifeng Gao Yan

作者单位: Jiaozuo University Jiaozuo, China College of Computer Science &Technology Henan Polytechnic University Jiaozuo, China School of Mathematics & Information Engineering Jiaxing University Jiaxing, China College of Maths Southwest Jiaotong University Chengdu, China

会议类型: 国际会议

会议名称: Second International Symposium on Electronic Commerce and Security(第二届电子商务与安全国际研究大会)(ISECS 2009)

会议地点: 南昌

会议语种:英文

页码: 466-469

在线出版日期: 2009-05-22（万方平台首次上网日期，不代表论文的发表时间）