期刊文献+

一种基于计算能力的无需可信第三方公平非抵赖信息交换协议 被引量:4

A Fair Non-Repudiation Protocol without TTP Based on Entity′s Computing Power
在线阅读 下载PDF
导出
摘要 随着互联网电子商务等业务的发展,公平非抵赖的信息传送协议(fa ir non-repud ia tion pro toco l)逐渐成为网络安全研究的新热点.现有的一些协议大多建立在可信第三方(tru sted th ird party———TTP)基础之上,协议能否顺利进行主要依赖于TTP,如果TTP受到攻击,那么协议将失效.因此,迫切需要一个无需TTP的公平非抵赖协议.由于已有此类协议在安全性上是不对称的,不能保证发送方的信息安全.本文在分析已有非抵赖协议机制及其安全性的基础上,设计了一种发送方优先的协议,并根据双方的计算能力提出了一种可协商的无需可信第三方的公平非抵赖信息交换协议,使非抵赖信息交换的安全性摆脱了对TTP的依赖,并解决了信息的发送方和接收方的计算能力不对等时而存在的安全问题. With the development of e-commence and other utilities on internet, a new security service fair non-repudiation becomes more important and crucial. But, most current protocols depend on trusted third party( TTP), so a fair non-repudiation protocol without TTP is needed. But the existing fair protocols don't have equal security for message originator and receiver, and they can not assure the security of the message originator. In this paper, a new protocol is designed for the prior security of the originator, and a fair non-repudiation protocol without TTP based on entity computing power is proposed to get rid of the dependence on TTP, to solve the security problems that exist when message originator and receiver's computing power are not equal.
出处 《电子学报》 EI CAS CSCD 北大核心 2006年第3期563-566,共4页 Acta Electronica Sinica
基金 国家自然科学基金(No.60573044) 安徽省自然科学基金(No.050420211)
关键词 公平非抵赖 数字签名 可信第三方 fair non-repudiation digital signature trusted third party
  • 相关文献

参考文献13

  • 1Steve Kreme,Olivier Markowitch,Jianying zhou.An intensive survey of fair non-repudiation protocols[J].Computer Communications,2002,25 (17):1606-1621.
  • 2T Coffey,P Saidha.Non-repudiation with mandatory proof receipt[J].Computer Communication Review,1996,26(1):6-17.
  • 3N Zhang,Q Shi.Achieving non-repudiation of receipt[J].The Computer Journal,1996,39 (10):844-853.
  • 4J Zhou,D Gollmann.A fair non-repudiation protocol[A].IEEE Symposium on Security and Privacy[C].Oakland,California,USA:IEEE Computer Security Press,1996.55 -61.
  • 5Aokan M Schunter,M Waidner.Optimistic protocols for fair exchange[A].T Matsumoto (Ed.).4thCM Conference on Computer and Communications Security[C].Zurich,Switzerland:ACM Press,1997.8-17.
  • 6S Micali.Certified E-mail with invisible post offices[A].RSA 1997 conference[C].Vancouver,BC,Canada,1997.5-16.
  • 7J Zhou,D Gollmann.An efficient non-repudiation protocol[A].Proceedings of 10th Society Press[C].Silver Spring,MD,1997.126-132.
  • 8J Zhou,R Deng,F Bao.Evolution of fair non-repudiation with TTP[A].ACISP:Information Security and Privacy:Australasian Conference,Lecture Notes in Computer Science[C].Springer,Berlin,1999.258-269.
  • 9T Tedrick.How to exchange half a bit[A].D chaum (Ed.).Advances in Cryptology Proceedings of Crypto 83[C].New York:Plenum Press,1983-1984.147-151.
  • 10T Tedrick.Fair exchange of secrets[A].G R B lakley,D C chaum(Ed.).Advances in Cryptology Proceedings of Crypto 84[C].Lecture Notes in Computer Science,1985.434-438.

同被引文献33

  • 1张青,温巧燕.一种新的公平交换协议[J].北京邮电大学学报,2006,29(5):63-65. 被引量:4
  • 2文静华,李祥,张焕国,梁敏,张梅.基于ATL的公平电子商务协议形式化分析[J].电子与信息学报,2007,29(4):901-905. 被引量:7
  • 3Ketchpel S. Transaction protection for information buyers and sellers[C]. Proceedings of the Dartmouth Institute for Advanced Graduate Studies: Electronic Publishing and the Information Superhighway, Boston, USA, May, 1995: 76-83.
  • 4Han S, Chang E, and Dillon T. Secure e-transactions protocol using intelligent mobile agents with fair privacy[J]. Studies in Computational Intelligence, 2007, 37(3): 307-326.
  • 5Oniz C, Savas E, and Levi A. An optimistic fair e-commerce protocol for large e-goods[C]. Proceedings of the Seventh IEEE International Symposium on Computer Networks, USA, June, 16-18, 2006: 214-219.
  • 6Liang Xiao-hui, Cao Zhen-fu, and Lu Rong-xing. Efficient and secure protocol in fair document exchange[J]. Computer Standards & Interlaces, 2008, 30(3): 167-176.
  • 7Almudena A, Juan M, and Izquierdo A. A formal analysis of fairness and non-repudiation in the RSA-CEGD protocol[C]. International Conference on Computational Science and Its Applications, Singapore , May, 2005: 1309-1318.
  • 8Aybek M, Steve K, and Eike R. Analysis of a multi-party fair exchange protocol and formal proof of correctness in the strand space model[C]. International Conference on Financial Cryptography and Data Security, Roseau, February, 2005: 255-269.
  • 9Canetti R. Universally composable security: A new paradigm for cryptographic protocols[C]. In 42th IEEE Annual Symposium on Foundations of Computer Science, Nevada, USA. October, 14-17, 2001: 136-145. (Revised version(2005) vailable at http://eprint.iacr.org/2000/067).
  • 10Yusuke Okada, Yoshifumi Manabe, and Tatsuaki Okamoto. An optimistic fair exchange protocol and its security in the universal composability framework[J]. Int. J. of Applied Cryptography, 2008, 1(1): 70-78.

引证文献4

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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