Solving bao's colluding attack in wang's fair payment protocol

  • Authors:
  • M. Magdalena Payeras-Capellà;Josep L. Ferrer Gomila;Llorenç Huguet Rotger

  • Affiliations:
  • Universitat de les Illes Balears, Palma de Mallorca, Spain;Universitat de les Illes Balears, Palma de Mallorca, Spain;Universitat de les Illes Balears, Palma de Mallorca, Spain

  • Venue:
  • OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

An electronic purchase is an essential operation of electronic commerce Fairness in the exchange of money and product, as well as anonymity of the buyer, are desirable features In Asiacrypt 2003, C.H Wang [8] presented a purchase protocol satisfying both anonymity and fairness, adapting the anonymous payment system of Brands [2], using a restrictive confirmation signature scheme Later, In Asiacrypt 2004, Feng Bao [1] demonstrated that Wang's protocol [8] can be vulnerable to attacks produced by colluding users, and he affirmed that the protocol cannot be corrected due to the anonymity of the protocol We will show that it is possible to correct Wang's protocol in order to avoid colluding attacks We present a solution that modifies slightly the original protocol, maintaining the anonymity and untraceability of the original version Finally, we discuss the convenience to achieve the property of timeliness.