An Efficient and Practical Fair Buyer-Anonymity Exchange Scheme Using Bilinear Pairings

Abstract

A practical and efficient fair exchange scheme can be used in electronic commerce for exchanging digital goods with payment. In order to provide offline transaction, most of the practical and flexible fair exchange schemes need the involving of the trusted third parties to resolve the disputes and ensure the fairness in the exchange. Also, if a fair exchange service deals with the exchange between the payment and the digital goods, buyer-anonymity is a nice function to attract customers to use this service. In this paper, we propose a practical and efficient fair buyer-anonymity exchange scheme for electronic commerce. In our scheme, we use bilinear pairings in elliptic curves to reduce the computation and communication cost. Since only the customer and the merchant are involved during the exchange phase, our scheme can provide truly offline transaction. Also, the buyer anonymity is preserved in our scheme for attracting customers to use this service.