摘要
签密方案可以在一个逻辑步骤内同时实现签名和加密,可以用于设计紧凑的安全协议。分析了Wang的组可验证签密方案,指出其存在冗余数据和计算,对其进行改进设计出了新的组可验证签密方案。基于新签密方案,提出一种一对多的秘密传输协议。新方案通过3个步骤保证消息的完整性和内容的正确性,具有保密性、公平性与非否认性;同时新方案具有更低的计算量和通信量。
Signcryption provides confidentiality and authenticity efficiently, and it can be used to design compact communication protocol. This paper analyzed the domain-verifiable slgncryption which Wang proposed, and pointed out the redundant data and computation in his scheme. This paper advanced Wang＇s scheme and designed a new domain-verifiable signcryption scheme. Based on the signcryption scheme, this paper proposed a new secret transferring protocol. The new scheme provides integrity of ciphertext and correctness of plaintext by 3 steps, and it keeps confidentiality, fairness and nonrepudiation. Meanwhile, performance analysis shows that the new scheme is more efficient.
出处
《计算机应用》
CSCD
北大核心
2007年第9期2180-2183,共4页
journal of Computer Applications
基金
国家自然科学基金资助项目(60403027)
关键词
签密
秘密传输协议
非否认性
signcryption
secret transferring protocol
non-repudiation
