期刊文献+

新的公平数字签名交换方案

New scheme of fair exchange of digital signatures
下载PDF
导出
摘要 基于Gorantla等最近提出的标准模型下可证安全的可验证加密签名,提出了一个优化的公平数字签名交换方案。签名交换双方首先交换他们的可验证加密签名,验证通过以后再交换他们的真实签名,如果其中一方不能诚实地执行协议,则另一方可求助可信任第三方以达到公平交换的目的。提出的方案具有签名长度短、计算量小等优点,可以公平且有效地实现数字签名的交换。 Based on the verifiably encrypted signature scheme without random oracles recently proposed by Goranfla et al.,a new scheme of optimistic fair exchange of digital signatures is proposed in this paper.The two players firstly exchange their verifiably encrypted signature on agreed-upon messages then their ordinary signature after the verification of each other's verifiably encrypted signature.If one of them executes the protocol dishonestly,the other can resort to a trusted third party so as to get the purpose of fair exchange of signatures.The proposed scheme has properties of short signature,low computation and verification cost.It can realize exchange of digital signatures fairly and efficiently.
作者 马小姝 尚云
出处 《计算机工程与应用》 CSCD 北大核心 2008年第16期98-99,131,共3页 Computer Engineering and Applications
基金 国家自然科学基金(the National Natural Science Foundation of China under Grant No.60573043)
关键词 公平交换 数字签名 可验证加密签名 fair exchange digital signature verifiably encrypted signature
  • 相关文献

参考文献8

  • 1Asokan N,Shoup V,Waidner M.Optimistic fair exchange of digital signatures[C]//LNCS 1403 : Proceedings of Eurocrypt' 98.Berlin : Springer-Verlag, 1998 : 591-606.
  • 2Atenise G.Efficient verifiable eneryption of digital signature[C]// Proceedings of Sixth ACM Conference on Computer and Communication Security, Singapore, 1999:138-146.
  • 3Boneh D,Gentry C.Aggregate and verifiably encrypted signature from bilinear maps[C]//LNCS 2656:Proceedings of Eurocrypt03. Berlin: Springer-Verlag, 2003 : 614-629.
  • 4李梦东,杨义先,马春光,蔡满春.利用双线性聚集签名实现公平的签名交换方案[J].通信学报,2004,25(12):59-64. 被引量:7
  • 5Boneh D,Lynn B,Shacham H.Short signatures from the Weil pairings[C]//LNCS 2248:Proceedings of Asiacrypt 2001.Berlin:Springer- Verlag, 2001:514-532.
  • 6Bellare M, Rogaway P.Random oracles are praetieal:a paradigm for designing efficient protocols[C]//The First ACM Conference on Computer and Communications Security, ACM, 1993 : 62-73.
  • 7Goranfla M C,Saxena A.Verifiably encrypted signature scheme without random oraeles[C]//LNCS 3816:Proceedings of Second International Conference, 2005.Berlin: Springer-Verlag, 2005: 357-363.
  • 8Boneh D,Boyen X.Short signature without random oracles[C]//LNCS 3027 : Proceedings of Eurocrypt ' 04.Berlin : Springer-Verlag, 2004: 56-73.

二级参考文献9

  • 1ASOKAN N, SHOUP V, WAIDNER M. Optimistic fair exchange of digital signatures[A]. Proceedings of Eurocrypt'98[C].Springer-Verlag, 1998.
  • 2ATENISE G. Efficient verifiable encryption (and fair exchange) of digital signatures[A]. Proceedings of Sixth ACM Conference on Computer and Communications Security[C]. Singapore, 1999. 138-146.
  • 3BONEH D, GENTRY C. Aggregate and verifiably encrypted signatures from bilinear maps[A]. Proceedings of Eurocrypt 2003[C].Springer-Verlag, 2003.614-629.
  • 4BONEH D, LYNN B, SHACHAM H. Short signatures from the weil pairing[A]. Proceedings of Asiacrypt 2001[C]. Springer-Verlag,2001. 514-532.
  • 5GARAY J, JAKOBSSON M, MACKENZIE P. Abuse-free optimistic contract signing[A]. Proceedings of Crypto '99[C]. Springer-Verlag,2000. 449-466.
  • 6CAMINISCH J, SHOUP V. Practice verifiable encryption and decryption of discrete logarithms[A]. Proceedings of Crypto2003[C].Springer-Verlag, 2003.
  • 7BANRETO P, KIM H, LYNN B, et al. Efficient algorithm for pairing-based cryptosystems[A]. Crypto 2002[C]. Berlin, 2002.354-368.
  • 8蒋晓宁,叶澄清,潘雪增.基于半可信离线第三方的公平交易协议[J].计算机研究与发展,2001,38(4):502-508. 被引量:14
  • 9邓所云,詹榜华,胡正名,杨义先.一个优化的公平的电子支付方案[J].计算机学报,2002,25(10):1094-1098. 被引量:10

共引文献6

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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