Distributed auction servers resolving winner and winning bid without revealing privacy of bids
説明
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 Kikuchi, Harkavy, and Tygar, 1998, we improve the security of protocol so that the second highest bid must not be known even by the winner.
収録刊行物
-
- Proceedings Seventh International Conference on Parallel and Distributed Systems: Workshops
-
Proceedings Seventh International Conference on Parallel and Distributed Systems: Workshops 307-312, 2002-11-08
IEEE Comput. Soc