Fair exchange

Computer Journal

Volumn 46, Issue 1, 2003, Pages 55-75

  Pagnia, Henning ^a   Vogt, Holger ^b   Gärtner, Felix C ^c  

^a Berufsakademie Mannheim   (Germany)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT EXCHANGE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; INTERNET; NETWORK PROTOCOLS; ONLINE SYSTEMS;

DIGITAL IDENTITY CARDS; FAIR EXCHANGE; FAIR EXCHANGE PROTOCOLS;

ELECTRONIC COMMERCE;

EID: 0037244617     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/46.1.55     Document Type: Article

References (79)

1. Asokan, N., Schunter, M. and Waidner, M. (1997) Optimistic protocols for fair exchange. In Matsumoto, T. (ed.), Proc. 4th ACM Conf. on Computer and Communications Security, Zürich, Switzerland, April, pp. 6-17. ACM Press, New York.
2. Basu, A., Charron-Bost, B. and Toueg, S. (1996) Simulating reliable links with unreliable links in the presence of process crashes. In Proc. 10th Int. Workshop on Distributed Algorithms (WDAG96), Bologna, Italy, October, pp. 105-122. Springer.
3. Schneider, F. B. (1993) What good are models and what models are good? In Mullender, S. (ed.), Distributed Systems (2nd edn), ch. 2, pp. 17-26. Addison-Wesley, Reading, MA.
4. Menezes, A. J., Oorschot, P. C. V. and Vanstone, S. A. (1997) Handbook of Applied Cryptography. CRC Press, Boca Raton, FL.
5. Asokan, N. (1998) Fairness in Electronic Commerce. Ph.D. Thesis, University of Waterloo, Canada.
6. Pagnia, H. and Vogt, H. (1999) Exchanging goods and payment in electronic business transactions. In Proc. Third European Research Seminar on Advances in Distributed Systems (ERSADS), Madeira Island, Portugal, April.
7. Asokan, N., Shoup, V. and Waidner, M. (1998). Asynchronous protocols for optimistic fair exchange. In Proc. IEEE Symp. on Research in Security and Privacy, Oakland, CA, May, pp. 86-99. IEEE Computer Society Press, Los Alamitos, CA.
8. Fischer, M. J., Lynch, N. A. and Peterson, M. S. (1985) Impossibility of distributed consensus with one faulty process. J. ACM, 32, 374-382.
9. Vogt, H., Pagnia, H. and Gärtner, F. C. (1999) Modular fair exchange protocols for electronic commerce. In Proc. 15th Ann. Computer Security Applications Conf., Phoenix, Arizona, December, pp. 3-11. IEEE Computer Society Press, Los Alamitos, CA.
10. Gärtner, F.C., Pagnia, H. and Vogt, H. (1999) Approaching a formal definition of fairness in electronic commerce. In Proc. Int. Workshop on Electronic Commerce (WELCOM '99), Lausanne, Switzerland, October, pp. 354-359. IEEE Computer Society Press, Los Alamitos, CA.
11. Wilhelm, U. G. (1999) A Technical Approach to Privacy based on Mobile Agents protected by Tamper-resistant Hardware. Ph.D. Thesis, École Polytechnique Fédérale de Lausanne,Switzerland.
12. Mao, W. (1997) Verifiable escrowed signature. Information Security and Privacy - ACISP '97, Sydney, Australia, July. Lecture Notes in Computer Science, 1270, 240-248, Springer, Berlin.
13. Asokan, N., Shop, V. and Waidner, M. (2000) Optimistic fair exchange of digital signatures. IEEE J. Selected Areas Commun., 18, 593-610.
14. Asokan, N., Shoup, V. and Waidner, M. (1998) Optimistic fair exchange of digital signatures. In Nybeerg, K. (ed.), Advances in Cryptology - EUROCRYPT '98, Espoo, Finland, June. Lecture Notes in Computer Science, 1403, 591-606. Springer, Berlin.
15. Camenisch, J. and Damgård, I. (1998) Verifiable Encryption and Applications to Group Signatures and Signature Sharing. Technical Report RS-98-32, BRICS, Department of Computer Science, Aarhus University, Denmark.
16. Ateniese, G. (1999) Efficient verifiable encryption (and fair exchange) of digital signatures. In Proc. 6th ACM Conf. on Computer and Communications Security (CCS '99), Singapore, November, pp. 138-146. ACM Press, New York.
17. Bao, F., Deng, R. H. and Mao, W. (1998) Efficient and practical fair exchange protocols with off-line TTP. In Proc. IEEE Symp. on Research in Security and Privacy, Oakland, CA, May, pp. 77-85. IEEE Computer Society Press, Los Alamitos, CA.
18. Boyd, C. and Foo, E. (1998) Off-line fair payment protocol using convertible signatures. In Advances in Cryptology - ASIACRYPT '98, Beijing, China, October. Lecture Notes in Computer Science, 1514, 271-285, Springer, Berlin.
19. Chen, L. (1998) Efficient fair exchange with verifiable confirmation of signatures. In Ohta, K. and Pei, D. (eds.), Advances in Cryptology-ASIACRYPT '98, Beijing, China, October 18-22. Lecture Notes in Computer Science, 1514, 286-299. Springer, Berlin.
20. Boyar, J., Chaum, D., Damgård, I. B. and Pedersen, T. P. (1990) Convertible undeniable signatures. In Menezes, A. J. and Vanstone, S. A. (eds.), Advances in Cryptology - CRYPTO '90, Santa Barbara, CA, August. Lecture Notes in Computer Science, 537, 189-205. Springer, Berlin.
21. Chaum, D. (1983) Blind signatures for untraceable payments. Advances in Cryptology - CRYPTO '82, Santa Barbara, CA, August, pp. 199-203. Plenum, New York.
22. Zhou, J. (1996) Non-repudiation. Ph.D. Thesis, University of London.
23. Vogt, H., Pagnia, H. and Gärtner, F. C. (2001) Using smart cards for fair exchange. In Electronic Commerce - WELCOM 2001, Heidelberg, November 16-17. Lecture Notes in Computer Science, 2232, 101-113. Springer, Berlin.
24. Vogt, H., Gärtner, F. C. and Pagnia, H. (2002) Supporting fair exchange in mobile environments. J. Mobile Networks Appl. (MONET), 8(2), April.
25. Franklin, M. K. and Reiter, M. K. (1997) Fair exchange with a semi-trusted third party. 4th ACM Conf. on Computer and Communications Security, Zürich, Switzerland, April, pp. 1-5. ACM Press, New York.
26. Denning, D. E. (1976) A lattice model of secure information flow. Commun. ACM, 19, 236-243.
27. Buttyán, L. (2001) Building Blocks for Secure Services: Authenticated Key Transport and Rational Exchange Protocols. Ph.D. Thesis, École Polytechnique Fédérale de Lausanne, no. 2511.
28. Morris, P. (2000) Introduction to Game Theory. Springer, Berlin.
29. Pfitzmann, B., Schunter, M. and Waidner, M. (2000) Secure Reactive Systems. Research Report RZ 3206 (#93252), IBM Reseach.
30. Schunter, M. (2000) Optimistic Fair Exchange. Ph.D. Thesis, Universität des Saarlandes, Sarbrücken, Germany.
31. Cervesato, I., Durgin, N., Lincoln, P., Mitchell, J. and Scedrov, A. (1999) A meta-notation for protocol analysis. In Proc. 12th Ann. IEEE Computer Security Foundations Workshop - CSFW'99, Mordano, Italy, June, pp. 55-69. IEEE Computer Society Press, Los Alamitos, CA.
32. Chadha, R., Kanovich, M. and Scedrov, A. (2001) Inductive methods and contract-signing protocols. In Samarati. P. (ed.), Proc. 8th ACM Conf. on Computer and Communication Security, Philadelphia, PA, November, pp. 176-185. ACM Press, New York.
33. Lamport, L. (1977) Proving the correctness of multiprocess programs. IEEE Trans. on Software Eng., 3, 125-143.
34. Alpern, B. and Schneider, F. B. (1985) Defining liveness. Inform. Process. Lett., 21, 181-185.
35. Lamport, L. (1989) A simple approach to specifying concurrent systems. Commun. ACM, 32, 32-45.
36. Shmatikov, V. and Mitchell, J. C. (2002) Finite-state analysis of two contract signing protocols. Theoret. Comput. Sci., 283, 419-450.
37. Schneider, F. B. (2000) Enforceable security policies. ACM Trans. Inform. Syst. Security, 3, 30-50.
38. Even, S. and Yacobi, Y. (1980) Relations Among Public Key Signature Systems. Technical Report 175, Computer Science Department, Technicon, Haifa, Israel.
39. Franklin, M. K. and Tsudik, G. (1998) Secure group barter: multi-party fair exchange with semi-trusted neutral parties. In Financial Cryptography - FC '98, Anguilla, British West Indies, February. Lecture Notes in Computer Science, 1465, 90-102, Springer, Berlin.
40. Aguilera, M. K., Chen, W. and Toueg, S. (2000) Failure detection and consensus in the crash recovery model. Distrib. Comput., 13, 99-125.
41. Sander, T. and Tschudin, C. (1998) Towards mobile cryptography. In Proc. IEEE Symp. on Research in Security and Privacy, Oakland, CA, May. IEEE Computer Society Press.
42. Bürk, H. and Pfitzmann, A. (1990) Value exchange systems enabling security and unobservability. Comput. Security, 9, 715-721.
43. Tygar, J. D. (1996) Atomicity in electronic commerce. In Proc. 15th Ann. ACM Symp. on Principles of Distributed Computing (PODC '96), Philadelphia, PA, May, pp. 8-26. ACM Press, New York.
44. Markowitch, O. and Saeednia, S. (2002) Optimistic fair exchange with transparent signature recovery. In Financial Cryptography - FC 2001, Grand Cayman, British West Indies, February 19-22. Lecture Notes in Computer Science, 2339, 339-350, Springer, Berlin.
45. Liu, P., Ning, P. and Jajodia, S. (2000) Avoiding loss of fairness owing to process crashes in fair data exchange protocols. In Proc. IEEE Int. Conf. on Dependable Systems and Networks, Workshop on Dependability Despite Malicious Faults, New York, June, pp. 631-640. IEEE Computer Society Press, Los Alamitos, CA.
46. Garay, J. A., Jakobson, M. and MacKenzie, P. (1999) Abuse-free optimistic contract signing. In Wiener, M. (ed.), Advances in Cryptology - CRYPTO '99, Santa Barbara, CA, August 15-19. Lecture Notes in Computer Science, 1666, 449-466, Springer, Berlin.
47. Zhou, J. and Gollmann, D. (1996) A fair non-repudiation protocol. In Proc. IEEE Symp. on Security and Privacy, Oakland, CA, May, pp. 55-61. IEEE Computer Society Press.
48. Zhou, J. and Gollmann, D. (1997) An efficient non-repudiation protocol. In Proc. 10th IEEE Computer Security Foundations Workshop, Rockport, MA, June, pp. 126-132. IEEE Computer Society Press, Los Alamitos, CA.
49. Zhou, J., Deng, R. and Bao, F. (1999) Evolution of fair non-repudiation with TTP. In Information Security and Privacy - ACISP '99, Wollongong, Australia, April 7-9. Lecture Notes in Computer Science, 1587, 258-269, Springer, Berlin.
50. Bahreman, A. and Tygar, J. (1994) Certified electronic mail. In Proc. ISOC Symp. on Network and Distributed Systems Security, San Diego, CA, February, pp. 3-19. IEEE Computer Society Press, Los Alamitos, CA.
51. Zhou, J. and Gollmann, D. (1996) Certified electronic mail. In Computer Security - ESORICS '96, Rome, Italy, September. Lecture Notes in Computer Science, 1146, 160-171. Springer, Berlin.
52. Schneir, B. and Riordan, J. (1998) A certified e-mail protocol. In Proc. 14th Ann. Computer Security Applications Conf., Scottsdale, AZ, December, pp. 347-352. IEEE Computer Society Press, Los Alamitos, CA.
53. Lynch, N. A., Merritt, M., Weihl, W. and Fekete, A. (1994) Atomic Transactions. Morgan Kaufmann, San Mateo, CA.
54. Bernstein, P., Hadzilacos, V. and Goodman, N. (1987) Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading, MA.
55. Schuldt, H., Popovici, A. and Schek, H.-J. (1999) Give me all I pay for - Execution guarantees in electronic commerce payment processes. In GI Workshop Informatik '99: Enterprise-wide and Cross-enterprise Workflow Management: Concepts, Systems, Applications, Paderborn, Germany, October 6. Springer, Berlin.
56. Ketchpel, S. P. and Garcia-Molina, H. (1996) Making trust explicit in distributed commerce transactions. In Proc. 16th IEEE International Conf. on Distributed Computing Systems (ICDCS96), Hong Kong, May, pp. 270-281. IEEE Computer Society Press, Los Alamitos, CA.
57. Bao, F., Deng, R., Nguyen, K. Q. and Varadharajan, V. (1999) Multi-party fair exchange with an off-line trusted neutral party. In Proc. 10th Int. Workshop on Database and Expert Systems Applications, Florence, Italy, September 1-3, pp. 858-862. IEEE Computer Society Press, Los Alamitos, CA.
58. Markowitch, O. and Kremer, S. (2000) A multi-party optimistic non-repudiation protocol. Information Security and Cryptology - ICISC 2000, Seoul, Korea, December. Lecture Notes in Computer Science, 2015, 109-122. Springer, Berlin.
59. Baum-Waidner, B. and Waidner, M. (2000) Round-optimal and abuse-free multi-party contract signing. In 27th Int. Colloq. on Automata, Languages and Programming (ICALP '2000), Geneva, Switzerland, July. Lecture Notes in Computer Science, 1853, 524-535, Springer, Berlin.
60. Pagnia, H. and Jansen, R. (1997) Towards multiple-payment schemes for digital money. In Hirschfeld, R. (ed.), Financial Cryptography: First Int. Conf., FC '97, Anguilla, British West Indies, February 24-28. Lecture Notes in Computer Science, 1318, 203-215, Springer.
61. Syverson, P. (1998) Weakly secret bit commitment: applications to lotteries and fair exchange. In Proc. 11th IEEE Computer Security Foundations Workshop (CSFW '98), Rockport, Massachusetts, June, pp. 2-13. IEEE Computer Society Press, Los Alamitos, CA.
62. Jakobsson, M. (1995) Ripping coins for fair exchange. In Guillou, L. C. and Quisquater, J.-J. (eds.), Advances in Cryptology - EUROCRYPT '95, St. Malo, France, May 21-25. Lecture Notes in Computer Science, 921, 220-230. Springer, Berlin.
63. Buttyán, L. and Hubaux, J.-P. (2001) Rational exchange - A formal model based on game theory. Electronic Commerce - WELCOM 2001, Heidelberg, November. Lecture Notes in Computer Science, 2232, 114-126. Springer, Berlin.
64. Sandholm, T. W. and Lessser, V. R. (1995) Equilibrium analysis of the possibilities of unenforced exchange in multiagent systems. In Mellish, C. S. (ed.), Proc. Fourteenth Int. Joint Conf. on Artificial Intelligence, Montreal, Canada, August 20-25, pp. 694-703. Morgan Kaufmann, San Mateo, CA.
65. Zhou, J. and Lam, K.-Y. (1999) A secure pay-perview scheme for web-based video service. In Public Key Cryptography - PKC '99, Kamakura, Japan, March. Lecture Notes in Computer Science, 1560, 315-326. Springer, Berlin.
66. Even, S. (1982) A protocol for signing contracts. In Gersho, A. (ed.), Advances in Cryptology: A Report on CRYPTO 81, Santa Barbara, USA, August, pp. 148-153. ECE Report No. 82-04, UC. Santa Barbara, Department of Electrical and Computer Engineering.
67. Blum, M. (1983) How to exchange (secret) keys. ACM Trans. Comput. Syst., 1, 175-193.
68. Brickell, E. F., Chaum, D., Damgård, I. B. and van de Graaf, J. (1987) Gradual and verifiable release of a secret. In Advances in Cryptology - CRYPTO '87, Santa Barbara, CA, August. Lecture Notes in Computer Science, 293, 156-166. Springer, Berlin.
69. Damgård, I. B. (1993) Practical and provably secure release of a secret and exchange of signatures. In Helleseth, T. (ed.) Advances in Cryptology - EUROCRYPT '93, Lofthus, Norway, May. Lecture Notes in Computer Science, 765, 200-217. Springer, Berlin.
70. Boneh, D. and Naor, M. (2000) Time commitments. In Advances in Cryptology - CRYPTO '2000, Santa Barbara, CA. Lecture Notes in Computer Science, 1880, 236-254. Springer, Berlin.
71. Rabin, M. O. (1983) Transaction protection by beacons. J. Comput. Syst. Sci., 27, 256-267.
72. Ben-Or, M., Goldreich, O., Micali, S. and Rivest R. L. (1990) A fair protocol for signing contracts. ACM Trans. Inform. Theory, 36, 40-46.
73. Markowitch, O. and Roggeman, Y. (1999) Probabilistic non-repudiation without trusted third party. In Proc. Second Conf. on Security in Communication Networks (SCN99), Amalfi, Italy.
74. Garay, J. A. and MacKenzie, P. (1999) Abuse-free multi-party contract signing. In Distributed Computing - DISC '99, Bratislava, Slovak Republic, September 27-29. Lecture Notes in Computer Science, 1693, 151-165. Springer, Berlin.
75. Shamtikov, V. and Michell, J. C. (2001) Analysis of abuse-free contract signing. In Financial Cryptography - FC 2000, Anguilla, British West Indies, February 21-24. Lecture Notes in Computer Science, 1962, 174-191. Springer, Berlin.
76. Das, S. and Dill, D. L. (2001) Successive approximation of abstract transition relations. In Proc. 16th Ann. IEEE Symp. on Logic in Computer Science, Boston, MA, June, pp. 51-58. IEEE Computer Society Press, Los Alamitos, CA.
77. Kremer, S. and Raskin, J-F. (2002) Game analysis of abuse-free contract signing. In Proc. 15th IEEE Computer Security Foundations Workshop, Cape Breton, Nova Scotia, Canada, June. IEEE Computer Society Press, Los Alamitos, CA.
78. Kremer, S. and Raskin, J.-F. (2000) Formal Verification of Non-repudiation Protocols - A Game Approach. Technical Report 431, Univerité Libre de Bruxelles, Belgium, presented at the Workshop on Formal Methods and Computer Security, Chicago, 2000.
79. Pagnia, H., Vogt, H., Gärtner, F. C. and Wilhelm, U. G. (2000) Solving fair exchange with mobile agents. In ASA/MA 2000, Zürich, Switzerland, September. Lecture Notes in Computer Science, 1882, 57-72. Springer, Berlin.