上海交通大学学报

上海交通大学学报（自然版）

• 自动化技术、计算机技术 • 上一篇    下一篇

无随机预言模型的(t, k, l)-门限代理签名方案

张海1，董晓蕾1，曹珍富1，曹锋2
  

  1. （1.上海交通大学 计算机科学与工程系，　上海 200240；　2.上海立信会计学院 数学与信息学院，　上海　201620）
  • 收稿日期:2008-12-26 修回日期:1900-01-01 出版日期:2010-08-31 发布日期:2010-08-31

(t, k, l)-Threshold Proxy Signature Without Random Oracle

ZHANG Hai1,DONG Xiaolei1,CAO Zhenfu1,CAO Feng2   


  1. (1.Department of Computer Science & Engineering, Shanghai Jiaotong University,
    Shanghai 200240, China; 2.School of Mathematics and Information, Shanghai Lixin University of
    Commerce, Shanghai 201620, China )
  • Received:2008-12-26 Revised:1900-01-01 Online:2010-08-31 Published:2010-08-31

摘要： 推广了(t, l)-门限代理签名概念，提出了(t, k, l)门限代理签名.在一个(t, k, l)门限代理签名中，由指定的l个代理签名者构成的群体必须要求有至少k个人的合作才能生成代理签名，同时方案中最多允许参与的t-1个人合谋.给出了第1个门限代理签名方案存在性不可伪造的安全性模型，提出了一个基于CDH问题的 (t +1,2t +1,l )门限代理签名方案，并且在无随机预言机的模型下证明了该方案是存在性不可伪造的，同时还具有可区分性和代理保护等性质.

关键词: 数字签名, 门限, 代理, 无随机预言模型, 双线性对

Abstract: To generalize the concept of (t,l)threshold proxy signature scheme, this paper proposed a (t, k, l)threshold proxy signature scheme, in which any k or more proxy signers in a designated proxy group of l members can cooperatively issue a proxy signature and this scheme can also tolerate at most t-1 corrupted signers. The security model of existential unforgeability for the threshold proxy signature scheme was presented, then a (t +1, 2t +1, l)threshold proxy signature scheme based on the hardness of CDH problem was proposed, and the existential unforgeability was proved under this security model. At the same time, this scheme has the properties of distinguishability and proxy protected.

中图分类号: