An optimistic fair e-commerce protocol for large e-goods

Suppose two entities that do not trust each other want to exchange some arbitrary data over a public channel. A fair exchange protocol ensures that both parties get what they want or neither gets anything. In this paper, a fair e-commerce protocol for large e-goods is proposed and implemented. The proposed protocol provides a method for the fair exchange of e-money for e-products, and a method for verifying the contents of the exchanged items. The protocol is optimistic and efficient such that when none of the parties tries to cheat, only three messages are sufficient. In case of disputes, three more messages are needed. Furthermore, the customer remains anonymous after the transaction; thus, no information about the customers' shopping habits can be gathered through the protocol. The implementation results show that the protocol is efficient and secure and that only a small number of cryptographic operations is sufficient.

• Type: Conference
• Year: 2006
• Where: ISCN
• Authors: Cagil Can Oniz, Erkay Savas, Albert Levi
• Keywords: Arbitrary Data, Computer Networks, Fair E-commerce Protocol, Fair Exchange Protocol, ISCN 2006