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

一种防滥用的可验证承诺签名

A Buse Free Veriably Committed Signature
下载PDF
导出
摘要 利用双线性对构造了一种新的可验证承诺签名方案。该方案可以用来实现著名的BLS签名的公平交换。在Ran-dom Oracle模型和Co-Diffie-Hellman假设下,证明了这种方案的安全性。另外,该方案可以防止非法用户的滥用。它需要一种Diffie-Hellman假设的新变型。 A new verifiably committed signature scheme based bilinear pairing is comstructed. It can be used fairly exchange BLS signatures. Under the random oracle model and Co-diffie-Hellman assumption, its security is proved. Furthermore it is abuse free based on a new type of Diffie-Hellman assumption.
作者 李飞
机构地区 鲁东大学数学与信息学院
出处 《科学技术与工程》 2009年第21期6417-6420,6424,共5页 Science Technology and Engineering
基金 鲁东大学校青年基金资助
关键词 可验证承诺签名 防滥用 公平交换 verifiably committed signature abuse free fair exchange
分类号 TP393.08 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1Bao F , Deng R, Mao W. Efficient and practical fair exchange protocols with off-line TTP. In Proceedings of the IEEE Symposium on Security and Privacy, 1998:77-85.
  • 2Ateniese. G. Efficient verifiable encryption (and fair exchange) of digital signatures. In editor, Tsudik G, Sixth ACM Conference on Computer and Communication Security, 1999:138-146.
  • 3Asokan N, Shoup V , Waidner M. Optimistic fair exchange of digital signatures. Proc of Eurocrypt 98, Springer LNCS 1998; 1403: 591-606.
  • 4Asokan N, Shoup V, Waidner M . Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communication ,2000 ; 18(4) :593--610.
  • 5Dodis Y, Reyzin L, Breaking and repairing optimistic fair exchange from PODC 2003. In : Proc of ACM Workshop on Digital Rights Management ( DRM' 03 ), ACM press, 2003 ;47-54.
  • 6Garay J, Jakobsson M , MacKenzie P. Abuse-free optimistic contract signing. Proc of CRYPTO' 99, Springer LNCS, 1999; 1666: 449-466.
  • 7Boneh D, Lynn B, Shacham H. Short signatures from the weil pairing. Proc of ASIACRYPT 2001, Springer LNCS 2001;2248: 514-532.
  • 8Laguillaumie F, Paillier P, Vergnaud D. Universally Convertible Directed Signatures. Asiaerypt'05, LNCS, Springer-Verlag, 2005 ; 3788:682-701.
  • 9Kudla C J, Paterson K G. Non-interactive designated verifier proofs and undeniable signatures. Proc IMA Conference on Cryptography and Coding, LNCS, Springer-Vedag, 2005 ; 3796 : 136-154.
  • 10李飞,梁华,滕济凯.一种新的基于BLS签名的可验证承诺签名方案(英文)[J].科学技术与工程,2007,7(16):4058-4061. 被引量：1

二级参考文献6

  • 1[1]Bao F,Deng R,Mao W.Efficient and practical fair exchange protocola with off-line TTP.In Proceedings of the IEEE Symposium on Security and Privacy,1998:77-85
  • 2[2]Ateniese G.Efficient verifiable encryption (and fair exchange) of digital signatures.In:Sixth ACM Conference on Computer and Communication Security,ACM,1999:138-146
  • 3[3]Asokan N,Shoup V,Waidner M.Optimistic fair exchange of digital signatures.Proc of EUROCRYPT 98,Springer LNCS Vol.1403,1998:591-606
  • 4[4]Boneh D,Gentry C,Lynn B,et al.Aggregate and verifiably encrypted signatures from bilinear maps.Proc of Eurocrypt 2003,Springer LNCS,2003:2656 ;416-432
  • 5[5]Dodis Y,Reyzin L.Breaking and repairing optimistic fair exchange from PODC 2003.In:Proc of ACM Workshop on Digital Rights Management (DRM03),ACM press,2003:47-54
  • 6[6]Boneh D,Lynn B,Shacham H.Short signatures from the weil pairing.Proc.of ASIACRYPT 2001,Springer LNCS,2001 ;2248 ;514-
科学技术与工程
2009年 第21期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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