摘要: 对王之仓等人提出的自认证多接收者签密方案(微电子学与计算机,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
中图分类号:
吴凡, 徐丽丽. 一种改进的自认证多接收者签密方案[J]. 计算机工程, 2012, 38(23): 143-145.
TUN Fan, XU Li-Li. An Improved Self-certified Multi-receiver Signcryption Scheme[J]. Computer Engineering, 2012, 38(23): 143-145.