计算机工程 ›› 2014, Vol. 40 ›› Issue (12): 121-125.doi: 10.3969/j.issn.1000-3428.2014.12.022

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

基于椭圆曲线的门限共享解签密改进方案

周宣武1,2,刘开华1,金志刚1,古俊科2,李欣2,付燕1,3   

  1. 1.天津大学电子信息工程学院,天津 300072; 2.武警指挥学院,天津 300250;
    3.烟台保税港区综合服务中心,山东 烟台 265400
  • 收稿日期:2014-01-09 修回日期:2014-03-04 出版日期:2014-12-15 发布日期:2015-01-16
  • 作者简介:周宣武(1980-),男,博士后,主研方向:密码学,可信计算;刘开华、金志刚,教授、博士生导师;古俊科,高级工程师;李 欣,教授;付 燕,博士。

Improved Threshold Shared Unsigncryption Scheme Based on Elliptic Curve

ZHOU Xuanwu1,2,LIU Kaihua1,JIN Zhigang1,GU Junke2,LI Xin2,FU Yan1,3   

  1. 1.School of Electronics and Information Engineering,Tianjin University,Tianjin 300072,China;
    2.Command College of the Chinese Armed Police Forces,Tianjin 300250,China;
    3.Administrative Center of Yantai Trade-free Port,Yantai 265400,China
  • Received:2014-01-09 Revised:2014-03-04 Online:2014-12-15 Published:2015-01-16

摘要: 针对陈瑞虎等人提出的门限共享验证签密方案(微计算机信息,2005年第11期),给出针对该方案的攻击算法。基于椭圆曲线提出一种改进的前向安全门限共享解签密方案,证明方案的机密性、不可伪造性与不可否认性。该方案具有门限完备性、抗合谋攻击等安全特性,并且当签密密钥泄漏时,攻击者无法得到对称密钥恢复明文,也无法从之前的签密密文中获得秘密信息,具有签密的前向安全性。分析结果表明,改进方案的整体运算量及签密密文长度小于陈瑞虎等人提出的方案,门限解签密算法的运算及通信效率得到明显提高。

关键词: 门限解签密, Gost数字签名, 前向安全性, 门限完备性, 合谋攻击, 效率分析

Abstract: This paper analyzes the threshold signcryption scheme of Chen et al (Microcomputer Information,2005,No.11),and proposes its attack algorithm.Then it presents an efficient threshold unsigncryption scheme with forward security based on elliptic curve and analyzes the confidentiality,unforgeability,non-repudiation and additional properties of the scheme,including perfect secret sharing,coalition attack resistance and forward security.Analysis result shows that the improved threshold unsigncryption scheme achieves high efficiency regarding practical application with its much lower cost of computation and communication and shorter signcryption text than the scheme by Chen et al.

Key words: threshold unsigncryption, Gost digital signature, forward security, threshold completeness, coalition attack, efficiency analysis

中图分类号: