期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种门限可追踪的匿名签密方案

AThreshold Traceable Anonymous Signcryption Scheme
下载PDF
导出
摘要 为解决匿名签密算法中签密者身份的追踪问题,提出了一种门限可追踪的匿名签密方案。该方案借助范德蒙行列式生成成员的公钥和私钥,通过在匿名签密过程中附加一些与签密者身份相关的额外信息,实现签密者身份的门限追踪。在不可分模型下,证明了该方案满足匿名性、门限可追踪性、不可伪造性和不相关性。 A new threshold traceable anonymous signcryption scheme was presented to solve the problem of tracking the signcrypter;s identity in the anonymous signcryption scheme. The member＇s private key and public key could be obtained with the help of the theory of vandermonde determinant, some additional in- formation related to the identity of the signcrypter was attached in the anonymous signcryption process, which could achieve threshold trace. The scheme proved to satisfy anonymity, threshold traceability, unforgeability and irrelevance in the non-separable model.
作者 殷凤梅 濮光宁 侯整风
机构地区 合肥师范学院公共计算机教学部 安徽财贸职业学院雪岩贸易学院 合肥工业大学计算机与信息学院
出处 《常州大学学报（自然科学版）》 CAS 2015年第2期68-71,共4页 Journal of Changzhou University：Natural Science Edition
基金 安徽省高等学校省级优秀青年人才基金重点项目(2013SQRL063ZD) 安徽省高等学校省级质量工程教学研究项目(2013jyxm174)
关键词 签密 追踪性 门限性 1/n签名 范德蒙行列式 sign-cryption traceability threshold 1 out of n signatures vandermonde determinant
分类号 TP309.7 [自动化与计算机技术—计算机系统结构]
  • 相关文献

参考文献10

  • 1Zheng Y. Digital signcryption or how to achieve cost (signature encryption)<< cost (signature)q- cost (encryption)[M]//Ad- vances in Cryptology- CRYPTO'97. Berlin: Springer-Verlag, 1997:165-179.
  • 2Zheng Y. Signcryption and its applications in efficient public key solutions[M]//Information Security. Berlin: Springer- Verlag, 1998,291-312.
  • 3Baek J, Steinfeld R, Zheng Y. Formal proofs for the security of signcryption[C]//PKC 2002. Berlin: Springer-Verlag, 2002: 80- 98.
  • 4Chaum D, Heyst V E. Group Signatures[C]//Proceedings of Eu- rcrypt'91. Berlin : Springer-Verlag, 1991 : 257-265.
  • 5Camenisch J, Stadler M. Efficient group signature schemes for large groups[M]//Advances in Cryptology-Crypto' 97. Berlin.. Springer-Verlag, 1997:410-424.
  • 6Rivest R L, Shamir A,Tauman Y. How to leak a secret [A]. Proc of Asiacrypt' 01 [C]. Berlin: Springer- Verlag, 2001 : 552- 565.
  • 7Abe M,Ohkubo M,Suzuki K. 1-out-of-n signatures from a varie- ty of keys[A]. Proc of Asiacrypt'02 [C]. Berlin: Springer- Ver- 1ag,2002:415 - 423.
  • 8王继林,毛剑,王育民.一个无条件匿名的签密算法[J].电子与信息学报,2004,26(3):435-439. 被引量：5
  • 9孙庆英,吴克力,徐会艳.一种可追踪签名者的环签密方案[J].计算机工程,2011,37(16):129-131. 被引量：6
  • 10吴春英,李顺东.高效的强(n,t,n)可验证秘密共享方案[J].计算机科学,2013,40(9):130-132. 被引量：2

二级参考文献23

  • 1[1]Chaum D, Van Heyst E. Group signatures. In D. W. Davies, editor, Proc. of Eurocrypt'91,LNCS, Springer-Verlag, 1992, vol.547: 257-265.
  • 2[2]Camenisch J, Stadler M. Efficient group signature schemes for large groups. In Advances in Cryptology-CRYPTO'97, LNCS, Springer-Verlag, 1997, vol.1296: 410-424.
  • 3[3].Cramer R, Damgard I, Schoenmakers B. Proofs of partial knowledge and simplified design of witness hiding protocols. In Y. G. Desmedt, editor, CRYPTO'94, LNCS, Springer-Verlag, 1994,vol.839: 174-187.
  • 4[4]Abe M, Ohkubo M, Suzuki K. 1-out-of-n signatures from a variety of keys. Asiacrypt'2002, LNCS,Berlin, Heidelberg, Springer-Verlag, 2002, vol.2501: 415-423.
  • 5[5]Rivest R L, Shamir A, Tauman Y. How to leak a secret. In C. Boyd, editor, in Proc. of Asiacrypt'01, LNCS, Springer-Verlag, 2001, vol.2248: 552-565.
  • 6[6]Bresson, Stern, Szydlo. Threshold ring signatures for ad-hoc groups. Cryptology'2002, LNCS,Berlin Heidelberg, Springer-Verlag, 2002, vol.2442: 465-480.
  • 7[7]Fangguo Zhang, Kwangjo Kim. ID-Based blind signature and ring signature from pairings. Asiacrypt'2002, LNCS, Berlin Heidelberg Springer-Verla, 2002, vol.2501: 533-547.
  • 8[8]Zheng Y. Digital signcryption or how to achieve cost(signature and encryption) ＜＜cost(signature)+cost(encryption). B. Kaliski(Ed), Advances in Cryptology, in Proceedings Crypto'97, LNCS, Springer-Verlag, 1997, vol.1294: 165-179.
  • 9[9]Zheng Y. Signcryption and its application in efficient public key solutions, in Proc. of Information Security Workshop(ISW'97), LNCS, Springer-Verlag, 1998, vol.1396: 291-312.
  • 10Shamir A.How to share a secret[J].Communications of theACM,1979,22(11):612-613.

共引文献10

常州大学学报（自然科学版）
2015年 第2期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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