摘要
提出了一种高效的无随机预言机的可验证加密签名方案.该方案使用近来出现的Gentry签名进行构造,并在标准模型下严格证明其安全性.与同类方案相比,该方案构造简单,有较短的公钥尺寸、较低的计算代价以及较紧的安全归约.它是一个真正实践的无随机预言机的可验证加密签名方案,可以用于实际的在线合同签署协议.此外,方案的证明依赖于强Diffie-Hellman假设,也有其独立的价值.
This paper proposes an efficient verifiably encrypted signature scheme without random oracles. The scheme is constructed from the reeent Gentry signature and can be rigorously proven to be secure in the standard model. The scheme has several advantages over previous systems such as, shorter public keys, lower computation overhead, and a tighter seeurity reduction, therefore, it is a truly practical verifiably encrypted signature without random oracles, which can be used in online contract signing protocols. Additionally, the proof of our scheme, which depends on the Strong Diffie-Hellman assumption, may be of independent interest.
出处
《软件学报》
EI
CSCD
北大核心
2009年第4期1069-1076,共8页
Journal of Software
基金
Supported by the National Natural Science Foundation of China under Grant No.60673075
the Doctoral Program Foundation of Chinese Ministry of Education under Grant No.20050614018~~
关键词
数字签名
可验证加密签名
可证明安全
随机预言机模型
digital signature
verifiably encrypted signature
provable security
random oracle model
