期刊文献+

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

Threshold RSA signature with linkability for dynamic membership
下载PDF
导出
摘要 在对RSA门限签名方案的研究中,利用双线性函数的性质,实现了签名成员在不需要重新初始化系统的前提下的动态删除。同时,对一个有效的签名,系统通过可连接性实现签名的匿名追踪,并提高追踪的效率。针对实际情况,利用嵌套秘密共享,加入签名的权限功能,实现了文件的签署更有利于权限高的成员,因而更具有实用性。 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.
作者 于静 李志慧
出处 《计算机工程与应用》 CSCD 2013年第10期92-95,共4页 Computer Engineering and Applications
基金 国家自然科学基金(No.11271237)
关键词 RSA签名方案 门限签名 Lagrange插值公式 可连接性 可删除性 RSA digital signature scheme threshold digital signature Lagrange interpolation formula linkability revocation
  • 相关文献

参考文献8

  • 1Desmedt Y, Frankel Y.Shared generation of authenticators and signatures[C]//Lecture Notes in Computer Science:Proc CRYPTO ' 91,1992,576 : 457-469.
  • 2Chen W, Lei F.An efficient multi-sender identity based thresh- old signcryption with public verficability[C]//Proceedings of PDCAT' 07.[S.1.] : IEEE-CS, 2007 : 149-151.
  • 3Li F,Xin X,Hu Y.ID-based signcryption scheme with(t,n) shared unsigncryption[J].Intemational Joumal of Network Se- curity, 2006,3 ( 1 ) : 64-68.
  • 4Wang L,Cao Z,Li X,et al.Simulatability and security of certificateless threshold signatures[J].Information Sciences, 2007,177(6) : 1382-1394.
  • 5Yang B,Yu Y, Li F, et al.Provably secure identity-based threshold unsigneryption scheme[C]//LNCS 4610: Proceedings of ATC'07,2007: 114-122.
  • 6于静,李志慧,张少婷.一个实用的RSA门限签名方案[J].计算机工程与应用,2008,44(24):109-111. 被引量:1
  • 7Xu Q L,Chen T S.An efficient threshold RSA digital signa- ture scheme[J].Applied Mathematics and Computation,2005, 166(1)..25-34.
  • 8Jung Y H, Sokjoon L, Byung H C, et al.Group signatures with controllable linkability for dynamic membership[J].Infor- mation Sciences, Corrected Proof, Available online 13 August 2012.

二级参考文献6

  • 1Desmedt Y,Frankel Y.Shared generation of authenticators and signatures[C]//Lecture Notes in Computer Science:Proc CRYPTO' 91,1992,576:457-469.
  • 2Wang C T,Lin E H,Chang C C.Threshold signature schemes with traceable signers in group communications[J].Computer Communications, 1998,21 (8) :771-776.
  • 3Ham L.Group-oriented(t,n)-threshold digital signature scheme and digital muhi-signature[J].IEEE Proceedings of Computer and Digital Techmiques, 1994,141(5) :307-313.
  • 4Gennaro R,Jarecki S,Krawczyk H,et al.Robust and efficient sharing of RSA functions[C]//Lecture Notes in Computer Science:Proc CRYPTO'96, 1996,1109:157-172.
  • 5Pan C D,Pan C B.Elementary number theory[M].Beijing:Peking University Publishers, 1992.
  • 6Xu Q L,Chen T S.An efficient threshold RSA digital signature scheme[J].Applied Mathematics and Computation, 2005,166 ( 1 ) : 25 -34.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部