期刊文献+

基于博弈的电子商务协议分析 被引量:6

Formal analysis of e-commerce protocols based on game
下载PDF
导出
摘要 提出用一种新的基于博弈的逻辑方法分析电子商务协议,克服了传统时序逻辑把协议看成封闭系统进行分析的缺点。新方法可以成功地对电子商务中的对抗与合作行为进行描述,能够分析协议的保密性、安全性、非否认性及公平性等。最后用新方法对Zhou-Gollmann协议进行了严格的形式化分析。结果表明基于博弈的ATL逻辑比传统的基于计算树逻辑(CTL)更适合于描述和分析复杂电子商务协议。 A new logical method based on game to analyze e-commerce protocols was proposed, the shortcoming of traditional temporal logic that regards protocols as close system to analyze had been overcame. The adversarial and collaboration in electronic commerce could be described correctly by the new method, and the privacy, security, non-repudiation, fairness could be analyzed. In the end, strict formal analysis for Zbeu-Gollmann protocol was made by the new method. These works indicate that the alternating-time temporal logic (ATL) logic based on game is more suitable to describe and analyze complex e-commerce protocols than traditional CTL.
出处 《通信学报》 EI CSCD 北大核心 2006年第3期73-78,共6页 Journal on Communications
基金 贵州省科学技术基金资助项目(20052111) 贵州省教育厅自然科学基金资助项目(2004219)~~
关键词 电子商务协议 安全性 公平性 ATL e-commerce protocols security fairness ATL
  • 相关文献

参考文献13

  • 1ASOKAN N.Fairness in Electronic Commerce[D].University of Waterloo,1998.
  • 2SCHUNTER M.Optimistic Fair Exchange[D].Technische Fakultat der Universit at des Saarlandes,Saar brucken,2000.
  • 3SHMATIKOV V,MITCHELL J C.Finite-state analysis of two contract signing protocols[J].Theoretical Computer Science (TCS),Special Issue on Theoretical Foundations of Security Analysis and Design,2002,283(2):419-450.
  • 4MAHIMKAR A,SHMATIKOV V.Game-based analysis of denial-of-service prevention protocols[A].18th IEEE Computer Security Foundations Workshop (CSFW)[C].Aix-en-Provence,France,2005.151-166.
  • 5EMERSON E A.Temporal and modal logic[A].Handbook of Theoretical Computer Science,Vol B:Formal Models and Semantics[C].1990.995-1072.
  • 6LOWE G.Breaking and fixing the needham-schroeder public-key protocol using FDR[A].Proc of TSCAS'96[C].Berlin:Springer Verlag,1996.147-166.
  • 7CLARKE E M,EMERSON E A.Design and synthesis of synchronization skeletons using branching time temporal logic[A].Logic of Programs,Volume 131 of Lecture Notes in Computer Science[C].Springer-Verlag,1981.52-71.
  • 8ALUR R,HENZINGER T A,KUPFERMAN O.Alternating-time temporal logic[A].38th Annual Symposium on Foundations of Computer Science[C].1997.100-109.
  • 9ALUR R,HENZINGER T A,MANG F,et al.MOCHA:modularity in model checking[A].Proc CAV'98[C].Vancouver,BC,Canada,1998.512-525.
  • 10KREMER S.Formal Analysis of Optimistic Fair Exchange Proto cols[D].Universit'e Libre de Bruxelles Facult'e des Sciences,2003-2004.

同被引文献81

引证文献6

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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