作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (1): 139-142. doi: 10.3969/j.issn.1000-3428.2010.01.049

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

基于双线性配对的可验证签密方案

黄梦桥 ,李庆国2,马昌社3   

  1. (1. 湖南涉外经济学院商学部,长沙 410205;2. 湖南大学数学与计量经济学院,长沙 410082;3. 华南师范大学计算机学院,广州 510631)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-01-05 发布日期:2010-01-05

Verifiable Signcryption Scheme Based on Bilinear Pairs

HUANG Meng-qiao1, LI Qing-guo2, MA Chang-she3   

  1. (1. Department of Economics, Hunan International Economics University, Changsha 410205; 2. Mathematics and Econometrics College, Hunan University, Changsha 410082; 3. School of Computer, South China Normal University, Guangzhou 510631)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-01-05 Published:2010-01-05

摘要: 在传统的签密方案中,只有接收者能验证其签名的正确性,导致签密不能直接应用于公平交换协议的设计中。针对上述问题,提出一个可验证的签密方案及其形式化安全模型,基于双线性配对设计一个高效的可验证算法,在随机预言机模型下证明该方案的不可伪造性和安全性。

关键词: 可验证签密, 随机预言机, 可证明安全

Abstract: 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.

Key words: verifiable signcryption, random oracle, provable security

中图分类号: