计算机工程
計算機工程
계산궤공정
COMPUTER ENGINEERING
2010年
1期
139-142
,共4页
可验证签密%随机预言机%可证明安全
可驗證籤密%隨機預言機%可證明安全
가험증첨밀%수궤예언궤%가증명안전
verifiable signcryption%random oracle%provable security
在传统的签密方案中,只有接收者能验证其签名的正确性,导致签密不能直接应用于公平交换协议的设计中.针对上述问题,提出一个可验证的签密方案及其形式化安全模型,基于双线性配对设计一个高效的可验证算法,在随机预言机模型下证明该方案的不可伪造性和安全性.
在傳統的籤密方案中,隻有接收者能驗證其籤名的正確性,導緻籤密不能直接應用于公平交換協議的設計中.針對上述問題,提齣一箇可驗證的籤密方案及其形式化安全模型,基于雙線性配對設計一箇高效的可驗證算法,在隨機預言機模型下證明該方案的不可偽造性和安全性.
재전통적첨밀방안중,지유접수자능험증기첨명적정학성,도치첨밀불능직접응용우공평교환협의적설계중.침대상술문제,제출일개가험증적첨밀방안급기형식화안전모형,기우쌍선성배대설계일개고효적가험증산법,재수궤예언궤모형하증명해방안적불가위조성화안전성.
In traditional signcryption scheme, signature can only be verified by the recipient, which implicates that signcryption can not be used to construct fair exchange protocols directly. Aiming at such problem, this paper presents a verifiable signcryption scheme and its security model.Based on bilinear pairs, an efficient verifiable signcryption algorithm is proposed. And the unforgeablity and security of the scheme in the random oracle model is proved.
