计算机工程 ›› 2012, Vol. 38 ›› Issue (23): 143-145.doi: 10.3969/j.issn.1000-3428.2012.23.035

• 安全技术 • 上一篇    下一篇

一种改进的自认证多接收者签密方案

吴 凡1,徐丽丽2   

  1. (1. 华侨大学厦门工学院计算机科学与工程系,福建 厦门 361021;2. 厦门大学信息科学与技术学院,福建 厦门 361005)
  • 收稿日期:2012-02-15 出版日期:2012-12-05 发布日期:2012-12-03
  • 作者简介:吴 凡(1981-),男,讲师、硕士,主研方向:信息安全;徐丽丽,工程师、硕士

An Improved Self-certified Multi-receiver Signcryption Scheme

WU Fan 1, XU Li-li 2   

  1. (1. Department of Computer Science and Engineering, Xiamen Institute of Technology, Huaqiao University, Xiamen 361021, China; 2. School of Information Science and Engineering, Xiamen University, Xiamen 361005, China)
  • Received:2012-02-15 Online:2012-12-05 Published:2012-12-03

摘要: 对王之仓等人提出的自认证多接收者签密方案(微电子学与计算机,2010年第11期)进行分析,指出攻击者可以利用公开的信息伪造合法的新消息,因此不具有不可伪造性,并基于有限域上离散对数问题的难解性,通过在会话加密过程中加入发送者的私有数据,提出一种改进方案。理论分析结果证明,改进方案能抵抗伪造攻击,具有不可否认性和保密性。

关键词: 自认证, 多接收者签密, 有限域, 离散对数问题, 冒充攻击, 不可否认性, 保密性

Abstract: This paper analyzes the self-certified multi-receiver signcryption scheme proposed by Wang Zhicang et al, and points out that attackers can forge new legal messages by public information, so that their scheme does not have the characteristic of unforgeability. Based on the discrete logarithm problem in finite field, this paper proposes an improved scheme by inserting the sender’s private data into the encrypted session. Analysis result proves that the improved scheme can resist forgery attack, and has the characteristics of non-repudiation and confidentiality.

Key words: self-certified, multi-receiver signcryption, finite field, discrete logarithm problem, forgery attack, non-repudiation, confidentiality

中图分类号: