On fairness in exchange protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2587, Issue , 2003, Pages 451-464

  Markowitch, Olivier ^a   Gollmann, Dieter ^b   Kremer, Steve ^a  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b MICROSOFT RESEARCH   (United Kingdom)

Author keywords

Exchange protocols; Fair exchange; Fairness; Security properties; Security protocols

Indexed keywords

EID: 35248855514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36552-4_31     Document Type: Article

References (34)

1. N. Asokan. Fairness in Electronic Commerce. PhD thesis, University of Waterloo, May 1998.
2. N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for multi-party fair exchange. Research Report RZ 2892 (# 90840), IBM Research, Dec. 1996.
3. N. Asokan, M. Schunter, and M. Waidner. Optimistic protocols for fair exchange. In Proceedings of the fourh ACM Conference on Computer and Communications Security, pages 8-17. ACM Press, Apr. 1997.
4. N. Asokan, V. Shoup, and M. Waidner. Asynchronous protocols for optimistic fair exchange. In Proceedings of the IEEE Symposium on Research in Security and Privacy, Research in Security and Privacy, pages 86-99. IEEE Computer Society,Technical Committee on Security and Privacy, IEEE Computer Security Press, May 1998.
5. N. Asokan, V. Shoup, and M. Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):593-610, Apr. 2000.
6. G. Ateniese. Efficient verificable encryption (and fair exchange) of digital signatures. In 6th ACM Conference on Computer and Communications Security, pages 138-146, Singapore, Nov. 1999. ACM Press.
7. F. Bao, R. Deng, K. Q. Nguyen, and V. Vardharajan. Multi-party fair exchange with an off-line trusted neutral party. In DEXA '99 Workshop on Electronic Commerce and Security, Florence, Italy, Sept. 1999.
8. M. Ben-Or, O. Goldreich, S. Micali, and R. Rivest. A fair protocol for signing contracts. IEEE Transaction on Information Theory, 36(1):40-46, Jan. 1990.
9. D. Boneh and M. Naor. Timed commitments. In Advances in Cryptology: Proceedings of Crypto 2000, volume 1880 of Lecture Notes in Computer Science, pages 236-254. Springer-Verlag, 2000.
10. C. Boyd and E. Foo. Off-line fair payment protocols using convertible signatures. In Advances in Cryptology: Proceedings of Asiacrypt'98, volume 1514 of Lecture Notes in Computer Science, pages 271-285. Springer-Verlag, 1998.
11. T. Coffey and P. Saidha. Non-repudiation with mandatory proof of receipt. ACM-CCR: Computer Communication Review, 26, 1996.
12. S. Even, O. Goldreich, and A. Lempel. A randomized protocol for signing contracts. Communications of the ACM, 28(6):637-647, June 1985.
13. M. Franklin and G. Tsudik. Secure group barter: Multi-party fair exchange with semi-trusted neutral parties. Lecture Notes in Computer Science, 1465, 1998.
14. M. K. Franklin and M. K. Reiter. Fair exchange with a semi-trusted third party. In 4th ACM Conference on Computer and Communications Security, pages 1-5. ACM Press, Apr. 1997.
15. J. A. Garay, M. Jakobsson, and P. MacKenzie. Abuse-free optimistic contract signing. In Advances in Cryptology: Proceedings of Crypto'99, volume 1666 of Lecture Notes in Computer Science, pages 449-466. Springer-Verlag, 1999.
16. F. C. Gärtner, H. Pagnia, and H. Vogt. Approaching a formal definition of fairness in electronic commerce. In Proceedings of the International Workshop on Electronic Commerce (WELCOM'99), pages 354-359, Lausanne, Switzerland, Oct. 1999. IEEE Computer Society Press.
17. Y. Han. Investigation of non-repudiation protocols. In ACISP: Information Security and Privacy: Australasian Conference, volume 1172 of Lecture Notes in Computer Science, pages 38-47. Springer-Verlag, 1996.
18. M. Jakobsson. Ripping coins for fair exchange. In L. C. Guillou and J.-J. Quisquater, editors, Advances in Cryptology: Proceedings of Eurocrypt'95, volume 921 of Lecture Notes in Computer Science, pages 220-230. Springer-Verlag, 21-25 May 1995.
19. S. Kremer and O. Markowitch. Selective receipt in certified e-mail. In Advances in Cryptology: Proceedings of Indocrypt 2001, Lecture Notes in Computer Science. Springer-Verlag, Dec. 2001.
20. O. Markowitch and Y. Roggeman. Probabilistic non-repudiation without trusted third party. In Second Conference on Security in Communication Networks'99, Amalfi, Italy, Sept. 1999.
21. O. Markowitch and S. Saeednia. Optimistic fair-exchange with transparent signature recovery. In 5th International Conference, Financial Cryptography 2001, Lecture Notes in Computer Science. Springer-Verlag, 2001.
22. S. Micali. Certified E-mail with invisible post offices. Available from author; an invited presentation at the RSA '97 conference, 1997.
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, pages 113-122, New York, May 1998. ACM.
24. A. W. Roscoe. Intensional specifications of security protocols. In Proceedings of the 9th IEEE Computer Security Foundations Workshop, pages 28-38. IEEE Computer Security Press, 1996.
25. P. Syverson. Weakly secret bit commitment: Applications to lotteries and fair exchange. In Proceedings of the 1998 IEEE Computer Security Foundations Workshop (CSFW11), June 1998.
26. P. Syverson. Weakly secret bit commitment: Applications to lotteries and fair exchange. In Proceedings of the 1998 IEEE Computer Security Foundations Workshop (CSFW11), pages 2-13, June 1998.
27. T. Tedrick. How to exchange half a bit. In D. Chaum, editor, Advances in Cryptology: Proceedings of Crypto'83, pages 147-151, New York, 1984. Plenum Press.
28. T. Tedrick. Fair exchange of secrets. In G. R. Blakley and D. C. Chaum, editors, Advances in Cryptology: Proceedings of Crypto'84, volume 196 of Lecture Notes in Computer Science, pages 434-438. Springer-Verlag, 1985.
29. H. Vogt, H. Pagnia, and F. C. Gärtner. Modular fair exchange protocols for electronic commerce. In Proceedings of the 15th Annual Computer Security Applications Conference, pages 3-11, Phoenix, Arizona, Dec. 1999. IEEE Computer Society Press.
30. J. Zhou, R. Deng, and F. Bao. Evolution of fair non-repudiation with TTP. In ACISP: Information Security and Privacy: Australasian Conference, volume 1587 of Lecture Notes in Computer Science, pages 258-269. Springer-Verlag, 1999.
31. J. Zhou, R. Deng, and F. Bao. Some remarks on a fair exchange protocol. In Proceedings of 2000 International Workshop on Practice and Theory in Public Key Cryptography, volume 1751 of Lecture Notes in Computer Science, pages 46-57. Springer-Verlag, Jan. 2000.
32. J. Zhou and D. Gollmann. A fair non-repudiation protocol. In Proceedings of the IEEE Symposium on Research in Security and Privacy, Research in Security and Privacy, pages 55-61. IEEE Computer Society,Technical Committee on Security and Privacy, IEEE Computer Security Press, May 1996.
33. J. Zhou and D. Gollmann. An efficient non-repudiation protocol. In Proceedings of The 10th Computer Security Foundations Workshop, pages 126-132. IEEE Computer Society Press, June 1997.
34. J. Zhou and D. Gollmann. Evidence and non-repudiation. Journal of Network and Computer Applications, 20:267-281, 1997.