Journal of Applied Mathematics

  • J. Appl. Math.
  • Volume 2014, Special Issue (2014), Article ID 138370, 10 pages.

Formal Modeling and Analysis of Fairness Characterization of E-Commerce Protocols

Chengwei Zhang, Xiaohong Li, Jing Hu, Zhiyong Feng, and Jiaojiao Song

Full-text: Open access

Abstract

In the past, fairness verification of exchanges between the traders in E-commerce was based on a common assumption, so-called nonrepudiation property, which says that if the parties involved can deny that they have received or sent some information, then the exchanging protocol is unfair. So, the nonrepudiation property is not a sufficient condition. In this paper, we formulate a new notion of fairness verification based on the strand space model and propose a method for fairness verification, which can potentially determine whether evidences have been forged in transactions. We first present an innovative formal approach not to depend on nonrepudiation, and then establish a relative trader model and extend the strand space model in accordance with traders’ behaviors of E-commerce. We present a case study to demonstrate the effectiveness of our verification method.

Article information

Source
J. Appl. Math., Volume 2014, Special Issue (2014), Article ID 138370, 10 pages.

Dates
First available in Project Euclid: 1 October 2014

Permanent link to this document
https://projecteuclid.org/euclid.jam/1412177671

Digital Object Identifier
doi:10.1155/2014/138370

Citation

Zhang, Chengwei; Li, Xiaohong; Hu, Jing; Feng, Zhiyong; Song, Jiaojiao. Formal Modeling and Analysis of Fairness Characterization of E-Commerce Protocols. J. Appl. Math. 2014, Special Issue (2014), Article ID 138370, 10 pages. doi:10.1155/2014/138370. https://projecteuclid.org/euclid.jam/1412177671


Export citation

References

  • R. Kailar, “Accountability in electronic commerce protocols,” IEEE Transactions on Software Engineering, vol. 22, no. 5, pp. 313–328, 1996.
  • J. Zhou and D. Gollmann, “Towards verification of non-repudiation protocols,” in Proceedings of the International Refinement Workshop and Formal Methods Pacific, pp. 370–380, Canberra, Australia, 1998.
  • S. Schneider, “Formal analysis of a non-repudiation protocol,” in Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSFW '98), pp. 54–65, June 1998.
  • F. J. T. Fabrega, J. C. Herzog, and J. D. Guttman, “Honest ideals on strand spaces,” in Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSFW '98), pp. 66–77, June 1998.
  • F. J. T. Fabrega, J. C. Herzog, and J. D. Guttman, “Strand spaces: why is a security protocol correct?” in Proceedings of the IEEE Symposium on Security and Privacy, pp. 160–171, May 1998.
  • F. J. T. Fabrega, J. C. Herzog, and J. D. Guttman, “Mixed strand spaces,” in Proceedings of the 12th IEEE Computer Security Foundations Workshop (CSFW '99), pp. 72–82, June 1999.
  • R. M. Amadio and W. Charatonik, “On name generation and set-based analysis in the Dolev-Yao model,” in CONCUR 2002–-Concurrency Theory, pp. 499–514, Springer, Berlin, Germany, 2002.
  • H. Pagnia and F. C. Gartner, On the Impossibility of Fair Exchange Without a Trusted Third Party TUD-BS-1999-02, Department of Computer Science, Darmstadt University of Technology, 1999.
  • N. Asokan, Fairness in electronic commerce [Ph.D. thesis], University of Waterloo, 1998.
  • J. Yang and H.-F. Deng, “Security electronic commerce protocol by the third kind entities,” in Proceedings of the International Conference on Machine Learning and Cybernetics, pp. 4438–4443, Dalian, China, August 2006.
  • H. Wang, J. Ma, and B. Chen, “Formal analysis of fairness in E-payment protocol based on strand space,” in Web Information Systems and Mining, pp. 469–478, Springer, Berlin, Germany, 2009.
  • W. Liu, J. Yang, and Z. Li, “Fairness analysis of electronic commerce protocol based on strand space,” in Proceedings of the 5th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP '09), pp. 714–717, Kyoto, Japan, September 2009.
  • W. Xu, D.-Y. Wu, Y. Ma, and N. Liu, “A formal method for analyzing fair exchange protocols,” in Proceedings of the WASE International Conference on Information Engineering (ICIE '09), pp. 117–120, Taiyuan, China, July 2009.
  • Q. Zhang, K. Markantonakis, and K. Mayes, “A practical fair-exchange e-payment protocol for anonymous purchase and physical delivery,” in Proceedings of the IEEE International Conference on Computer Systems and Applications (AICCSA '06), pp. 851–858, Sharjah, UAE, March 2006.
  • S. Fröschle, “Adding Branching to the Strand Space Model,” Electronic Notes in Theoretical Computer Science, vol. 242, no. 1, pp. 139–159, 2009.
  • J. D. Guttman, “State and progress in strand spaces: proving fair exchange,” Journal of Automated Reasoning, vol. 48, no. 2, pp. 159–195, 2012.
  • J. D. Guttman, “Fair exchange in strand spaces,” in Proceedings 7th International Workshop on Security Issues in Concurrency (SecCo '09), pp. 46–60, Bologna, Italy, September 2009.
  • S.-H. Tian, L.-J. Chen, and J.-R. Li, “Fairness analysis of electronic payment protocol based on offline TTP,” Journal of Computer Applications, vol. 29, no. 7, pp. 1839–1843, 2009.
  • A. Alaraj and M. Munro, “An efficient fair exchange protocol that enforces the merchant to be honest,” in Proceedings of the 3rd International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom '07), pp. 196–202, New York, NY, USA, November 2007. \endinput