Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 138370, 10 pages
http://dx.doi.org/10.1155/2014/138370
Research Article

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

School of Computer Science and Technology, Tianjin University, Tianjin 300072, China

Received 24 January 2014; Revised 4 May 2014; Accepted 4 May 2014; Published 1 June 2014

Academic Editor: Xiaoyu Song

Copyright © 2014 Chengwei Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Kailar, “Accountability in electronic commerce protocols,” IEEE Transactions on Software Engineering, vol. 22, no. 5, pp. 313–328, 1996. View at Publisher · View at Google Scholar
  2. 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.
  3. 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. View at Publisher · View at Google Scholar · View at Scopus
  4. 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. View at Publisher · View at Google Scholar · View at Scopus
  5. 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. View at Scopus
  6. 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. View at Scopus
  7. 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. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. 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.
  9. N. Asokan, Fairness in electronic commerce [Ph.D. thesis], University of Waterloo, 1998.
  10. 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. View at Publisher · View at Google Scholar · View at Scopus
  11. 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. View at Publisher · View at Google Scholar
  12. 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. View at Publisher · View at Google Scholar · View at Scopus
  13. 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. View at Publisher · View at Google Scholar · View at Scopus
  14. 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. View at Scopus
  15. S. Fröschle, “Adding Branching to the Strand Space Model,” Electronic Notes in Theoretical Computer Science, vol. 242, no. 1, pp. 139–159, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. J. D. Guttman, “State and progress in strand spaces: proving fair exchange,” Journal of Automated Reasoning, vol. 48, no. 2, pp. 159–195, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. 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. View at Publisher · View at Google Scholar
  18. 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. View at Google Scholar
  19. 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. View at Publisher · View at Google Scholar · View at Scopus