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

计算机工程 ›› 2012, Vol. 38 ›› Issue (17): 139-141. doi: 10.3969/j.issn.1000-3428.2012.17.039

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

基于身份不可授权的强指定验证者签名方案

李 聪,闫德勤   

  1. (辽宁师范大学计算机与信息技术学院,辽宁 大连 116081)
  • 收稿日期:2011-10-21 修回日期:2011-12-12 出版日期:2012-09-05 发布日期:2012-09-03
  • 作者简介:李 聪(1986-),男,硕士研究生、CCF会员,主研方向:密码学;闫德勤,教授、博士
  • 基金资助:
    中国科学院自动化研究所复杂系统与智能科学重点实验室开放课题基金资助项目(20070101);辽宁省教育厅高等学校科学研究基金资助项目(2008334)

Strong Designated Verifier Signature Scheme Based on Identity Non-delegatability

LI Cong, YAN De-qin   

  1. (School of Computer Science and Information Technology, Liaoning Normal University, Dalian 116081, China)
  • Received:2011-10-21 Revised:2011-12-12 Online:2012-09-05 Published:2012-09-03

摘要: 针对目前基于身份的强指定验证者签名方案可授权及效率不高的问题,提出一种基于身份的强指定验证者签名方案。对基于双线性对的签名方案进行安全性证明以及效率分析。性能分析结果证明,与已有方案相比,该方案满足不可传递性、不可伪造性及不可授权性,双线性对运算和模乘运算相应减少,签名效率更高。

关键词: 不可授权性, 双线性对, 基于身份, 不可伪造性, 不可传递性

Abstract: Aiming at the delegatability and inefficiency problems of current identity-based strong designated verifier signature schemes, a new efficient identity-based strong designated verifier signature scheme is proposed, which includes signature scheme based on bilinear pairings, security proof and efficiency analysis, performance analysis results show that the new scheme can satisfy the security requirements of non-transferability, unforgetability, non-delegatability. Compared with other existing schemes, the new scheme which reduces the computational cost of bilinear pairings and modular multiplication is more efficient.

Key words: non-delegatability, bilinear parings, ID-based, unforgetability, non-transferability

中图分类号: