Computer Engineering and Applications ›› 2013, Vol. 49 ›› Issue (10): 92-95.

Previous Articles     Next Articles

Threshold RSA signature with linkability for dynamic membership

YU Jing1, LI Zhihui2   

  1. 1.Basic Teaching Department of Mathematic North Institute of Information Engineering, Xi’an Technological University, Xi’an 710025, China
    2.College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China
  • Online:2013-05-15 Published:2013-05-14

动态可连接的RSA门限签名方案

于  静1,李志慧2   

  1. 1.西安工业大学 北方信息工程学院基础部数学教研室,西安 710025
    2.陕西师范大学 数学与信息科学学院,西安 710062

Abstract: In the study of threshold RSA digital signature scheme, bilinear maps are used to realize the  dynamically deletion, in which we do not need to bother re-initialize the system when deleting the signing members. Meanwhile, the system, with its likability can perform anonymous tracking to promote its efficiency. To deal with those special occasions also allows nesting secret sharing to add limited accesses, which proves to be conducive to the privileged members.

Key words: RSA digital signature scheme, threshold digital signature, Lagrange interpolation formula, linkability, revocation

摘要: 在对RSA门限签名方案的研究中,利用双线性函数的性质,实现了签名成员在不需要重新初始化系统的前提下的动态删除。同时,对一个有效的签名,系统通过可连接性实现签名的匿名追踪,并提高追踪的效率。针对实际情况,利用嵌套秘密共享,加入签名的权限功能,实现了文件的签署更有利于权限高的成员,因而更具有实用性。

关键词: RSA签名方案, 门限签名, Lagrange插值公式, 可连接性, 可删除性