期刊文献+

基于动态博弈描述的电子商务协议公平性

Fairness of electronic commerce protocols based on dynamic game
下载PDF
导出
摘要 基于通信顺序进程和动态博弈理论对电子商务系统建模,提出了结构化的电子商务协议的公平性,并基于该模型给出了公平性的形式化定义,可以用于电子商务协议公平性的分析。与以往工作相比,主要贡献在于:a)系统模型中的失效模型分别对进程和通信失效建模,增加了通信延迟失效模型,可以分析系统失效时满足的公平性;b)收益平衡从参与者获得利益和损失利益两个角度定义公平性,打破了以往公平性定义只能应用于零和交易系统的局限;c)结构化的公平性分别考虑系统诚实参与者中途自愿退出或者因失效中止协议的公平性和有参与者欺骗下的协议的公平性等。后两点解决了系统满足公平性定义但实际上对参与者不公平的矛盾. This paper built a dynamic game-based model of electronic commerce systems.Presented a structural fairness of electronic commerce protocols,and in the model gave a formal description of the new fairness,which were used to analyze formally fairness property of electronic commerce protocols.Compared with the previous work,the main contributions were the following.Firstly,Balance Payoff considered both participants' income and expense but the previous one only considered participants' income.Secondly,abortive fairness was defined because of honest participants' quitting voluntarily or aborting the protocol in response to system failures. These two helped people to avoid the confusion that a system satisfies fairness definition but was not fair to some participant factually.Thirdly,a strategic game was used to model channels in various qualities and participants' dishonest behavior enabled people to analyze cooperative and adversarial behaviors and modeling process failure and channel failure resulted in analyzing which fairness a protocol satisfied.
出处 《计算机应用研究》 CSCD 北大核心 2008年第6期1789-1792,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(60473057,90604007,60073001) 国家“863”计划资助项目(2002AA144040)
关键词 公平性 电子商务协议 博弈 遵守型 撤销型 欺骗型 fairness electronic commerce protocol game compliant abortive deceptive
  • 相关文献

参考文献10

  • 1ASOKAN N. Fairness in electronic commerce[ D]. Ontario, Canada: University of Waterloo, 1998.
  • 2BELLA G, LONGO C, PAULSON L C. Verifying second-level security protocols[ C] //Proc of Theorem Proving in Higher Order Logics. 2003:352- 366.
  • 3GaRTNER F C,PAGNIA H, VOGT H. Approaching a formal definition of fairness in electronic commerce [ C ] //Proc of International SRDS Workshop on Electronic Commerce. 1999:354-359.
  • 4卿斯汉,李改成.公平交换协议的一个形式化模型[J].中国科学(E辑),2005,35(2):161-172. 被引量:9
  • 5KREMER S, MARKOWITCH O, ZHOU J. An intensive survey of fair non-repudiation protocols [ J]. Computer Communications, 2002, 25:1601-1621.
  • 6KREMER S, MARK D. Analysis of an electronic voting protocol in the applied pi-calculus[ C] //Proc of the 14th European Symposium on Programming ( ESOP' 05 ). 2005 : 186- 200.
  • 7SCHNEIDER S. Formal analysis of a non-repudiation protocol[ C] // Proc of the 11 th IEEE Computer Security Foundations Workshop. [ S.l.] : IEEE Computer Society Press, 1998:54-65.
  • 8HOARE C A R. Communicating sequential processes[ M]. [ S.l. ] : Prentice Hall, 2004.
  • 9KIM K, PARK S, BAEK J, Improving fairness and privacy of Zhou- Gollmann' s fair non-repudiation protocol [ C ] //Proc of International Workshops on Parallel Processing. [ S. l. ] : IEEE Computer Society Press, 1999 : 140-145.
  • 10ZHOU J, GOLLMANN D. A fair non-repudiation protocol[ C] // Proc of IEEE Symposium on Security and Privacy. 1996:55-61.

二级参考文献8

  • 1Jim Davies, Jim Woodcock. Using Z: Specification, Refinement and Proof. Prentice Hall International Series in Computer Science, 1996.
  • 2Asokan. Fairness in Electronic Commerce. PhD thesis, University of Waterloo, May 1998.
  • 3Steve KREMER Formal Analysis of Optimistic Fair Exchange Protocols. PhD thesis, Universit'e Libre de Bruxelles Facult'e des Sciences, 2003-2004.
  • 4Rohit Chadha, Max Kanovich, Andre Scedrov. Inductive methods and contract signing protocols. In:Pierangela Samarati, ed. 8th ACM Conference on Computer and Communications Security, Philadelphia,PA: ACM Press, November 2001, 176-185.
  • 5Steve A. Schneider. Formal analysis of a non-repudiation protocol. In: 11th IEEE Computer Security Foundations Workshop, Washington-Brussels-Tokyo, IEEE June, 1998. 54-65.
  • 6Giampaolo Bella, Lawrence C. Paulson. Mechanical proofs about a nonrepudiation protocol. In: Richard J.Boulton, Paul B. Jackson, ed. Theorem Proving in Higher Order Logics, volume 2152 of Lecture Notes in Computer Science, Springer-Verlag, 2001, 91-104.
  • 7Colin Boyd ,Peter Kearney. Exploring fair exchange protocols using speci.cationanimation. In: Joseph Pieprzyk, Eiji Okamoto, Jennifer Seberry, ed. Information Security-International Workshop on Information Security, volume 1975 of Lecture Notes in Computer Science,Wollogong, Australia, Springer-Verlag.December 2000.
  • 8卿斯汉.安全协议的设计与逻辑分析[J].软件学报,2003,14(7):1300-1309. 被引量:69

共引文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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