Undeniable fair exchange

  • Authors:
  • Montri Apiromvorakarn;Yongyuth Permpoontanalarp

  • Affiliations:
  • Logic and Security Laboratory, Department of Computing Engineering Department, King Mongkut's University of Technology Thonburi, BangMod, Tung-Kru, Bangkok, Thailand;Logic and Security Laboratory, Department of Computing Engineering Department, King Mongkut's University of Technology Thonburi, BangMod, Tung-Kru, Bangkok, Thailand

  • Venue:
  • MIV'06 Proceedings of the 6th WSEAS International Conference on Multimedia, Internet & Video Technologies
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Fair exchange is an electronic data exchange protocol that allows both sender and receiver to exchange information such that either all of parties have the exchanged information or none of them do. All existing approaches to fair exchange achieve the fair exchange property between a single sender and a receiver. However, they are unable to provide the fair exchange for all senders. A malicious receiver can deny receiving messages from some legitimate senders but do receive messages from conspired senders. Such unfair exchange is devastating in many applications such as electronic auction where the conspired sender can be the bid winner easily. We propose a fair exchange protocol which offers a new property, namely undeniable fairness for all senders. We show that our protocol is practical and secure for the fair exchange system.