Distributed Auction Servers Resolving Winner and Winning Bid without Revealing Privacy of Bids

  • Authors:
  • Hiroaki Kikuchi;Shinji Hotta;Kensuke Abe;Shohachiro Nakanishi

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems: Workshops
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

We have developed an electronic auction system with a set of distributed servers that collaborate to resolve a winning bid without revealing the secrecy of bids. This paper describes the system architecture and shows the performance in terms of the round complexity and the bandwidth consumption for a message. Based on the actual measurements, the upper bound of number of bidding prices is identified. In addition, by adding some steps to the basic auction protocol in [KHT98], we improve the security of protocol so that even the winner must not know the second highest bid.