期刊文献+

ACJT群签名方案中成员撤消的高效实现 被引量:17

An Efficient Revocation Algorithm in ACJT Group Signature
下载PDF
导出
摘要 成员撤消问题是设计群签名方案中的一个难题,到目前为止尚无满意的解决办法.在ACJT群签名方案的基础上,提出了新的成员撤消方法.在新方案中,管理员在撤消一个成员时仅需要一次乘法运算来更新群公钥,签名和验证算法的计算量均独立于目前群成员个数和被撤消的成员个数,因而算法是高效的.以前的具有撤消成员功能的群签名方案,签名和验证算法的计算量要么依赖当前的群成员个数,要么依赖被撤消的群成员个数,而且群公钥的更新或者成员密钥的更新往往需要多次指数运算. The problem of secure and efficient revocation of membership without incurring big costs has been considered, but no satisfactory solution was reported. This paper proposes a new revocation method of membership based on the ACJT group scheme. The solution is efficient in that it only needs one multiplication to update the public key for the group manager to exclude one group member, and the signing and verifying procedure is independent of the number of the current and excluded group members. To the best of our knowledge, the signing and verifying procedure in the existing revocation schemes is dependent on the number of either the current or the excluded group members, and thus the group manager needs a heavy computation load to update the public key.
出处 《软件学报》 EI CSCD 北大核心 2005年第1期151-157,共7页 Journal of Software
基金 国家自然科学基金 广东省自然科学基金~~
关键词 撤消 个数 成员 计算量 乘法运算 难题 方案 群签名 公钥 验证算法 group signature revocation ACJT scheme co-prime zero-knowledge proof
  • 相关文献

参考文献16

  • 1Lysyanskaya A, Ramzan Z. Group blind digital signatures: A scalable solution to electronic cash. In: Financial Cryptography (FC'98). LNCS 1465, Heidelberg: Springer-Verlag, 1998.184-197.
  • 2Nakanishi T, Fujiwara T, Watanabe H. A linkable group signature and its application to a fair secret voting. Trans IPS Japan, 1999,40(7):3085-3096.
  • 3Bresson E, Stern J. Efficient revocation in group signature. In: Proc of the PKC'01. LNCS 1992, Heidelberg: Springer-Verlag,2001. 190-206.
  • 4Camenish J, Stadler M. Efficient group signatures for large groups. In: Proc. of the CRYPTO'97. LNCS 1296, Heidelberg: Springer-Verlag, 1997.410-424.
  • 5Song D. Practical forward secure group signature schemes. In: Proc. of the 8th ACM Conf. on Computer and Communication Security (CCS 2001). ACM, 2001. 225-234.
  • 6Ateniese G, Camenisch J, Joye M, Tsudik G. A practical and provably secure coalition-resistant group signature scheme. In: Advances in Cryptulogy- CRYPTO 2000. LNCS 1880, Heidelberg: Springer-Verlag, 2000. 255-270.
  • 7Ateniese G, Tsudik G. Quasi-Efficient revocation of group signature. 2001. http://eprint.iacr.org/2001/101 /.
  • 8Kim H J, Lim JI, Lee DH. Efficient and secure member deletion in group signature schemes. In: Won D, ed. Proc of the ICISC 2000. LNCS 2015, Heidelberg: Springer-Verlag, 2001. 150-161.
  • 9Camenisch J, Lysyanskaya A. Dynamic accumulators and application to efficient revocation of anonymous credentials. In: Advances in Cryptology-CRYPTO 02. LNCS 2442, Heidelberg: Springer-Verlag, 2002.61-77.
  • 10Camenisch J, Lysyanskaya A. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In: Advances in Cryptology-EUROCRYPT 01. LNCS 2045, Heidelberg: Springer-Verlag, 2001.93-118.

同被引文献141

引证文献17

二级引证文献38

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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