• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (12): 56-59.

• 论文 • 上一篇    下一篇

多重代理多重盲签名方案

王琳杰1,韩春霞1,张秉儒2   

  1. (1.铜仁学院数学与计算机科学系,贵州 铜仁 554300;
    2.青海师范大学数学与信息科学系,青海 西宁 810008)
  • 收稿日期:2011-03-29 修回日期:2012-04-01 出版日期:2012-12-25 发布日期:2012-12-25
  • 基金资助:

    贵州省科学技术基金资助项目(20122316);铜仁市科技计划项目(20126320)

MultiProxy Blind MultiSignature Scheme

WANG Linjie1,HAN Chunxia1,ZHANG Bingru2   

  1. (1.Department of Mathematics and Computer Science,Tongren University,Tongren 554300;
    2.Department of Mathematics,Qinghai Normal University,Xining 810008,China)
  • Received:2011-03-29 Revised:2012-04-01 Online:2012-12-25 Published:2012-12-25

摘要:

多重代理多重盲签名方案综合了多重代理多重签名方案和盲签名方案的优点,它是由一组原始签名人授权给一组代理签名人,并且这组代理签名人并不知道消息的具体内容。基于离散对数问题提出广播多重代理多重盲签名方案和有序多重代理多重盲签名方案,通过对其安全性分析,两类方案均满足多重代理多重签名的安全性及盲签名的盲性和不可链接性。

关键词: 离散对数, 多重代理多重盲签名, 不可伪造性, 不可链接性

Abstract:

Multiproxy blind multisignature satisfies the security properties of both the multiproxy multisignature and blind signature. It permits that a group of original signers authorize a group of proxy signers who have no idea about the concrete content of the message. Based on DLP, a new broadcasting multiproxy blind multisignature and a new sequential multiproxy blind multisignature are proposed. Security of the new schemes is analyzed. Both of them satisfy the security requirement of the multiproxy multisignature scheme and the unforgeability and blindness for the blind signature.

Key words: discrete logarithm problem;multiproxy blind multisignature;unforgeability;unlinkability