Fair Payment Protocols for E-Commerce

1. N. Asokan, Philippe A. Janson, Michael Steiner, and Michael Waidner, “The State of the Art in Electronic Payment Systems”, IEEE Computer, September 1997, pp. 28–35.

   Google Scholar 

2. N. Asokan, M. Schunter, and M. Waidner, “Optimistic protocols for fair exchange”, in Proceedings of the fourh ACM Conference on Computer and Communications Security, Zurich, Switzerland, April 1997, pp. 6, 8–17.

   Google Scholar 

3. N. Asokan and V. Shoup, “Optimistic fair exchange of digital signatures”, in Advances in Cryptology-EUROCRYPT’ 98, volume 1403 of Lecture Notes in Computer Science, Springer-Verlag, 1998, pp. 591–606.

   Google Scholar 

4. N. Asokan, V. Shoup, and M. Waidner, “Asynchronous protocols for optimistic fair exchange”, in Proceedings of IEEE Symposium on Research in Security and Privacy, 1998, pp. 86–99. (Printed version contains some errors. Errata sheet is distributed together with the electronic version).

   Google Scholar 

5. G. Ateniese, “Efficient verifiable encryption (and fair exchange) of digital signatures”, in Proceedings of the 6th ACM conference on Computer and communications security, Nov. 1999.

   Google Scholar 

6. F. Bao, R. Deng and W. Mao, “Efficient and practical fair exchange protocols with offline TTP”, in Proceedings of IEEE Symposium on Security and Privacy, Oakland, May 1998, pp. 77–85.

   Google Scholar 

7. C. Boyd, E. Foo. “Off-line Fair Payment Protocols using Convertible Signatures”, in Advances in Cryptology-ASIA CRYPT’98, 1998.

   Google Scholar 

8. R. Chadha, J. Mitchell, A. Scedrov and V. Shmatikov, “Contract signing, optimism and advantage”, in CONCUR 2003-Concurrency Theory, 14-th International Conference, Marseille, France, September 2003. Volume 2761 of Lecture Notes in Computer Science, Springer-Verlag, 2003, pp. 366–382

   Article  MathSciNet  Google Scholar 

9. R. Chadha, M. Kanovich and A. Scedrov, “Inductive methods and contract-signing protocols”, in Proceedings of 8th ACM confererence on Computer and Communications Security(CCS-8). Philadelphia, Pennsylvania, ACM Press, November 7, 2001, pp. 176–185.

   Google Scholar 

10. Y. Dodis and L. Reyzin, “Breaking and repairing optimistic fair exchange from PODC 2003”, in Proceedings of the 2003 ACM workshop on Digital rights management, Oct. 2003.

    Google Scholar 

11. J. Garay, M. Jakobsson and P. MacKenzie. “Abuse-free optimistic contract signing”, in Advances in Cryptology-CRYPTO’ 99, volume 1666 of Lecture Notes in Computer Science, SpringerVerlag, 1999, pp. 449–466.

    Google Scholar 

12. S. Gurgens, C. Rudolph and H. Vogt, “On the Security of Fair Non-repudiation Protocols”, in Proceedings of 2003 Information Security Conference, volume 2851 of Lecture Notes in Computer Science, Bristol, UK, Oct. 2003, pp. 193–207.

    Google Scholar 

13. M. Jakobsson, K. Sako, R. Impagliazzo, “Designated verifier proofs and their applications”, in Eurocrypt’96, volume 1070 of Lecture Notes in Computer Science, Springer Verlag, 1996, pp. 143–154.

    Google Scholar 

14. S. Kremer and O. Markowitch, “Optimistic non-repudiable information exchange”, in 21th Symposium on Information Theory in the Benelux, Werkgemeenschap Informatie-en Communicatietheorie, Enschede, may 2000, pp. 139–146.

    Google Scholar 

15. S. Kremer and J.F. Raskin, “Game Analysis of Abuse-free Contract Signing”, in 15th Computer Security Foundations Workshop (CSFW 2002), IEEE Computer Society. Cape Breton, Nova Scotia, Canada, 2002.

    Google Scholar 

16. P. Louridas, “Some guidelines for non-repudiation protocols”, ACM SIGCOMM Computer Communication Review, Oct. 2000.

    Google Scholar 

17. O. Markowitch and S. Kremer, “An optimistic non-repudiation protocol with transparent trusted third party”, in Information Security: ISC 2001, volume 2200 of Lecture Notes in Computer Science, Malaga, Spain. Springer-Verlag, Oct. 2001, pp. 363–378.

    Google Scholar 

18. O. Markowitch, S. Kremer and D. Gollmann, “On Fairness in Exchange Protocols”, in Information Security and Cryptology-ICISC 2002, volume 2587 of Lecture Notes in Computer Science. Springer-Verlag, 2002.

    Google Scholar 

19. W. Mao and K. Paterson, “Convertible Undeniable Standard RSA Signatures”, 2000; http://citeseer.ist.psu.edu/mao00convertible.html.

20. S. Micali, “Certified e-mail with invisible post offices”, Available from author: an invited presentation at the RSA’97 conference, 1997.

    Google Scholar 

21. H. Pagnia, H. Vogt, F.C. Gatner, and U.G. Wilhelm, “Solving Fair Exchange with Mobile Agents”, Volume 1882 of Lecture Notes in Computer science, Springer, September 2000, pp. 57–72.

    Google Scholar 

22. J.M. Park, Edwin K. P. Chong and H. J. Siegel, “Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures”, in Proceedings of the twenty-second annual symposium on Principles of distributed computing, July 2003.

    Google Scholar 

23. B. Pfitzmann, M. Schunter and M. Waidner, “Optimal efficiency of optimistic contract signing”, in Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, June 1998.

    Google Scholar 

24. S. Saeednia, S. Kremer and O. Markowitch, “An efficient strong designated verifier scheme”, in 6th International Conference on Information Security and Cryptology (ICISC 2003), Lecture Notes in Computer Sciences, Springer-Verlag. Seoul, Korea, Nov. 2003.

    Google Scholar 

25. H. Vogt, H. Pagnia, and F.C. Gartner, “Modular Fair Exchange Protocols for Electronic Commerce”, In Proceedings of the 15th Annual Computer Security Applications Conference, Phoenix, Arizona. IEEE, Dec. 1999.

    Google Scholar 

26. C.H. Wang, “Untraceable Fair Network Payment Protocols with Off-Line TTP”, in Advances in Cryptology-ASIACRYPT 2003: 9th International Conference on the Theory and Application of Cryptology and Information Security, volume 2894 of Lecture Notes in Computer Science, Spring-Verlag, 2003, pp. 173–187

    Google Scholar 

27. G. Wang, “An Attack on Not-interactive Designated Verifier Proofs for Undeniable Signatures”, Cryptology ePrint Archive, Report 2003/243, 2003; http://eprint.iacr.org/2003/243/.

Download references